./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-tiling/mbpr5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_a4c104b2-4803-4ad2-b378-2048ef074a0f/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a4c104b2-4803-4ad2-b378-2048ef074a0f/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a4c104b2-4803-4ad2-b378-2048ef074a0f/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a4c104b2-4803-4ad2-b378-2048ef074a0f/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/array-tiling/mbpr5.c -s /tmp/vcloud-vcloud-master/worker/run_dir_a4c104b2-4803-4ad2-b378-2048ef074a0f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a4c104b2-4803-4ad2-b378-2048ef074a0f/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 294ce98a2da4619fc118327a9f377eca99a10a1c ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_a4c104b2-4803-4ad2-b378-2048ef074a0f/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a4c104b2-4803-4ad2-b378-2048ef074a0f/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a4c104b2-4803-4ad2-b378-2048ef074a0f/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a4c104b2-4803-4ad2-b378-2048ef074a0f/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/array-tiling/mbpr5.c -s /tmp/vcloud-vcloud-master/worker/run_dir_a4c104b2-4803-4ad2-b378-2048ef074a0f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a4c104b2-4803-4ad2-b378-2048ef074a0f/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 294ce98a2da4619fc118327a9f377eca99a10a1c ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-678e011 [2019-11-20 01:46:14,512 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 01:46:14,514 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 01:46:14,525 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 01:46:14,525 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 01:46:14,526 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 01:46:14,527 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 01:46:14,529 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 01:46:14,531 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 01:46:14,532 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 01:46:14,533 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 01:46:14,534 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 01:46:14,534 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 01:46:14,536 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 01:46:14,536 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 01:46:14,538 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 01:46:14,538 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 01:46:14,539 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 01:46:14,541 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 01:46:14,543 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 01:46:14,544 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 01:46:14,545 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 01:46:14,546 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 01:46:14,547 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 01:46:14,549 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 01:46:14,549 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 01:46:14,549 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 01:46:14,550 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 01:46:14,550 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 01:46:14,551 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 01:46:14,551 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 01:46:14,552 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 01:46:14,553 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 01:46:14,553 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 01:46:14,554 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 01:46:14,554 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 01:46:14,555 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 01:46:14,555 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 01:46:14,555 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 01:46:14,556 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 01:46:14,556 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 01:46:14,557 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a4c104b2-4803-4ad2-b378-2048ef074a0f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 01:46:14,569 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 01:46:14,569 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 01:46:14,570 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 01:46:14,570 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 01:46:14,571 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 01:46:14,571 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 01:46:14,571 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 01:46:14,571 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 01:46:14,571 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 01:46:14,572 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 01:46:14,572 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 01:46:14,572 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 01:46:14,572 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 01:46:14,572 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 01:46:14,572 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 01:46:14,573 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 01:46:14,573 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 01:46:14,573 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 01:46:14,573 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 01:46:14,573 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 01:46:14,574 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 01:46:14,574 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 01:46:14,574 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 01:46:14,574 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 01:46:14,574 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 01:46:14,575 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 01:46:14,575 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 01:46:14,575 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 01:46:14,575 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_a4c104b2-4803-4ad2-b378-2048ef074a0f/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 -> 294ce98a2da4619fc118327a9f377eca99a10a1c [2019-11-20 01:46:14,728 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 01:46:14,739 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 01:46:14,741 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 01:46:14,742 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 01:46:14,743 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 01:46:14,743 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a4c104b2-4803-4ad2-b378-2048ef074a0f/bin/uautomizer/../../sv-benchmarks/c/array-tiling/mbpr5.c [2019-11-20 01:46:14,798 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a4c104b2-4803-4ad2-b378-2048ef074a0f/bin/uautomizer/data/c326d1d83/5cb6b57313af4d418b7b7b2bd7218b75/FLAG9f2e37b65 [2019-11-20 01:46:15,163 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 01:46:15,164 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a4c104b2-4803-4ad2-b378-2048ef074a0f/sv-benchmarks/c/array-tiling/mbpr5.c [2019-11-20 01:46:15,171 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a4c104b2-4803-4ad2-b378-2048ef074a0f/bin/uautomizer/data/c326d1d83/5cb6b57313af4d418b7b7b2bd7218b75/FLAG9f2e37b65 [2019-11-20 01:46:15,527 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a4c104b2-4803-4ad2-b378-2048ef074a0f/bin/uautomizer/data/c326d1d83/5cb6b57313af4d418b7b7b2bd7218b75 [2019-11-20 01:46:15,530 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 01:46:15,531 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 01:46:15,532 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 01:46:15,532 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 01:46:15,535 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 01:46:15,535 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 01:46:15" (1/1) ... [2019-11-20 01:46:15,543 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@632a148c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:46:15, skipping insertion in model container [2019-11-20 01:46:15,543 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 01:46:15" (1/1) ... [2019-11-20 01:46:15,550 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 01:46:15,580 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 01:46:15,861 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 01:46:15,865 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 01:46:15,920 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 01:46:15,944 INFO L192 MainTranslator]: Completed translation [2019-11-20 01:46:15,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:46:15 WrapperNode [2019-11-20 01:46:15,945 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 01:46:15,946 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 01:46:15,946 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 01:46:15,946 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 01:46:15,953 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:46:15" (1/1) ... [2019-11-20 01:46:15,963 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:46:15" (1/1) ... [2019-11-20 01:46:16,000 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 01:46:16,001 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 01:46:16,001 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 01:46:16,001 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 01:46:16,010 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:46:15" (1/1) ... [2019-11-20 01:46:16,010 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:46:15" (1/1) ... [2019-11-20 01:46:16,015 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:46:15" (1/1) ... [2019-11-20 01:46:16,015 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:46:15" (1/1) ... [2019-11-20 01:46:16,029 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:46:15" (1/1) ... [2019-11-20 01:46:16,040 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:46:15" (1/1) ... [2019-11-20 01:46:16,043 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:46:15" (1/1) ... [2019-11-20 01:46:16,046 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 01:46:16,046 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 01:46:16,046 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 01:46:16,047 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 01:46:16,047 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:46:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4c104b2-4803-4ad2-b378-2048ef074a0f/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 01:46:16,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-20 01:46:16,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 01:46:16,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 01:46:16,111 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-20 01:46:16,112 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 01:46:16,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 01:46:16,478 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 01:46:16,478 INFO L285 CfgBuilder]: Removed 12 assume(true) statements. [2019-11-20 01:46:16,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:46:16 BoogieIcfgContainer [2019-11-20 01:46:16,480 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 01:46:16,480 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 01:46:16,481 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 01:46:16,483 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 01:46:16,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 01:46:15" (1/3) ... [2019-11-20 01:46:16,484 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39ad6cd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 01:46:16, skipping insertion in model container [2019-11-20 01:46:16,484 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:46:15" (2/3) ... [2019-11-20 01:46:16,484 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39ad6cd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 01:46:16, skipping insertion in model container [2019-11-20 01:46:16,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:46:16" (3/3) ... [2019-11-20 01:46:16,486 INFO L109 eAbstractionObserver]: Analyzing ICFG mbpr5.c [2019-11-20 01:46:16,495 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 01:46:16,501 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 01:46:16,511 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 01:46:16,528 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 01:46:16,528 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 01:46:16,529 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 01:46:16,529 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 01:46:16,529 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 01:46:16,529 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 01:46:16,529 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 01:46:16,529 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 01:46:16,541 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2019-11-20 01:46:16,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-20 01:46:16,547 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:46:16,548 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:46:16,548 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:46:16,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:46:16,552 INFO L82 PathProgramCache]: Analyzing trace with hash 2005705728, now seen corresponding path program 1 times [2019-11-20 01:46:16,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:46:16,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354537863] [2019-11-20 01:46:16,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:46:16,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:46:16,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:46:16,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354537863] [2019-11-20 01:46:16,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:46:16,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 01:46:16,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648531212] [2019-11-20 01:46:16,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-20 01:46:16,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:46:16,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-20 01:46:16,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 01:46:16,697 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 2 states. [2019-11-20 01:46:16,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:46:16,716 INFO L93 Difference]: Finished difference Result 76 states and 111 transitions. [2019-11-20 01:46:16,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-20 01:46:16,717 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2019-11-20 01:46:16,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:46:16,725 INFO L225 Difference]: With dead ends: 76 [2019-11-20 01:46:16,725 INFO L226 Difference]: Without dead ends: 37 [2019-11-20 01:46:16,728 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 01:46:16,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-11-20 01:46:16,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-11-20 01:46:16,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-20 01:46:16,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2019-11-20 01:46:16,754 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 19 [2019-11-20 01:46:16,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:46:16,754 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2019-11-20 01:46:16,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-20 01:46:16,754 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2019-11-20 01:46:16,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-20 01:46:16,755 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:46:16,755 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:46:16,756 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:46:16,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:46:16,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1810000308, now seen corresponding path program 1 times [2019-11-20 01:46:16,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:46:16,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422076988] [2019-11-20 01:46:16,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:46:16,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:46:17,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:46:17,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422076988] [2019-11-20 01:46:17,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:46:17,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-20 01:46:17,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832704459] [2019-11-20 01:46:17,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 01:46:17,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:46:17,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 01:46:17,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-11-20 01:46:17,222 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand 7 states. [2019-11-20 01:46:17,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:46:17,479 INFO L93 Difference]: Finished difference Result 86 states and 116 transitions. [2019-11-20 01:46:17,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 01:46:17,480 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-11-20 01:46:17,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:46:17,481 INFO L225 Difference]: With dead ends: 86 [2019-11-20 01:46:17,481 INFO L226 Difference]: Without dead ends: 57 [2019-11-20 01:46:17,482 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-11-20 01:46:17,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-20 01:46:17,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 42. [2019-11-20 01:46:17,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-20 01:46:17,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 53 transitions. [2019-11-20 01:46:17,495 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 53 transitions. Word has length 19 [2019-11-20 01:46:17,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:46:17,496 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 53 transitions. [2019-11-20 01:46:17,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 01:46:17,496 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 53 transitions. [2019-11-20 01:46:17,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-20 01:46:17,498 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:46:17,498 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:46:17,499 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:46:17,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:46:17,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1666752049, now seen corresponding path program 1 times [2019-11-20 01:46:17,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:46:17,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084192432] [2019-11-20 01:46:17,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:46:17,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:46:17,637 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-20 01:46:17,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084192432] [2019-11-20 01:46:17,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:46:17,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:46:17,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290293501] [2019-11-20 01:46:17,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:46:17,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:46:17,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:46:17,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:46:17,639 INFO L87 Difference]: Start difference. First operand 42 states and 53 transitions. Second operand 3 states. [2019-11-20 01:46:17,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:46:17,673 INFO L93 Difference]: Finished difference Result 67 states and 85 transitions. [2019-11-20 01:46:17,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:46:17,674 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-20 01:46:17,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:46:17,675 INFO L225 Difference]: With dead ends: 67 [2019-11-20 01:46:17,675 INFO L226 Difference]: Without dead ends: 42 [2019-11-20 01:46:17,676 INFO L630 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-20 01:46:17,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-20 01:46:17,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-11-20 01:46:17,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-20 01:46:17,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2019-11-20 01:46:17,689 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 39 [2019-11-20 01:46:17,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:46:17,690 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2019-11-20 01:46:17,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:46:17,691 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2019-11-20 01:46:17,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-20 01:46:17,693 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:46:17,693 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:46:17,693 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:46:17,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:46:17,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1447897331, now seen corresponding path program 1 times [2019-11-20 01:46:17,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:46:17,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166358044] [2019-11-20 01:46:17,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:46:17,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:46:17,838 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-20 01:46:17,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166358044] [2019-11-20 01:46:17,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:46:17,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:46:17,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563477086] [2019-11-20 01:46:17,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:46:17,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:46:17,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:46:17,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:46:17,845 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. Second operand 3 states. [2019-11-20 01:46:17,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:46:17,871 INFO L93 Difference]: Finished difference Result 55 states and 68 transitions. [2019-11-20 01:46:17,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:46:17,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-20 01:46:17,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:46:17,873 INFO L225 Difference]: With dead ends: 55 [2019-11-20 01:46:17,873 INFO L226 Difference]: Without dead ends: 42 [2019-11-20 01:46:17,874 INFO L630 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-20 01:46:17,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-20 01:46:17,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-11-20 01:46:17,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-20 01:46:17,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2019-11-20 01:46:17,878 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 39 [2019-11-20 01:46:17,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:46:17,879 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2019-11-20 01:46:17,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:46:17,879 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2019-11-20 01:46:17,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-20 01:46:17,880 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:46:17,880 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:46:17,880 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:46:17,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:46:17,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1054870321, now seen corresponding path program 1 times [2019-11-20 01:46:17,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:46:17,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972901662] [2019-11-20 01:46:17,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:46:17,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:46:19,201 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 01:46:19,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972901662] [2019-11-20 01:46:19,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820230007] [2019-11-20 01:46:19,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4c104b2-4803-4ad2-b378-2048ef074a0f/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:46:19,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:46:19,277 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-20 01:46:19,285 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:46:19,410 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-11-20 01:46:19,410 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:46:19,422 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:46:19,423 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:46:19,423 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2019-11-20 01:46:19,470 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 181 treesize of output 146 [2019-11-20 01:46:19,474 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,475 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,478 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,479 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,481 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,482 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,484 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,485 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,486 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,487 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,493 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,495 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,496 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,499 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,500 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,502 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,510 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,511 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,512 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,513 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,515 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,516 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,517 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,518 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,520 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,522 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,527 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 47 treesize of output 47 [2019-11-20 01:46:19,529 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:46:19,532 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:46:19,532 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:46:19,543 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:46:19,543 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:46:19,543 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:187, output treesize:14 [2019-11-20 01:46:19,632 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,635 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2019-11-20 01:46:19,636 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:46:19,649 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:46:19,650 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:46:19,650 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:17 [2019-11-20 01:46:19,663 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 271 treesize of output 236 [2019-11-20 01:46:19,667 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,668 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,669 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,671 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,673 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,674 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,677 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,679 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,683 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,691 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,694 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,695 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,697 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,698 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,700 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,705 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,706 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,708 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,709 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,710 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,711 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,713 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,715 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,717 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,768 INFO L343 Elim1Store]: treesize reduction 22, result has 53.2 percent of original size [2019-11-20 01:46:19,769 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 76 [2019-11-20 01:46:19,770 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:46:19,776 INFO L567 ElimStorePlain]: treesize reduction 27, result has 20.6 percent of original size [2019-11-20 01:46:19,776 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:46:19,785 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:46:19,785 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:46:19,786 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:280, output treesize:14 [2019-11-20 01:46:19,799 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,801 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2019-11-20 01:46:19,802 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:46:19,813 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:46:19,813 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:46:19,814 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:17 [2019-11-20 01:46:19,823 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 271 treesize of output 236 [2019-11-20 01:46:19,837 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,838 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,840 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,841 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,842 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,843 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,846 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,847 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,847 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,851 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,852 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,853 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,855 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,856 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,857 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,860 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,861 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,863 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,864 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,869 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,873 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,875 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,876 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,878 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,918 INFO L343 Elim1Store]: treesize reduction 22, result has 53.2 percent of original size [2019-11-20 01:46:19,919 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 76 [2019-11-20 01:46:19,920 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:46:19,925 INFO L567 ElimStorePlain]: treesize reduction 27, result has 20.6 percent of original size [2019-11-20 01:46:19,925 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:46:19,933 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:46:19,933 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:46:19,934 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:280, output treesize:14 [2019-11-20 01:46:19,944 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,945 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2019-11-20 01:46:19,946 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:46:19,955 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:46:19,956 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:46:19,956 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:17 [2019-11-20 01:46:19,963 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 271 treesize of output 236 [2019-11-20 01:46:19,969 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,970 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,971 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,972 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,973 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,974 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,977 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,978 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,979 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,981 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,982 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,983 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,984 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,986 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,987 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,994 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,995 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,996 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,997 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,998 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:19,999 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:20,000 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:20,001 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:20,003 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:20,022 INFO L343 Elim1Store]: treesize reduction 22, result has 53.2 percent of original size [2019-11-20 01:46:20,023 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 76 [2019-11-20 01:46:20,023 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:46:20,028 INFO L567 ElimStorePlain]: treesize reduction 27, result has 20.6 percent of original size [2019-11-20 01:46:20,028 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:46:20,034 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:46:20,034 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:46:20,034 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:280, output treesize:14 [2019-11-20 01:46:20,046 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:20,047 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2019-11-20 01:46:20,047 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:46:20,055 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:46:20,056 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:46:20,056 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2019-11-20 01:46:20,093 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 283 treesize of output 246 [2019-11-20 01:46:20,097 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:20,098 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:20,099 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:20,100 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:20,101 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:20,103 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:20,104 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:20,106 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:20,107 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:20,108 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:20,113 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:20,114 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:20,115 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:20,116 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:20,118 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:20,119 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:20,121 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:20,122 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:20,123 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:20,124 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:20,129 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:20,130 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:20,132 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:20,133 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:20,134 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:20,136 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:20,137 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:20,138 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:20,139 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:20,140 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:20,141 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:20,142 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:20,143 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:20,145 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:20,172 INFO L343 Elim1Store]: treesize reduction 26, result has 44.7 percent of original size [2019-11-20 01:46:20,172 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 81 treesize of output 87 [2019-11-20 01:46:20,173 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:46:20,189 INFO L567 ElimStorePlain]: treesize reduction 26, result has 43.5 percent of original size [2019-11-20 01:46:20,190 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:46:20,199 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:46:20,200 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:46:20,200 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:292, output treesize:29 [2019-11-20 01:46:20,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:20,351 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:46:20,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:46:20,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2019-11-20 01:46:20,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779675707] [2019-11-20 01:46:20,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-20 01:46:20,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:46:20,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-20 01:46:20,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=415, Unknown=0, NotChecked=0, Total=506 [2019-11-20 01:46:20,354 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. Second operand 23 states. [2019-11-20 01:46:21,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:46:21,448 INFO L93 Difference]: Finished difference Result 120 states and 143 transitions. [2019-11-20 01:46:21,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-20 01:46:21,448 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 39 [2019-11-20 01:46:21,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:46:21,450 INFO L225 Difference]: With dead ends: 120 [2019-11-20 01:46:21,450 INFO L226 Difference]: Without dead ends: 83 [2019-11-20 01:46:21,451 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 31 SyntacticMatches, 16 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=290, Invalid=900, Unknown=0, NotChecked=0, Total=1190 [2019-11-20 01:46:21,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-20 01:46:21,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 44. [2019-11-20 01:46:21,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-20 01:46:21,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2019-11-20 01:46:21,464 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 39 [2019-11-20 01:46:21,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:46:21,465 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2019-11-20 01:46:21,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-20 01:46:21,465 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2019-11-20 01:46:21,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-20 01:46:21,469 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:46:21,469 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:46:21,673 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:46:21,674 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:46:21,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:46:21,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1054810739, now seen corresponding path program 1 times [2019-11-20 01:46:21,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:46:21,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982199603] [2019-11-20 01:46:21,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:46:21,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:46:21,750 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 01:46:21,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982199603] [2019-11-20 01:46:21,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:46:21,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 01:46:21,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580803305] [2019-11-20 01:46:21,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:46:21,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:46:21,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:46:21,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:46:21,752 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand 4 states. [2019-11-20 01:46:21,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:46:21,792 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2019-11-20 01:46:21,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 01:46:21,793 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-11-20 01:46:21,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:46:21,794 INFO L225 Difference]: With dead ends: 50 [2019-11-20 01:46:21,794 INFO L226 Difference]: Without dead ends: 48 [2019-11-20 01:46:21,794 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:46:21,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-11-20 01:46:21,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2019-11-20 01:46:21,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-20 01:46:21,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2019-11-20 01:46:21,800 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 39 [2019-11-20 01:46:21,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:46:21,801 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2019-11-20 01:46:21,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:46:21,801 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2019-11-20 01:46:21,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-20 01:46:21,802 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:46:21,802 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:46:21,803 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:46:21,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:46:21,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1138695132, now seen corresponding path program 1 times [2019-11-20 01:46:21,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:46:21,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894868586] [2019-11-20 01:46:21,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:46:21,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:46:22,627 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 01:46:22,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894868586] [2019-11-20 01:46:22,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745544312] [2019-11-20 01:46:22,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4c104b2-4803-4ad2-b378-2048ef074a0f/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:46:22,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:46:22,687 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-20 01:46:22,690 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:46:22,773 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-11-20 01:46:22,773 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:46:22,781 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:46:22,782 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:46:22,782 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2019-11-20 01:46:22,810 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 151 treesize of output 116 [2019-11-20 01:46:22,811 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:22,812 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:22,813 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:22,814 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:22,815 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:22,816 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:22,817 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:22,818 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:22,818 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:22,819 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:22,821 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:22,822 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:22,822 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:22,829 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:22,830 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:22,831 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:22,833 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:22,834 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:22,835 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:22,836 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:22,839 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:22,840 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:22,841 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:22,842 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:22,842 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:22,843 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:22,846 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 45 treesize of output 47 [2019-11-20 01:46:22,846 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:46:22,849 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:46:22,849 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:46:22,854 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:46:22,855 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:46:22,855 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:157, output treesize:16 [2019-11-20 01:46:22,917 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:22,918 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-11-20 01:46:22,918 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:46:22,926 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:46:22,926 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:46:22,926 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-11-20 01:46:22,931 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 273 treesize of output 238 [2019-11-20 01:46:22,932 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:22,933 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:22,934 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:22,935 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:22,935 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:22,936 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:22,937 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:22,941 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:22,945 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:22,948 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:22,949 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:22,950 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:22,951 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:22,951 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:22,952 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:22,956 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:22,957 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:22,958 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:22,959 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:22,960 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:22,961 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:22,962 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:22,962 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:22,963 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:22,980 INFO L343 Elim1Store]: treesize reduction 26, result has 54.4 percent of original size [2019-11-20 01:46:22,980 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 82 [2019-11-20 01:46:22,981 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:46:22,985 INFO L567 ElimStorePlain]: treesize reduction 31, result has 22.5 percent of original size [2019-11-20 01:46:22,985 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:46:22,991 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:46:22,991 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:46:22,991 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:282, output treesize:16 [2019-11-20 01:46:22,996 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:22,996 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-11-20 01:46:22,997 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:46:23,004 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:46:23,005 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:46:23,005 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-11-20 01:46:23,012 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 273 treesize of output 238 [2019-11-20 01:46:23,014 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:23,015 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:23,016 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:23,017 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:23,017 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:23,018 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:23,019 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:23,021 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:23,022 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:23,024 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:23,025 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:23,026 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:23,027 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:23,028 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:23,029 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:23,031 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:23,032 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:23,033 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:23,034 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:23,035 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:23,036 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:23,037 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:23,037 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:23,038 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:23,056 INFO L343 Elim1Store]: treesize reduction 26, result has 54.4 percent of original size [2019-11-20 01:46:23,057 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 82 [2019-11-20 01:46:23,058 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:46:23,063 INFO L567 ElimStorePlain]: treesize reduction 31, result has 22.5 percent of original size [2019-11-20 01:46:23,063 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:46:23,070 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:46:23,071 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:46:23,071 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:282, output treesize:16 [2019-11-20 01:46:23,078 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:23,079 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-11-20 01:46:23,079 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:46:23,088 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:46:23,088 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:46:23,088 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-11-20 01:46:23,139 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 285 treesize of output 248 [2019-11-20 01:46:23,141 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:23,142 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:23,144 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:23,157 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:23,161 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:23,162 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:23,163 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:23,164 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:23,165 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:23,166 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:23,167 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:23,171 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:23,172 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:23,177 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:23,181 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:23,183 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:23,184 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:23,185 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:23,186 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:23,187 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:23,189 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:23,190 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:23,191 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:23,193 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:23,194 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:23,195 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:23,197 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:23,198 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:23,199 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:23,200 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:23,201 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:23,202 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:23,203 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:23,204 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:23,225 INFO L343 Elim1Store]: treesize reduction 32, result has 43.9 percent of original size [2019-11-20 01:46:23,226 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 91 [2019-11-20 01:46:23,226 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:46:23,237 INFO L567 ElimStorePlain]: treesize reduction 30, result has 42.3 percent of original size [2019-11-20 01:46:23,237 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:46:23,248 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:46:23,248 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:46:23,248 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:294, output treesize:31 [2019-11-20 01:46:23,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:23,386 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 01:46:23,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:46:23,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 26 [2019-11-20 01:46:23,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612142180] [2019-11-20 01:46:23,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-20 01:46:23,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:46:23,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-20 01:46:23,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650 [2019-11-20 01:46:23,388 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand 26 states. [2019-11-20 01:46:24,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:46:24,477 INFO L93 Difference]: Finished difference Result 107 states and 125 transitions. [2019-11-20 01:46:24,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-20 01:46:24,478 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 45 [2019-11-20 01:46:24,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:46:24,479 INFO L225 Difference]: With dead ends: 107 [2019-11-20 01:46:24,479 INFO L226 Difference]: Without dead ends: 72 [2019-11-20 01:46:24,480 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 39 SyntacticMatches, 9 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=360, Invalid=1200, Unknown=0, NotChecked=0, Total=1560 [2019-11-20 01:46:24,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-11-20 01:46:24,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 52. [2019-11-20 01:46:24,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-20 01:46:24,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2019-11-20 01:46:24,487 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 45 [2019-11-20 01:46:24,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:46:24,487 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2019-11-20 01:46:24,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-20 01:46:24,487 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2019-11-20 01:46:24,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-20 01:46:24,488 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:46:24,488 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:46:24,689 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:46:24,689 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:46:24,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:46:24,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1041630505, now seen corresponding path program 2 times [2019-11-20 01:46:24,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:46:24,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7197652] [2019-11-20 01:46:24,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:46:24,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:46:25,660 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 01:46:25,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7197652] [2019-11-20 01:46:25,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219732014] [2019-11-20 01:46:25,663 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4c104b2-4803-4ad2-b378-2048ef074a0f/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:46:25,726 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 01:46:25,726 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 01:46:25,727 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-20 01:46:25,730 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:46:25,795 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-11-20 01:46:25,795 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:46:25,805 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:46:25,806 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:46:25,806 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2019-11-20 01:46:25,843 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 151 treesize of output 116 [2019-11-20 01:46:25,846 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:25,847 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:25,848 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:25,849 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:25,850 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:25,850 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:25,851 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:25,852 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:25,853 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:25,854 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:25,856 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:25,857 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:25,858 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:25,859 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:25,860 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:25,861 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:25,864 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:25,865 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:25,866 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:25,867 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:25,868 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:25,869 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:25,870 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:25,871 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:25,872 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:25,873 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:25,875 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 45 treesize of output 47 [2019-11-20 01:46:25,876 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:46:25,878 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:46:25,878 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:46:25,884 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:46:25,885 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:46:25,885 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:157, output treesize:16 [2019-11-20 01:46:25,940 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:25,941 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-11-20 01:46:25,941 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:46:25,950 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:46:25,951 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:46:25,951 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2019-11-20 01:46:25,965 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 273 treesize of output 238 [2019-11-20 01:46:25,968 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:25,969 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:25,970 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:25,971 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:25,972 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:25,973 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:25,974 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:25,975 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:25,977 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:25,979 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:25,980 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:25,981 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:25,982 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:25,983 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:25,984 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:25,986 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:25,987 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:25,988 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:25,989 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:25,993 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:25,997 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:25,999 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:26,000 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:26,000 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:26,025 INFO L343 Elim1Store]: treesize reduction 26, result has 54.4 percent of original size [2019-11-20 01:46:26,026 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 82 [2019-11-20 01:46:26,027 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:46:26,031 INFO L567 ElimStorePlain]: treesize reduction 31, result has 22.5 percent of original size [2019-11-20 01:46:26,031 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:46:26,037 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:46:26,037 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:46:26,037 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:282, output treesize:16 [2019-11-20 01:46:26,042 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:26,042 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-11-20 01:46:26,042 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:46:26,052 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:46:26,052 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:46:26,052 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-11-20 01:46:26,082 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 285 treesize of output 248 [2019-11-20 01:46:26,084 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:26,085 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:26,086 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:26,087 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:26,088 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:26,088 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:26,089 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:26,090 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:26,091 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:26,092 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:26,092 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:26,093 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:26,094 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:26,100 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:26,103 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:26,104 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:26,105 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:26,106 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:26,107 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:26,108 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:26,110 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:26,111 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:26,111 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:26,112 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:26,113 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:26,114 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:26,115 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:26,116 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:26,116 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:26,117 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:26,118 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:26,120 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:26,121 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:26,122 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:46:26,139 INFO L343 Elim1Store]: treesize reduction 26, result has 54.4 percent of original size [2019-11-20 01:46:26,140 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 97 [2019-11-20 01:46:26,140 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:46:26,150 INFO L567 ElimStorePlain]: treesize reduction 30, result has 42.3 percent of original size [2019-11-20 01:46:26,150 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:46:26,158 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:46:26,158 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:46:26,158 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:294, output treesize:31 [2019-11-20 01:46:26,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:26,349 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 01:46:26,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:46:26,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 28 [2019-11-20 01:46:26,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773230997] [2019-11-20 01:46:26,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-20 01:46:26,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:46:26,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-20 01:46:26,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=645, Unknown=0, NotChecked=0, Total=756 [2019-11-20 01:46:26,351 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand 28 states. [2019-11-20 01:46:29,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:46:29,327 INFO L93 Difference]: Finished difference Result 186 states and 212 transitions. [2019-11-20 01:46:29,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-11-20 01:46:29,328 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 51 [2019-11-20 01:46:29,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:46:29,329 INFO L225 Difference]: With dead ends: 186 [2019-11-20 01:46:29,329 INFO L226 Difference]: Without dead ends: 163 [2019-11-20 01:46:29,332 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 42 SyntacticMatches, 9 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 943 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=852, Invalid=3180, Unknown=0, NotChecked=0, Total=4032 [2019-11-20 01:46:29,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-11-20 01:46:29,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 98. [2019-11-20 01:46:29,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-20 01:46:29,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 114 transitions. [2019-11-20 01:46:29,351 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 114 transitions. Word has length 51 [2019-11-20 01:46:29,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:46:29,352 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 114 transitions. [2019-11-20 01:46:29,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-20 01:46:29,352 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 114 transitions. [2019-11-20 01:46:29,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-20 01:46:29,353 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:46:29,353 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1] [2019-11-20 01:46:29,555 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:46:29,556 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:46:29,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:46:29,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1392901962, now seen corresponding path program 3 times [2019-11-20 01:46:29,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:46:29,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946703737] [2019-11-20 01:46:29,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:46:29,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:46:30,393 WARN L191 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 279 DAG size of output: 33 [2019-11-20 01:46:30,634 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 252 DAG size of output: 16 [2019-11-20 01:46:30,776 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 23 [2019-11-20 01:46:30,980 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 25 [2019-11-20 01:46:31,134 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 31 [2019-11-20 01:46:31,623 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 31 [2019-11-20 01:46:31,828 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 49 [2019-11-20 01:46:32,126 WARN L191 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 36 [2019-11-20 01:46:32,263 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 30 [2019-11-20 01:46:32,749 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:46:32,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946703737] [2019-11-20 01:46:32,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [34174962] [2019-11-20 01:46:32,750 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4c104b2-4803-4ad2-b378-2048ef074a0f/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:46:32,809 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-20 01:46:32,810 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 01:46:32,811 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-20 01:46:32,814 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:46:32,911 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-11-20 01:46:32,911 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:46:32,920 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:46:32,921 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:46:32,921 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-11-20 01:46:32,962 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 151 treesize of output 116 [2019-11-20 01:46:35,806 WARN L191 SmtUtils]: Spent 2.82 s on a formula simplification. DAG size of input: 486 DAG size of output: 147 [2019-11-20 01:46:35,808 INFO L343 Elim1Store]: treesize reduction 4252, result has 8.4 percent of original size [2019-11-20 01:46:35,809 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 15 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 20 new quantified variables, introduced 115 case distinctions, treesize of input 50038 treesize of output 20833 [2019-11-20 01:46:35,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:35,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:35,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:35,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:35,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:35,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:35,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:35,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:35,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:35,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:35,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:35,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:35,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:35,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:35,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:35,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:35,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:35,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:35,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:35,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:35,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:35,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:35,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:35,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:36,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:37,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:38,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:39,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:40,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:46:41,990 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:46:41,991 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: This case should habe been handled by DER at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:192) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.(DerPreprocessor.java:95) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:291) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:201) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.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.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-20 01:46:41,994 INFO L168 Benchmark]: Toolchain (without parser) took 26464.02 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 566.8 MB). Free memory was 950.1 MB in the beginning and 975.8 MB in the end (delta: -25.7 MB). Peak memory consumption was 668.3 MB. Max. memory is 11.5 GB. [2019-11-20 01:46:41,995 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 01:46:41,995 INFO L168 Benchmark]: CACSL2BoogieTranslator took 413.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -189.4 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-11-20 01:46:41,995 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-20 01:46:41,996 INFO L168 Benchmark]: Boogie Preprocessor took 44.88 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 01:46:41,996 INFO L168 Benchmark]: RCFGBuilder took 433.60 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: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. [2019-11-20 01:46:41,996 INFO L168 Benchmark]: TraceAbstraction took 25513.02 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 422.1 MB). Free memory was 1.1 GB in the beginning and 975.8 MB in the end (delta: 129.2 MB). Peak memory consumption was 678.6 MB. Max. memory is 11.5 GB. [2019-11-20 01:46:42,001 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 413.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -189.4 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 55.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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 44.88 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 433.60 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: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 25513.02 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 422.1 MB). Free memory was 1.1 GB in the beginning and 975.8 MB in the end (delta: 129.2 MB). Peak memory consumption was 678.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: This case should habe been handled by DER: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-678e011 [2019-11-20 01:46:43,862 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 01:46:43,864 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 01:46:43,876 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 01:46:43,876 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 01:46:43,877 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 01:46:43,878 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 01:46:43,880 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 01:46:43,882 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 01:46:43,883 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 01:46:43,884 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 01:46:43,885 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 01:46:43,885 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 01:46:43,886 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 01:46:43,887 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 01:46:43,888 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 01:46:43,889 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 01:46:43,890 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 01:46:43,892 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 01:46:43,894 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 01:46:43,895 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 01:46:43,896 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 01:46:43,897 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 01:46:43,898 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 01:46:43,901 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 01:46:43,901 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 01:46:43,901 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 01:46:43,902 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 01:46:43,903 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 01:46:43,904 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 01:46:43,904 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 01:46:43,905 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 01:46:43,905 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 01:46:43,906 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 01:46:43,907 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 01:46:43,908 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 01:46:43,908 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 01:46:43,908 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 01:46:43,909 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 01:46:43,910 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 01:46:43,910 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 01:46:43,911 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a4c104b2-4803-4ad2-b378-2048ef074a0f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-20 01:46:43,925 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 01:46:43,926 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 01:46:43,927 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 01:46:43,927 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 01:46:43,927 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 01:46:43,928 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 01:46:43,928 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 01:46:43,928 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 01:46:43,929 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 01:46:43,929 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 01:46:43,929 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 01:46:43,929 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 01:46:43,930 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-20 01:46:43,930 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-20 01:46:43,930 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 01:46:43,931 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 01:46:43,931 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 01:46:43,931 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 01:46:43,931 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 01:46:43,932 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 01:46:43,932 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 01:46:43,932 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 01:46:43,932 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 01:46:43,933 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 01:46:43,933 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 01:46:43,933 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 01:46:43,934 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-20 01:46:43,934 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-20 01:46:43,934 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 01:46:43,934 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 01:46:43,935 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_a4c104b2-4803-4ad2-b378-2048ef074a0f/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 -> 294ce98a2da4619fc118327a9f377eca99a10a1c [2019-11-20 01:46:44,257 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 01:46:44,266 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 01:46:44,270 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 01:46:44,271 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 01:46:44,271 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 01:46:44,272 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a4c104b2-4803-4ad2-b378-2048ef074a0f/bin/uautomizer/../../sv-benchmarks/c/array-tiling/mbpr5.c [2019-11-20 01:46:44,319 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a4c104b2-4803-4ad2-b378-2048ef074a0f/bin/uautomizer/data/b6a57991a/64c50712ae544d60aa1e30fc7d32b0b5/FLAGb6f45e803 [2019-11-20 01:46:44,711 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 01:46:44,712 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a4c104b2-4803-4ad2-b378-2048ef074a0f/sv-benchmarks/c/array-tiling/mbpr5.c [2019-11-20 01:46:44,719 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a4c104b2-4803-4ad2-b378-2048ef074a0f/bin/uautomizer/data/b6a57991a/64c50712ae544d60aa1e30fc7d32b0b5/FLAGb6f45e803 [2019-11-20 01:46:45,062 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a4c104b2-4803-4ad2-b378-2048ef074a0f/bin/uautomizer/data/b6a57991a/64c50712ae544d60aa1e30fc7d32b0b5 [2019-11-20 01:46:45,065 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 01:46:45,066 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 01:46:45,068 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 01:46:45,068 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 01:46:45,072 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 01:46:45,073 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 01:46:45" (1/1) ... [2019-11-20 01:46:45,076 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1440216e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:46:45, skipping insertion in model container [2019-11-20 01:46:45,076 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 01:46:45" (1/1) ... [2019-11-20 01:46:45,084 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 01:46:45,115 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 01:46:45,387 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 01:46:45,392 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 01:46:45,461 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 01:46:45,547 INFO L192 MainTranslator]: Completed translation [2019-11-20 01:46:45,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:46:45 WrapperNode [2019-11-20 01:46:45,552 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 01:46:45,553 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 01:46:45,553 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 01:46:45,554 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 01:46:45,562 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:46:45" (1/1) ... [2019-11-20 01:46:45,572 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:46:45" (1/1) ... [2019-11-20 01:46:45,600 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 01:46:45,606 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 01:46:45,606 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 01:46:45,606 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 01:46:45,616 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:46:45" (1/1) ... [2019-11-20 01:46:45,617 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:46:45" (1/1) ... [2019-11-20 01:46:45,620 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:46:45" (1/1) ... [2019-11-20 01:46:45,621 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:46:45" (1/1) ... [2019-11-20 01:46:45,633 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:46:45" (1/1) ... [2019-11-20 01:46:45,638 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:46:45" (1/1) ... [2019-11-20 01:46:45,640 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:46:45" (1/1) ... [2019-11-20 01:46:45,644 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 01:46:45,644 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 01:46:45,644 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 01:46:45,645 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 01:46:45,645 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:46:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4c104b2-4803-4ad2-b378-2048ef074a0f/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 01:46:45,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-20 01:46:45,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 01:46:45,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 01:46:45,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 01:46:45,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-20 01:46:45,696 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 01:46:46,446 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 01:46:46,446 INFO L285 CfgBuilder]: Removed 12 assume(true) statements. [2019-11-20 01:46:46,447 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:46:46 BoogieIcfgContainer [2019-11-20 01:46:46,447 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 01:46:46,448 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 01:46:46,448 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 01:46:46,450 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 01:46:46,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 01:46:45" (1/3) ... [2019-11-20 01:46:46,451 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fdb505b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 01:46:46, skipping insertion in model container [2019-11-20 01:46:46,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:46:45" (2/3) ... [2019-11-20 01:46:46,451 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fdb505b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 01:46:46, skipping insertion in model container [2019-11-20 01:46:46,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:46:46" (3/3) ... [2019-11-20 01:46:46,452 INFO L109 eAbstractionObserver]: Analyzing ICFG mbpr5.c [2019-11-20 01:46:46,458 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 01:46:46,463 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 01:46:46,470 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 01:46:46,489 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 01:46:46,489 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 01:46:46,489 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 01:46:46,489 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 01:46:46,489 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 01:46:46,490 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 01:46:46,490 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 01:46:46,490 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 01:46:46,501 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2019-11-20 01:46:46,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-20 01:46:46,506 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:46:46,507 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:46:46,507 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:46:46,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:46:46,511 INFO L82 PathProgramCache]: Analyzing trace with hash 2005705728, now seen corresponding path program 1 times [2019-11-20 01:46:46,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:46:46,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2131360628] [2019-11-20 01:46:46,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4c104b2-4803-4ad2-b378-2048ef074a0f/bin/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:46:46,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:46:46,633 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-20 01:46:46,640 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:46:46,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:46:46,664 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:46:46,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:46:46,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2131360628] [2019-11-20 01:46:46,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:46:46,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-20 01:46:46,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223604613] [2019-11-20 01:46:46,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-20 01:46:46,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:46:46,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-20 01:46:46,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 01:46:46,700 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 2 states. [2019-11-20 01:46:46,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:46:46,723 INFO L93 Difference]: Finished difference Result 76 states and 111 transitions. [2019-11-20 01:46:46,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-20 01:46:46,724 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2019-11-20 01:46:46,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:46:46,733 INFO L225 Difference]: With dead ends: 76 [2019-11-20 01:46:46,733 INFO L226 Difference]: Without dead ends: 37 [2019-11-20 01:46:46,736 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 01:46:46,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-11-20 01:46:46,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-11-20 01:46:46,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-20 01:46:46,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2019-11-20 01:46:46,767 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 19 [2019-11-20 01:46:46,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:46:46,768 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2019-11-20 01:46:46,768 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-20 01:46:46,768 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2019-11-20 01:46:46,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-20 01:46:46,770 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:46:46,770 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:46:46,971 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:46:46,971 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:46:46,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:46:46,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1810000308, now seen corresponding path program 1 times [2019-11-20 01:46:46,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:46:46,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [326598563] [2019-11-20 01:46:46,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4c104b2-4803-4ad2-b378-2048ef074a0f/bin/uautomizer/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:46:47,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:46:47,288 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 01:46:47,290 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:46:47,521 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-11-20 01:46:47,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:46:47,556 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:46:47,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:46:47,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [326598563] [2019-11-20 01:46:47,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:46:47,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 01:46:47,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535092773] [2019-11-20 01:46:47,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 01:46:47,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:46:47,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 01:46:47,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-20 01:46:47,940 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand 6 states. [2019-11-20 01:46:48,384 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-11-20 01:46:49,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:46:49,296 INFO L93 Difference]: Finished difference Result 78 states and 101 transitions. [2019-11-20 01:46:49,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 01:46:49,304 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-11-20 01:46:49,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:46:49,305 INFO L225 Difference]: With dead ends: 78 [2019-11-20 01:46:49,306 INFO L226 Difference]: Without dead ends: 49 [2019-11-20 01:46:49,307 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-11-20 01:46:49,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-20 01:46:49,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 38. [2019-11-20 01:46:49,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-20 01:46:49,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 49 transitions. [2019-11-20 01:46:49,315 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 49 transitions. Word has length 19 [2019-11-20 01:46:49,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:46:49,316 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 49 transitions. [2019-11-20 01:46:49,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 01:46:49,316 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2019-11-20 01:46:49,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-20 01:46:49,318 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:46:49,318 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:46:49,521 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:46:49,521 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:46:49,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:46:49,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1436265223, now seen corresponding path program 1 times [2019-11-20 01:46:49,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:46:49,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1399993913] [2019-11-20 01:46:49,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4c104b2-4803-4ad2-b378-2048ef074a0f/bin/uautomizer/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:46:49,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:46:49,691 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 01:46:49,692 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:46:50,532 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-11-20 01:46:50,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:46:50,536 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:46:51,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:46:51,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1399993913] [2019-11-20 01:46:51,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:46:51,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-11-20 01:46:51,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998670367] [2019-11-20 01:46:51,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 01:46:51,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:46:51,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 01:46:51,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-11-20 01:46:51,907 INFO L87 Difference]: Start difference. First operand 38 states and 49 transitions. Second operand 12 states. [2019-11-20 01:46:52,668 WARN L191 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2019-11-20 01:46:53,366 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-11-20 01:46:54,059 WARN L191 SmtUtils]: Spent 372.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-11-20 01:47:08,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:47:08,731 INFO L93 Difference]: Finished difference Result 174 states and 238 transitions. [2019-11-20 01:47:08,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-20 01:47:08,736 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2019-11-20 01:47:08,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:47:08,738 INFO L225 Difference]: With dead ends: 174 [2019-11-20 01:47:08,739 INFO L226 Difference]: Without dead ends: 146 [2019-11-20 01:47:08,739 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2019-11-20 01:47:08,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-11-20 01:47:08,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 82. [2019-11-20 01:47:08,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-11-20 01:47:08,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 105 transitions. [2019-11-20 01:47:08,755 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 105 transitions. Word has length 23 [2019-11-20 01:47:08,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:47:08,755 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 105 transitions. [2019-11-20 01:47:08,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 01:47:08,756 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 105 transitions. [2019-11-20 01:47:08,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-20 01:47:08,757 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:47:08,757 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:47:08,959 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:47:08,960 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:47:08,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:47:08,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1666752049, now seen corresponding path program 1 times [2019-11-20 01:47:08,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:47:08,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1746847284] [2019-11-20 01:47:08,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4c104b2-4803-4ad2-b378-2048ef074a0f/bin/uautomizer/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:47:09,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:47:09,180 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 01:47:09,182 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:47:09,200 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-20 01:47:09,201 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:47:09,218 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-20 01:47:09,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1746847284] [2019-11-20 01:47:09,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:47:09,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 01:47:09,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322562385] [2019-11-20 01:47:09,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:47:09,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:47:09,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:47:09,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:47:09,221 INFO L87 Difference]: Start difference. First operand 82 states and 105 transitions. Second operand 4 states. [2019-11-20 01:47:09,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:47:09,287 INFO L93 Difference]: Finished difference Result 129 states and 164 transitions. [2019-11-20 01:47:09,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:47:09,288 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-11-20 01:47:09,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:47:09,290 INFO L225 Difference]: With dead ends: 129 [2019-11-20 01:47:09,290 INFO L226 Difference]: Without dead ends: 82 [2019-11-20 01:47:09,291 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:47:09,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-11-20 01:47:09,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-11-20 01:47:09,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-11-20 01:47:09,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 102 transitions. [2019-11-20 01:47:09,306 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 102 transitions. Word has length 39 [2019-11-20 01:47:09,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:47:09,307 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 102 transitions. [2019-11-20 01:47:09,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:47:09,307 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 102 transitions. [2019-11-20 01:47:09,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-20 01:47:09,309 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:47:09,309 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:47:09,513 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:47:09,515 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:47:09,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:47:09,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1447897331, now seen corresponding path program 1 times [2019-11-20 01:47:09,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:47:09,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [445557080] [2019-11-20 01:47:09,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4c104b2-4803-4ad2-b378-2048ef074a0f/bin/uautomizer/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:47:09,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:47:09,742 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 01:47:09,745 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:47:09,762 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-20 01:47:09,762 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:47:09,775 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-20 01:47:09,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [445557080] [2019-11-20 01:47:09,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:47:09,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 01:47:09,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573555959] [2019-11-20 01:47:09,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:47:09,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:47:09,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:47:09,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:47:09,785 INFO L87 Difference]: Start difference. First operand 82 states and 102 transitions. Second operand 4 states. [2019-11-20 01:47:09,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:47:09,846 INFO L93 Difference]: Finished difference Result 98 states and 121 transitions. [2019-11-20 01:47:09,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:47:09,848 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-11-20 01:47:09,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:47:09,849 INFO L225 Difference]: With dead ends: 98 [2019-11-20 01:47:09,849 INFO L226 Difference]: Without dead ends: 82 [2019-11-20 01:47:09,850 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:47:09,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-11-20 01:47:09,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-11-20 01:47:09,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-11-20 01:47:09,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 100 transitions. [2019-11-20 01:47:09,861 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 100 transitions. Word has length 39 [2019-11-20 01:47:09,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:47:09,862 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 100 transitions. [2019-11-20 01:47:09,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:47:09,862 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 100 transitions. [2019-11-20 01:47:09,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-20 01:47:09,864 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:47:09,864 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:47:10,073 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:47:10,073 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:47:10,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:47:10,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1054870321, now seen corresponding path program 1 times [2019-11-20 01:47:10,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:47:10,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1078337080] [2019-11-20 01:47:10,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4c104b2-4803-4ad2-b378-2048ef074a0f/bin/uautomizer/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:47:10,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:47:10,438 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-20 01:47:10,442 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:47:10,493 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-11-20 01:47:10,494 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:47:10,509 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:47:10,509 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:47:10,509 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-20 01:47:10,550 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 181 treesize of output 146 [2019-11-20 01:47:10,553 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:10,554 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:10,554 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:10,555 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:10,556 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:10,557 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:10,558 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:10,559 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:10,560 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:10,560 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:10,565 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:10,566 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:10,567 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:10,569 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:10,570 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:10,571 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:10,586 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:10,587 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:10,587 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:10,588 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:10,589 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:10,590 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:10,591 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:10,592 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:10,597 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:10,601 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:10,605 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 47 treesize of output 47 [2019-11-20 01:47:10,606 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:47:10,614 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:47:10,614 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:47:10,623 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:47:10,624 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:47:10,624 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:187, output treesize:16 [2019-11-20 01:47:10,668 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:10,669 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2019-11-20 01:47:10,670 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:47:10,691 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:47:10,692 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:47:10,692 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2019-11-20 01:47:10,706 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 114 [2019-11-20 01:47:10,709 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:10,710 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:10,711 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:10,712 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:10,713 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:10,715 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:10,718 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:10,721 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:10,725 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:10,729 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:10,730 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:10,743 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:10,749 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:10,750 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:10,751 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:10,752 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:10,753 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:10,754 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:10,756 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 43 treesize of output 38 [2019-11-20 01:47:10,757 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:47:10,760 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:47:10,760 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:47:10,771 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:47:10,772 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:47:10,772 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:155, output treesize:16 [2019-11-20 01:47:10,790 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:10,791 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2019-11-20 01:47:10,792 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:47:10,809 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:47:10,810 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:47:10,810 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2019-11-20 01:47:10,822 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 114 [2019-11-20 01:47:10,826 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:10,827 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:10,828 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:10,829 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:10,830 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:10,832 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:10,834 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:10,835 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:10,836 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:10,839 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:10,840 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:10,841 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:10,844 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:10,849 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:10,853 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:10,854 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:10,855 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:10,856 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:10,858 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 43 treesize of output 38 [2019-11-20 01:47:10,859 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:47:10,862 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:47:10,862 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:47:10,870 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:47:10,871 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:47:10,871 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:155, output treesize:16 [2019-11-20 01:47:10,893 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:10,894 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2019-11-20 01:47:10,894 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:47:10,924 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:47:10,925 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:47:10,925 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2019-11-20 01:47:10,932 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 114 [2019-11-20 01:47:10,941 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:10,942 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:10,943 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:10,944 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:10,944 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:10,945 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:10,947 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:10,948 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:10,949 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:10,949 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:10,950 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:10,952 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:10,961 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:10,962 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:10,963 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:10,964 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:10,965 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:10,965 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:10,967 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 43 treesize of output 38 [2019-11-20 01:47:10,968 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:47:10,970 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:47:10,970 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:47:10,982 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:47:10,982 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:47:10,982 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:155, output treesize:16 [2019-11-20 01:47:10,997 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:10,998 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2019-11-20 01:47:10,998 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:47:11,012 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:47:11,012 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:47:11,012 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2019-11-20 01:47:11,052 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 121 [2019-11-20 01:47:11,056 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:11,057 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:11,059 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:11,060 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:11,061 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:11,062 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:11,063 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:11,064 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:11,065 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:11,066 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:11,069 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:11,070 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:11,071 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:11,072 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:11,073 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:11,074 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:11,077 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:11,078 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:11,079 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:11,080 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:11,081 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:11,083 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:11,084 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:11,085 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:11,086 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:11,087 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:11,091 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 50 treesize of output 50 [2019-11-20 01:47:11,092 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:47:11,101 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:47:11,102 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:47:11,114 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:47:11,114 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:47:11,114 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:164, output treesize:25 [2019-11-20 01:47:11,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:47:11,214 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:47:11,215 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:47:11,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:47:11,831 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2019-11-20 01:47:11,835 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2019-11-20 01:47:11,836 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-20 01:47:11,895 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:47:11,895 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:47:11,926 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:47:11,927 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:47:11,927 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:26 [2019-11-20 01:47:12,204 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:47:12,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1078337080] [2019-11-20 01:47:12,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:47:12,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 18 [2019-11-20 01:47:12,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86458448] [2019-11-20 01:47:12,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-20 01:47:12,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:47:12,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-20 01:47:12,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2019-11-20 01:47:12,206 INFO L87 Difference]: Start difference. First operand 82 states and 100 transitions. Second operand 18 states. [2019-11-20 01:47:15,283 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-11-20 01:47:16,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:47:16,068 INFO L93 Difference]: Finished difference Result 348 states and 415 transitions. [2019-11-20 01:47:16,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-20 01:47:16,068 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 39 [2019-11-20 01:47:16,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:47:16,071 INFO L225 Difference]: With dead ends: 348 [2019-11-20 01:47:16,072 INFO L226 Difference]: Without dead ends: 272 [2019-11-20 01:47:16,073 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 46 SyntacticMatches, 14 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=352, Invalid=980, Unknown=0, NotChecked=0, Total=1332 [2019-11-20 01:47:16,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-11-20 01:47:16,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 133. [2019-11-20 01:47:16,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-11-20 01:47:16,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 162 transitions. [2019-11-20 01:47:16,099 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 162 transitions. Word has length 39 [2019-11-20 01:47:16,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:47:16,099 INFO L462 AbstractCegarLoop]: Abstraction has 133 states and 162 transitions. [2019-11-20 01:47:16,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-20 01:47:16,099 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 162 transitions. [2019-11-20 01:47:16,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-20 01:47:16,101 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:47:16,101 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:47:16,305 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:47:16,305 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:47:16,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:47:16,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1054810739, now seen corresponding path program 1 times [2019-11-20 01:47:16,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:47:16,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1231092010] [2019-11-20 01:47:16,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4c104b2-4803-4ad2-b378-2048ef074a0f/bin/uautomizer/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:47:16,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:47:16,371 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 01:47:16,373 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:47:16,400 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 01:47:16,401 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:47:16,417 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 01:47:16,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1231092010] [2019-11-20 01:47:16,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:47:16,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 5 [2019-11-20 01:47:16,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364586241] [2019-11-20 01:47:16,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 01:47:16,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:47:16,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 01:47:16,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:47:16,420 INFO L87 Difference]: Start difference. First operand 133 states and 162 transitions. Second operand 5 states. [2019-11-20 01:47:16,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:47:16,483 INFO L93 Difference]: Finished difference Result 147 states and 178 transitions. [2019-11-20 01:47:16,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 01:47:16,483 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-11-20 01:47:16,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:47:16,484 INFO L225 Difference]: With dead ends: 147 [2019-11-20 01:47:16,484 INFO L226 Difference]: Without dead ends: 145 [2019-11-20 01:47:16,485 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-20 01:47:16,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-11-20 01:47:16,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 135. [2019-11-20 01:47:16,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-11-20 01:47:16,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 164 transitions. [2019-11-20 01:47:16,528 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 164 transitions. Word has length 39 [2019-11-20 01:47:16,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:47:16,530 INFO L462 AbstractCegarLoop]: Abstraction has 135 states and 164 transitions. [2019-11-20 01:47:16,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 01:47:16,531 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 164 transitions. [2019-11-20 01:47:16,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-20 01:47:16,538 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:47:16,538 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:47:16,748 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:47:16,748 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:47:16,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:47:16,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1138695132, now seen corresponding path program 1 times [2019-11-20 01:47:16,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:47:16,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1656734649] [2019-11-20 01:47:16,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4c104b2-4803-4ad2-b378-2048ef074a0f/bin/uautomizer/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:47:17,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:47:17,128 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-20 01:47:17,132 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:47:17,179 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-11-20 01:47:17,179 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:47:17,206 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:47:17,206 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:47:17,206 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-20 01:47:17,230 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 151 treesize of output 116 [2019-11-20 01:47:17,233 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,234 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,234 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,235 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,236 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,236 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,237 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,238 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,238 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,239 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,242 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,243 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,243 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,245 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,246 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,247 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,257 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,258 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,259 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,260 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,261 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,262 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,263 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,264 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,265 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,266 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,271 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 45 treesize of output 47 [2019-11-20 01:47:17,272 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:47:17,277 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:47:17,277 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:47:17,287 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:47:17,287 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:47:17,287 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:157, output treesize:18 [2019-11-20 01:47:17,332 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,333 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2019-11-20 01:47:17,333 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:47:17,368 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:47:17,368 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:47:17,369 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2019-11-20 01:47:17,375 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 151 treesize of output 116 [2019-11-20 01:47:17,381 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,382 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,383 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,384 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,385 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,386 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,389 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,390 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,391 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,392 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,393 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,395 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,397 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,398 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,398 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,400 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,400 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,401 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,402 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 45 treesize of output 38 [2019-11-20 01:47:17,403 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:47:17,405 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:47:17,406 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:47:17,412 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:47:17,412 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:47:17,413 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:157, output treesize:18 [2019-11-20 01:47:17,423 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,424 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2019-11-20 01:47:17,424 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:47:17,451 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:47:17,452 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:47:17,452 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2019-11-20 01:47:17,461 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 151 treesize of output 116 [2019-11-20 01:47:17,466 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,467 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,467 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,468 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,469 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,470 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,473 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,474 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,475 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,476 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,477 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,478 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,480 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,481 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,482 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,483 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,484 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,489 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,491 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 45 treesize of output 38 [2019-11-20 01:47:17,491 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:47:17,498 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:47:17,498 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:47:17,506 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:47:17,506 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:47:17,507 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:157, output treesize:18 [2019-11-20 01:47:17,520 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,521 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2019-11-20 01:47:17,521 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:47:17,537 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:47:17,537 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:47:17,537 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2019-11-20 01:47:17,573 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 123 [2019-11-20 01:47:17,575 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,576 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,576 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,577 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,578 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,579 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,579 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,580 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,581 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,582 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,589 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,593 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,594 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,595 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,596 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,598 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,605 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,606 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,607 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,608 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,609 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,611 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,612 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,613 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,614 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,615 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:17,618 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 52 treesize of output 50 [2019-11-20 01:47:17,618 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:47:17,635 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:47:17,635 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:47:17,649 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:47:17,649 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:47:17,649 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:166, output treesize:27 [2019-11-20 01:47:17,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:47:17,749 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 01:47:17,749 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:47:17,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:47:18,185 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2019-11-20 01:47:18,191 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2019-11-20 01:47:18,192 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-20 01:47:18,228 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:47:18,228 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:47:18,268 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:47:18,269 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:47:18,269 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:30 [2019-11-20 01:47:18,471 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 01:47:18,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1656734649] [2019-11-20 01:47:18,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:47:18,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 18 [2019-11-20 01:47:18,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478970272] [2019-11-20 01:47:18,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-20 01:47:18,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:47:18,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-20 01:47:18,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2019-11-20 01:47:18,473 INFO L87 Difference]: Start difference. First operand 135 states and 164 transitions. Second operand 18 states. [2019-11-20 01:47:21,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:47:21,830 INFO L93 Difference]: Finished difference Result 319 states and 379 transitions. [2019-11-20 01:47:21,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-20 01:47:21,831 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 45 [2019-11-20 01:47:21,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:47:21,832 INFO L225 Difference]: With dead ends: 319 [2019-11-20 01:47:21,832 INFO L226 Difference]: Without dead ends: 203 [2019-11-20 01:47:21,834 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 60 SyntacticMatches, 12 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=385, Invalid=1175, Unknown=0, NotChecked=0, Total=1560 [2019-11-20 01:47:21,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-11-20 01:47:21,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 108. [2019-11-20 01:47:21,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-20 01:47:21,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 126 transitions. [2019-11-20 01:47:21,846 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 126 transitions. Word has length 45 [2019-11-20 01:47:21,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:47:21,846 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 126 transitions. [2019-11-20 01:47:21,846 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-20 01:47:21,846 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 126 transitions. [2019-11-20 01:47:21,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-20 01:47:21,847 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:47:21,847 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:47:22,048 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:47:22,049 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:47:22,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:47:22,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1041630505, now seen corresponding path program 2 times [2019-11-20 01:47:22,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:47:22,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2078381455] [2019-11-20 01:47:22,050 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4c104b2-4803-4ad2-b378-2048ef074a0f/bin/uautomizer/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:47:22,382 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 01:47:22,382 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 01:47:22,384 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-20 01:47:22,387 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:47:22,430 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-11-20 01:47:22,431 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:47:22,442 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:47:22,442 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:47:22,442 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-20 01:47:22,468 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 118 [2019-11-20 01:47:22,470 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:22,471 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:22,472 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:22,473 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:22,474 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:22,474 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:22,475 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:22,476 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:22,477 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:22,478 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:22,480 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:22,480 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:22,482 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:22,483 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:22,484 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:22,487 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:22,489 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:22,490 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:22,491 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:22,492 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:22,493 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:22,494 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:22,495 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:22,496 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:22,496 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:22,497 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:22,499 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 47 treesize of output 49 [2019-11-20 01:47:22,499 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:47:22,502 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:47:22,503 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:47:22,513 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:47:22,513 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:47:22,513 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:159, output treesize:18 [2019-11-20 01:47:22,545 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:22,546 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2019-11-20 01:47:22,546 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:47:22,565 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:47:22,566 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:47:22,566 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:22 [2019-11-20 01:47:22,584 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 118 [2019-11-20 01:47:22,586 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:22,587 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:22,588 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:22,589 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:22,589 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:22,590 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:22,592 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:22,593 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:22,594 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:22,594 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:22,595 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:22,597 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:22,599 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:22,600 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:22,601 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:22,602 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:22,603 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:22,604 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:22,605 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 47 treesize of output 40 [2019-11-20 01:47:22,606 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:47:22,610 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:47:22,611 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:47:22,618 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:47:22,618 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:47:22,618 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:159, output treesize:18 [2019-11-20 01:47:22,631 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:22,632 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2019-11-20 01:47:22,632 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:47:22,647 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:47:22,648 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:47:22,648 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:36 [2019-11-20 01:47:22,679 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 125 [2019-11-20 01:47:22,681 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:22,682 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:22,683 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:22,684 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:22,684 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:22,685 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:22,686 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:22,687 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:22,688 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:22,689 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:22,691 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:22,691 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:22,692 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:22,693 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:22,694 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:22,695 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:22,701 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:22,705 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:22,706 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:22,707 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:22,708 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:22,710 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:22,711 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:22,712 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:22,712 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:22,713 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:22,715 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 54 treesize of output 52 [2019-11-20 01:47:22,715 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:47:22,736 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:47:22,736 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:47:22,748 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:47:22,748 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:47:22,748 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:168, output treesize:27 [2019-11-20 01:47:22,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:47:22,895 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 01:47:22,895 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:47:22,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:47:23,323 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2019-11-20 01:47:23,326 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2019-11-20 01:47:23,326 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-20 01:47:23,344 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:47:23,344 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:47:23,378 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:47:23,379 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:47:23,379 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:30 [2019-11-20 01:47:23,633 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 01:47:23,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2078381455] [2019-11-20 01:47:23,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:47:23,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2019-11-20 01:47:23,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227617746] [2019-11-20 01:47:23,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-20 01:47:23,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:47:23,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-20 01:47:23,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2019-11-20 01:47:23,635 INFO L87 Difference]: Start difference. First operand 108 states and 126 transitions. Second operand 19 states. [2019-11-20 01:47:29,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:47:29,211 INFO L93 Difference]: Finished difference Result 238 states and 271 transitions. [2019-11-20 01:47:29,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-20 01:47:29,211 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 51 [2019-11-20 01:47:29,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:47:29,213 INFO L225 Difference]: With dead ends: 238 [2019-11-20 01:47:29,213 INFO L226 Difference]: Without dead ends: 228 [2019-11-20 01:47:29,214 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 73 SyntacticMatches, 10 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 589 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=426, Invalid=1644, Unknown=0, NotChecked=0, Total=2070 [2019-11-20 01:47:29,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2019-11-20 01:47:29,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 144. [2019-11-20 01:47:29,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-11-20 01:47:29,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 170 transitions. [2019-11-20 01:47:29,233 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 170 transitions. Word has length 51 [2019-11-20 01:47:29,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:47:29,234 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 170 transitions. [2019-11-20 01:47:29,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-20 01:47:29,234 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 170 transitions. [2019-11-20 01:47:29,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-20 01:47:29,235 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:47:29,235 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1] [2019-11-20 01:47:29,440 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:47:29,440 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:47:29,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:47:29,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1392901962, now seen corresponding path program 3 times [2019-11-20 01:47:29,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:47:29,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [356372686] [2019-11-20 01:47:29,441 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4c104b2-4803-4ad2-b378-2048ef074a0f/bin/uautomizer/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:47:29,880 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-20 01:47:29,880 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 01:47:29,883 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-20 01:47:29,886 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:47:29,923 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-11-20 01:47:29,924 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:47:29,940 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:47:29,940 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:47:29,940 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2019-11-20 01:47:29,973 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 181 treesize of output 146 [2019-11-20 01:47:29,975 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:29,976 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:29,976 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:29,977 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:29,978 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:29,979 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:29,979 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:29,980 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:29,981 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:29,981 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:29,983 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:29,984 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:29,985 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:29,986 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:29,986 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:29,987 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:29,997 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:29,998 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:29,999 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,000 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,005 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,006 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,007 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,008 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,009 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,010 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,012 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 47 treesize of output 47 [2019-11-20 01:47:30,012 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:47:30,015 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:47:30,015 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:47:30,035 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:47:30,035 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:47:30,036 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:202, output treesize:31 [2019-11-20 01:47:30,097 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,098 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2019-11-20 01:47:30,098 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:47:30,127 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:47:30,127 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:47:30,128 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:48, output treesize:44 [2019-11-20 01:47:30,192 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 121 [2019-11-20 01:47:30,196 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,197 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,198 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,199 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,200 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,209 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,210 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,211 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,212 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,213 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,215 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,216 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,217 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,218 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,219 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,220 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,223 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,224 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,225 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,226 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,227 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,228 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,229 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,230 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,231 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,232 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,233 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 50 treesize of output 50 [2019-11-20 01:47:30,234 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:47:30,250 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:47:30,250 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:47:30,280 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:47:30,280 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:47:30,280 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:174, output treesize:37 [2019-11-20 01:47:30,365 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,366 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,367 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,368 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:47:30,369 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 43 [2019-11-20 01:47:30,369 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:47:30,400 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:47:30,400 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:47:30,400 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:51 [2019-11-20 01:47:30,515 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 130 [2019-11-20 01:47:30,517 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,518 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,520 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,521 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,522 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,523 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,524 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,525 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,526 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,527 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,529 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,530 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,531 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,532 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,533 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,534 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,537 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,538 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,539 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,540 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,541 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,542 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,543 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,544 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,545 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,546 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,547 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 59 treesize of output 55 [2019-11-20 01:47:30,548 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:47:30,562 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:47:30,562 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:47:30,581 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:47:30,582 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:47:30,582 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:180, output treesize:43 [2019-11-20 01:47:30,697 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,699 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,700 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,701 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,703 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,704 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,705 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:47:30,706 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 60 [2019-11-20 01:47:30,706 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:47:30,752 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:47:30,752 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:47:30,752 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:64, output treesize:60 [2019-11-20 01:47:30,900 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 137 [2019-11-20 01:47:30,903 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,904 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,905 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,906 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,908 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,909 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,910 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,911 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,912 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,913 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,916 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,917 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,918 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,920 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,921 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,922 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,925 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,926 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,928 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,929 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,930 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,931 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,932 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,934 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,935 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,936 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:30,938 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 66 treesize of output 58 [2019-11-20 01:47:30,939 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:47:30,972 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:47:30,972 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:47:31,002 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:47:31,002 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:47:31,002 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:184, output treesize:47 [2019-11-20 01:47:31,149 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:31,151 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:31,152 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:31,153 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:31,154 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:31,155 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:31,156 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:31,157 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:31,158 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:31,159 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:31,160 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:47:31,160 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 67 treesize of output 75 [2019-11-20 01:47:31,161 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:47:31,203 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:47:31,204 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:47:31,204 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:76, output treesize:72 [2019-11-20 01:47:31,371 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 144 [2019-11-20 01:47:31,374 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:31,376 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:31,377 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:31,378 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:31,379 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:31,380 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:31,385 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:31,386 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:31,388 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:31,389 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:31,391 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:31,393 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:31,394 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:31,395 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:31,397 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:31,398 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:31,402 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:31,403 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:31,404 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:31,405 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:31,407 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:31,408 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:31,409 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:31,410 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:31,412 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:31,413 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:47:31,415 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 73 treesize of output 61 [2019-11-20 01:47:31,416 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:47:31,459 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:47:31,460 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:47:31,489 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:47:31,489 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:47:31,490 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:193, output treesize:56 [2019-11-20 01:47:31,945 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:47:31,945 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:47:32,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:47:32,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:47:33,106 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 1 proven. 31 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 01:47:33,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [356372686] [2019-11-20 01:47:33,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:47:33,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13] total 29 [2019-11-20 01:47:33,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363659108] [2019-11-20 01:47:33,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-20 01:47:33,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:47:33,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-20 01:47:33,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=689, Unknown=0, NotChecked=0, Total=812 [2019-11-20 01:47:33,108 INFO L87 Difference]: Start difference. First operand 144 states and 170 transitions. Second operand 29 states. [2019-11-20 01:47:34,662 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-11-20 01:47:36,656 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-11-20 01:47:39,679 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2019-11-20 01:47:40,173 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2019-11-20 01:47:45,352 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2019-11-20 01:47:45,587 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2019-11-20 01:47:45,802 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-11-20 01:47:50,589 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-11-20 01:47:52,990 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2019-11-20 01:47:53,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:47:53,779 INFO L93 Difference]: Finished difference Result 332 states and 384 transitions. [2019-11-20 01:47:53,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-11-20 01:47:53,779 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 57 [2019-11-20 01:47:53,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:47:53,781 INFO L225 Difference]: With dead ends: 332 [2019-11-20 01:47:53,781 INFO L226 Difference]: Without dead ends: 239 [2019-11-20 01:47:53,783 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 77 SyntacticMatches, 8 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1441 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=1054, Invalid=4496, Unknown=0, NotChecked=0, Total=5550 [2019-11-20 01:47:53,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2019-11-20 01:47:53,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 183. [2019-11-20 01:47:53,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-11-20 01:47:53,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 210 transitions. [2019-11-20 01:47:53,804 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 210 transitions. Word has length 57 [2019-11-20 01:47:53,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:47:53,804 INFO L462 AbstractCegarLoop]: Abstraction has 183 states and 210 transitions. [2019-11-20 01:47:53,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-20 01:47:53,805 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 210 transitions. [2019-11-20 01:47:53,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-20 01:47:53,805 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:47:53,806 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:47:54,010 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:47:54,010 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:47:54,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:47:54,011 INFO L82 PathProgramCache]: Analyzing trace with hash 65228175, now seen corresponding path program 2 times [2019-11-20 01:47:54,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:47:54,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1220796714] [2019-11-20 01:47:54,011 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4c104b2-4803-4ad2-b378-2048ef074a0f/bin/uautomizer/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:47:54,326 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 01:47:54,326 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 01:47:54,328 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-20 01:47:54,329 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:47:54,624 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2019-11-20 01:47:56,142 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-20 01:47:56,142 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:47:58,888 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-11-20 01:47:58,899 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-20 01:47:58,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1220796714] [2019-11-20 01:47:58,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:47:58,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2019-11-20 01:47:58,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814784670] [2019-11-20 01:47:58,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-20 01:47:58,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:47:58,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-20 01:47:58,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2019-11-20 01:47:58,901 INFO L87 Difference]: Start difference. First operand 183 states and 210 transitions. Second operand 19 states. [2019-11-20 01:48:00,000 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 13 [2019-11-20 01:48:00,350 WARN L191 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 11 [2019-11-20 01:48:01,710 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-11-20 01:48:05,727 WARN L191 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 16 [2019-11-20 01:48:08,051 WARN L191 SmtUtils]: Spent 545.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 16 [2019-11-20 01:48:08,744 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-11-20 01:48:09,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:48:09,054 INFO L93 Difference]: Finished difference Result 446 states and 502 transitions. [2019-11-20 01:48:09,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-20 01:48:09,060 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 63 [2019-11-20 01:48:09,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:48:09,062 INFO L225 Difference]: With dead ends: 446 [2019-11-20 01:48:09,062 INFO L226 Difference]: Without dead ends: 288 [2019-11-20 01:48:09,063 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 105 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=263, Invalid=607, Unknown=0, NotChecked=0, Total=870 [2019-11-20 01:48:09,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-11-20 01:48:09,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 203. [2019-11-20 01:48:09,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-11-20 01:48:09,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 226 transitions. [2019-11-20 01:48:09,086 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 226 transitions. Word has length 63 [2019-11-20 01:48:09,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:48:09,086 INFO L462 AbstractCegarLoop]: Abstraction has 203 states and 226 transitions. [2019-11-20 01:48:09,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-20 01:48:09,086 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 226 transitions. [2019-11-20 01:48:09,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-20 01:48:09,087 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:48:09,088 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:48:09,292 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:48:09,292 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:48:09,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:48:09,292 INFO L82 PathProgramCache]: Analyzing trace with hash -601853010, now seen corresponding path program 4 times [2019-11-20 01:48:09,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:48:09,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1754589139] [2019-11-20 01:48:09,293 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4c104b2-4803-4ad2-b378-2048ef074a0f/bin/uautomizer/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:48:09,677 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-20 01:48:09,677 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 01:48:09,679 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-20 01:48:09,681 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:48:10,141 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-11-20 01:48:10,479 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-11-20 01:48:11,356 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-11-20 01:48:11,881 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-11-20 01:48:12,286 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-11-20 01:48:12,694 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-11-20 01:48:13,126 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-11-20 01:48:13,163 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 15 proven. 66 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-20 01:48:13,164 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:48:16,346 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-11-20 01:48:16,949 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2019-11-20 01:48:17,463 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 22 proven. 59 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-20 01:48:17,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1754589139] [2019-11-20 01:48:17,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:48:17,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2019-11-20 01:48:17,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328631968] [2019-11-20 01:48:17,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-20 01:48:17,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:48:17,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-20 01:48:17,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=444, Unknown=0, NotChecked=0, Total=600 [2019-11-20 01:48:17,465 INFO L87 Difference]: Start difference. First operand 203 states and 226 transitions. Second operand 25 states. [2019-11-20 01:48:18,650 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-11-20 01:48:19,164 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-11-20 01:48:22,055 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-11-20 01:48:22,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:48:22,689 INFO L93 Difference]: Finished difference Result 278 states and 303 transitions. [2019-11-20 01:48:22,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-20 01:48:22,699 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 69 [2019-11-20 01:48:22,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:48:22,700 INFO L225 Difference]: With dead ends: 278 [2019-11-20 01:48:22,700 INFO L226 Difference]: Without dead ends: 212 [2019-11-20 01:48:22,701 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 108 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=203, Invalid=553, Unknown=0, NotChecked=0, Total=756 [2019-11-20 01:48:22,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-11-20 01:48:22,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 206. [2019-11-20 01:48:22,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-11-20 01:48:22,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 228 transitions. [2019-11-20 01:48:22,725 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 228 transitions. Word has length 69 [2019-11-20 01:48:22,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:48:22,725 INFO L462 AbstractCegarLoop]: Abstraction has 206 states and 228 transitions. [2019-11-20 01:48:22,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-20 01:48:22,725 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 228 transitions. [2019-11-20 01:48:22,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-20 01:48:22,726 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:48:22,727 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:48:22,931 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:48:22,931 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:48:22,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:48:22,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1063240281, now seen corresponding path program 5 times [2019-11-20 01:48:22,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:48:22,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1503371700] [2019-11-20 01:48:22,932 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4c104b2-4803-4ad2-b378-2048ef074a0f/bin/uautomizer/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:48:26,178 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-11-20 01:48:26,178 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 01:48:26,187 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 01:48:26,188 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:48:26,680 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 5 [2019-11-20 01:48:27,109 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-11-20 01:48:27,109 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:48:28,436 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-11-20 01:48:28,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1503371700] [2019-11-20 01:48:28,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:48:28,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2019-11-20 01:48:28,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073957413] [2019-11-20 01:48:28,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-20 01:48:28,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:48:28,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-20 01:48:28,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-11-20 01:48:28,438 INFO L87 Difference]: Start difference. First operand 206 states and 228 transitions. Second operand 13 states. [2019-11-20 01:48:29,303 WARN L191 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-11-20 01:48:29,862 WARN L191 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-11-20 01:48:32,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:48:32,508 INFO L93 Difference]: Finished difference Result 212 states and 231 transitions. [2019-11-20 01:48:32,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-20 01:48:32,515 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 79 [2019-11-20 01:48:32,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:48:32,516 INFO L225 Difference]: With dead ends: 212 [2019-11-20 01:48:32,517 INFO L226 Difference]: Without dead ends: 169 [2019-11-20 01:48:32,517 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2019-11-20 01:48:32,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-11-20 01:48:32,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 165. [2019-11-20 01:48:32,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-11-20 01:48:32,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 183 transitions. [2019-11-20 01:48:32,540 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 183 transitions. Word has length 79 [2019-11-20 01:48:32,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:48:32,540 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 183 transitions. [2019-11-20 01:48:32,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-20 01:48:32,540 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 183 transitions. [2019-11-20 01:48:32,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-20 01:48:32,541 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:48:32,542 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:48:32,749 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:48:32,749 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:48:32,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:48:32,749 INFO L82 PathProgramCache]: Analyzing trace with hash 630307707, now seen corresponding path program 3 times [2019-11-20 01:48:32,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:48:32,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1661498160] [2019-11-20 01:48:32,750 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4c104b2-4803-4ad2-b378-2048ef074a0f/bin/uautomizer/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:48:33,178 ERROR L271 FreeRefinementEngine]: Caught known exception: Array theory solver does not yet support write-chains connecting two different constant arrays [2019-11-20 01:48:33,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [164580290] [2019-11-20 01:48:33,179 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4c104b2-4803-4ad2-b378-2048ef074a0f/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:48:34,140 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-20 01:48:34,140 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 01:48:34,153 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 55 conjunts are in the unsatisfiable core [2019-11-20 01:48:34,156 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:48:34,227 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-11-20 01:48:34,227 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:48:34,242 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:48:34,242 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:48:34,242 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2019-11-20 01:48:34,273 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 276 treesize of output 241 [2019-11-20 01:48:34,276 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:48:34,277 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:48:34,278 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:48:34,279 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:48:34,280 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:48:34,281 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:48:34,282 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:48:34,283 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:48:34,284 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:48:34,284 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:48:34,287 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:48:34,288 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:48:34,289 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:48:34,290 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:48:34,290 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:48:34,291 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:48:34,294 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:48:34,295 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:48:34,296 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:48:34,297 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:48:34,298 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:48:34,299 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:48:34,300 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:48:34,301 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:48:34,302 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:48:34,302 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:48:34,304 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 76 treesize of output 64 [2019-11-20 01:48:34,304 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:48:34,318 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:48:34,318 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:48:34,333 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:48:34,334 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:48:34,334 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:290, output treesize:27 [2019-11-20 01:48:34,361 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:48:34,361 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2019-11-20 01:48:34,361 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:48:34,378 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:48:34,378 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:48:34,378 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:41 [2019-11-20 01:48:34,421 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 190 treesize of output 153 [2019-11-20 01:48:34,425 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:48:34,426 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:48:34,427 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:48:34,428 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:48:34,429 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:48:34,430 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:48:34,431 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:48:34,431 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:48:34,432 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:48:34,433 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:48:34,434 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:48:34,435 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:48:34,436 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:48:34,436 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:48:34,437 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:48:34,439 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:48:34,440 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:48:34,441 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:48:34,442 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:48:34,443 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:48:34,444 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:48:34,446 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:48:34,447 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:48:34,448 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:48:34,449 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:48:34,449 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:48:34,450 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:48:34,451 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:48:34,452 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:48:34,453 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:48:34,453 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:48:34,454 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:48:34,455 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:48:34,456 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:48:34,457 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:48:34,458 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:48:34,459 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 59 [2019-11-20 01:48:34,460 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:48:34,474 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:48:34,474 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:48:34,486 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:48:34,487 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:48:34,487 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:201, output treesize:28 [2019-11-20 01:48:34,521 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:48:34,587 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:48:34,588 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 93 [2019-11-20 01:48:34,588 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:48:34,643 INFO L567 ElimStorePlain]: treesize reduction 58, result has 37.6 percent of original size [2019-11-20 01:48:34,644 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:48:34,644 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:35 [2019-11-20 01:48:34,728 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 296 treesize of output 257 [2019-11-20 01:48:34,731 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:48:34,744 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:55:51,305 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-11-20 01:55:51,506 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:55:51,507 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.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:621) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:118) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:371) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:650) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:178) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SmtUtils.simplify(SmtUtils.java:162) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SmtUtils.simplify(SmtUtils.java:132) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SmtUtils.simplifyWithStatistics(SmtUtils.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:338) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:361) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:201) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.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.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) 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) ... 58 more [2019-11-20 01:55:51,512 INFO L168 Benchmark]: Toolchain (without parser) took 546446.07 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 307.8 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -160.5 MB). Peak memory consumption was 478.7 MB. Max. memory is 11.5 GB. [2019-11-20 01:55:51,512 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 987.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 01:55:51,515 INFO L168 Benchmark]: CACSL2BoogieTranslator took 485.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -172.7 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. [2019-11-20 01:55:51,515 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.09 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 01:55:51,515 INFO L168 Benchmark]: Boogie Preprocessor took 38.35 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 01:55:51,516 INFO L168 Benchmark]: RCFGBuilder took 803.14 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: 32.7 MB). Peak memory consumption was 32.7 MB. Max. memory is 11.5 GB. [2019-11-20 01:55:51,516 INFO L168 Benchmark]: TraceAbstraction took 545062.65 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 164.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -20.6 MB). Peak memory consumption was 475.5 MB. Max. memory is 11.5 GB. [2019-11-20 01:55:51,518 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 987.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 485.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -172.7 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 52.09 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.35 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 803.14 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: 32.7 MB). Peak memory consumption was 32.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 545062.65 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 164.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -20.6 MB). Peak memory consumption was 475.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...