./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/verifythis/duplets.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_323965c8-e395-462f-be55-39f2a7c2e6cf/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_323965c8-e395-462f-be55-39f2a7c2e6cf/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_323965c8-e395-462f-be55-39f2a7c2e6cf/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_323965c8-e395-462f-be55-39f2a7c2e6cf/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/verifythis/duplets.c -s /tmp/vcloud-vcloud-master/worker/run_dir_323965c8-e395-462f-be55-39f2a7c2e6cf/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_323965c8-e395-462f-be55-39f2a7c2e6cf/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 c261d11d6e37ef6eda45455c8074b5a0eac3352b ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_323965c8-e395-462f-be55-39f2a7c2e6cf/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_323965c8-e395-462f-be55-39f2a7c2e6cf/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_323965c8-e395-462f-be55-39f2a7c2e6cf/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_323965c8-e395-462f-be55-39f2a7c2e6cf/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/verifythis/duplets.c -s /tmp/vcloud-vcloud-master/worker/run_dir_323965c8-e395-462f-be55-39f2a7c2e6cf/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_323965c8-e395-462f-be55-39f2a7c2e6cf/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 c261d11d6e37ef6eda45455c8074b5a0eac3352b ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: incompatible size --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 09:42:52,704 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 09:42:52,705 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 09:42:52,719 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 09:42:52,720 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 09:42:52,721 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 09:42:52,723 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 09:42:52,731 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 09:42:52,736 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 09:42:52,739 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 09:42:52,741 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 09:42:52,742 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 09:42:52,742 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 09:42:52,744 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 09:42:52,745 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 09:42:52,746 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 09:42:52,748 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 09:42:52,748 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 09:42:52,751 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 09:42:52,754 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 09:42:52,758 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 09:42:52,760 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 09:42:52,762 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 09:42:52,763 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 09:42:52,766 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 09:42:52,766 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 09:42:52,767 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 09:42:52,768 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 09:42:52,768 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 09:42:52,769 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 09:42:52,770 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 09:42:52,770 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 09:42:52,771 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 09:42:52,772 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 09:42:52,773 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 09:42:52,773 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 09:42:52,773 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 09:42:52,774 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 09:42:52,774 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 09:42:52,774 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 09:42:52,775 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 09:42:52,776 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_323965c8-e395-462f-be55-39f2a7c2e6cf/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 09:42:52,799 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 09:42:52,800 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 09:42:52,800 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 09:42:52,801 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 09:42:52,801 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 09:42:52,801 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 09:42:52,801 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 09:42:52,801 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 09:42:52,802 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 09:42:52,802 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 09:42:52,802 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 09:42:52,802 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 09:42:52,802 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 09:42:52,802 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 09:42:52,803 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 09:42:52,803 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 09:42:52,803 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 09:42:52,803 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 09:42:52,803 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 09:42:52,804 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 09:42:52,804 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 09:42:52,804 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 09:42:52,804 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 09:42:52,804 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 09:42:52,804 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 09:42:52,805 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 09:42:52,805 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 09:42:52,805 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 09:42:52,805 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_323965c8-e395-462f-be55-39f2a7c2e6cf/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 -> c261d11d6e37ef6eda45455c8074b5a0eac3352b [2019-11-20 09:42:52,991 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 09:42:53,008 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 09:42:53,011 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 09:42:53,013 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 09:42:53,013 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 09:42:53,015 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_323965c8-e395-462f-be55-39f2a7c2e6cf/bin/uautomizer/../../sv-benchmarks/c/verifythis/duplets.c [2019-11-20 09:42:53,068 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_323965c8-e395-462f-be55-39f2a7c2e6cf/bin/uautomizer/data/7719151fe/0c052538f87647e6b6b31accfe4a1523/FLAG7fe8c0a20 [2019-11-20 09:42:53,510 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 09:42:53,510 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_323965c8-e395-462f-be55-39f2a7c2e6cf/sv-benchmarks/c/verifythis/duplets.c [2019-11-20 09:42:53,517 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_323965c8-e395-462f-be55-39f2a7c2e6cf/bin/uautomizer/data/7719151fe/0c052538f87647e6b6b31accfe4a1523/FLAG7fe8c0a20 [2019-11-20 09:42:53,531 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_323965c8-e395-462f-be55-39f2a7c2e6cf/bin/uautomizer/data/7719151fe/0c052538f87647e6b6b31accfe4a1523 [2019-11-20 09:42:53,534 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 09:42:53,535 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 09:42:53,536 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 09:42:53,537 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 09:42:53,540 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 09:42:53,542 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:42:53" (1/1) ... [2019-11-20 09:42:53,545 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@396f560 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:42:53, skipping insertion in model container [2019-11-20 09:42:53,545 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:42:53" (1/1) ... [2019-11-20 09:42:53,553 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 09:42:53,574 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 09:42:53,851 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 09:42:53,862 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 09:42:53,882 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 09:42:53,896 INFO L192 MainTranslator]: Completed translation [2019-11-20 09:42:53,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:42:53 WrapperNode [2019-11-20 09:42:53,897 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 09:42:53,898 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 09:42:53,898 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 09:42:53,898 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 09:42:53,905 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:42:53" (1/1) ... [2019-11-20 09:42:53,913 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:42:53" (1/1) ... [2019-11-20 09:42:53,939 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 09:42:53,939 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 09:42:53,939 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 09:42:53,939 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 09:42:53,948 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:42:53" (1/1) ... [2019-11-20 09:42:53,948 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:42:53" (1/1) ... [2019-11-20 09:42:53,952 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:42:53" (1/1) ... [2019-11-20 09:42:53,953 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:42:53" (1/1) ... [2019-11-20 09:42:53,966 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:42:53" (1/1) ... [2019-11-20 09:42:53,972 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:42:53" (1/1) ... [2019-11-20 09:42:53,973 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:42:53" (1/1) ... [2019-11-20 09:42:53,976 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 09:42:53,976 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 09:42:53,976 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 09:42:53,977 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 09:42:53,989 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:42:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_323965c8-e395-462f-be55-39f2a7c2e6cf/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 09:42:54,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 09:42:54,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-20 09:42:54,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-20 09:42:54,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 09:42:54,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 09:42:54,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-20 09:42:54,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 09:42:54,460 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 09:42:54,460 INFO L285 CfgBuilder]: Removed 22 assume(true) statements. [2019-11-20 09:42:54,461 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:42:54 BoogieIcfgContainer [2019-11-20 09:42:54,461 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 09:42:54,462 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 09:42:54,462 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 09:42:54,465 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 09:42:54,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 09:42:53" (1/3) ... [2019-11-20 09:42:54,466 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d29c9c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:42:54, skipping insertion in model container [2019-11-20 09:42:54,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:42:53" (2/3) ... [2019-11-20 09:42:54,467 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d29c9c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:42:54, skipping insertion in model container [2019-11-20 09:42:54,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:42:54" (3/3) ... [2019-11-20 09:42:54,468 INFO L109 eAbstractionObserver]: Analyzing ICFG duplets.c [2019-11-20 09:42:54,476 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 09:42:54,481 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-20 09:42:54,491 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-20 09:42:54,512 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 09:42:54,512 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 09:42:54,512 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 09:42:54,512 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 09:42:54,517 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 09:42:54,517 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 09:42:54,517 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 09:42:54,517 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 09:42:54,535 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2019-11-20 09:42:54,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-20 09:42:54,539 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:42:54,539 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:42:54,539 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:42:54,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:42:54,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1545573471, now seen corresponding path program 1 times [2019-11-20 09:42:54,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:42:54,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923410367] [2019-11-20 09:42:54,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:42:54,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:42:54,695 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 09:42:54,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923410367] [2019-11-20 09:42:54,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:42:54,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 09:42:54,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179142065] [2019-11-20 09:42:54,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-20 09:42:54,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:42:54,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-20 09:42:54,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 09:42:54,716 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 2 states. [2019-11-20 09:42:54,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:42:54,735 INFO L93 Difference]: Finished difference Result 72 states and 94 transitions. [2019-11-20 09:42:54,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-20 09:42:54,737 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2019-11-20 09:42:54,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:42:54,745 INFO L225 Difference]: With dead ends: 72 [2019-11-20 09:42:54,745 INFO L226 Difference]: Without dead ends: 34 [2019-11-20 09:42:54,748 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 09:42:54,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-11-20 09:42:54,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-11-20 09:42:54,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-20 09:42:54,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2019-11-20 09:42:54,777 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 9 [2019-11-20 09:42:54,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:42:54,777 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2019-11-20 09:42:54,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-20 09:42:54,777 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2019-11-20 09:42:54,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-20 09:42:54,778 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:42:54,778 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:42:54,778 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:42:54,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:42:54,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1566814454, now seen corresponding path program 1 times [2019-11-20 09:42:54,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:42:54,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179151224] [2019-11-20 09:42:54,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:42:54,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:42:54,884 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 09:42:54,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179151224] [2019-11-20 09:42:54,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:42:54,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 09:42:54,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20758935] [2019-11-20 09:42:54,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 09:42:54,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:42:54,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 09:42:54,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 09:42:54,887 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 4 states. [2019-11-20 09:42:54,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:42:54,970 INFO L93 Difference]: Finished difference Result 88 states and 97 transitions. [2019-11-20 09:42:54,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 09:42:54,972 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-11-20 09:42:54,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:42:54,975 INFO L225 Difference]: With dead ends: 88 [2019-11-20 09:42:54,975 INFO L226 Difference]: Without dead ends: 63 [2019-11-20 09:42:54,976 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 09:42:54,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-20 09:42:54,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 35. [2019-11-20 09:42:54,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-20 09:42:54,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2019-11-20 09:42:54,983 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 9 [2019-11-20 09:42:54,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:42:54,983 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2019-11-20 09:42:54,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 09:42:54,983 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2019-11-20 09:42:54,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-20 09:42:54,983 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:42:54,984 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:42:54,984 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:42:54,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:42:54,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1283622276, now seen corresponding path program 1 times [2019-11-20 09:42:54,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:42:54,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577252799] [2019-11-20 09:42:54,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:42:55,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:42:55,050 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 09:42:55,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577252799] [2019-11-20 09:42:55,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:42:55,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 09:42:55,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722285357] [2019-11-20 09:42:55,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 09:42:55,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:42:55,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 09:42:55,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 09:42:55,052 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 4 states. [2019-11-20 09:42:55,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:42:55,117 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2019-11-20 09:42:55,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 09:42:55,118 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-20 09:42:55,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:42:55,119 INFO L225 Difference]: With dead ends: 59 [2019-11-20 09:42:55,119 INFO L226 Difference]: Without dead ends: 57 [2019-11-20 09:42:55,120 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 09:42:55,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-20 09:42:55,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 37. [2019-11-20 09:42:55,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-20 09:42:55,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-11-20 09:42:55,128 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 10 [2019-11-20 09:42:55,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:42:55,128 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-11-20 09:42:55,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 09:42:55,129 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-11-20 09:42:55,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-20 09:42:55,129 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:42:55,130 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:42:55,130 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:42:55,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:42:55,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1818513337, now seen corresponding path program 1 times [2019-11-20 09:42:55,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:42:55,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219291999] [2019-11-20 09:42:55,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:42:55,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:42:55,243 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 09:42:55,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219291999] [2019-11-20 09:42:55,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:42:55,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 09:42:55,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994526254] [2019-11-20 09:42:55,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 09:42:55,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:42:55,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 09:42:55,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 09:42:55,245 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 5 states. [2019-11-20 09:42:55,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:42:55,325 INFO L93 Difference]: Finished difference Result 96 states and 108 transitions. [2019-11-20 09:42:55,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 09:42:55,326 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-20 09:42:55,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:42:55,327 INFO L225 Difference]: With dead ends: 96 [2019-11-20 09:42:55,327 INFO L226 Difference]: Without dead ends: 64 [2019-11-20 09:42:55,328 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-20 09:42:55,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-20 09:42:55,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 38. [2019-11-20 09:42:55,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-20 09:42:55,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2019-11-20 09:42:55,336 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 12 [2019-11-20 09:42:55,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:42:55,336 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2019-11-20 09:42:55,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 09:42:55,336 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2019-11-20 09:42:55,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-20 09:42:55,337 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:42:55,337 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:42:55,337 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:42:55,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:42:55,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1916123426, now seen corresponding path program 1 times [2019-11-20 09:42:55,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:42:55,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637779337] [2019-11-20 09:42:55,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:42:55,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:42:55,658 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 09:42:55,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637779337] [2019-11-20 09:42:55,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:42:55,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-20 09:42:55,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48241873] [2019-11-20 09:42:55,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-20 09:42:55,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:42:55,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-20 09:42:55,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-11-20 09:42:55,660 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 11 states. [2019-11-20 09:42:55,886 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-11-20 09:42:56,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:42:56,265 INFO L93 Difference]: Finished difference Result 80 states and 88 transitions. [2019-11-20 09:42:56,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 09:42:56,266 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 14 [2019-11-20 09:42:56,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:42:56,267 INFO L225 Difference]: With dead ends: 80 [2019-11-20 09:42:56,267 INFO L226 Difference]: Without dead ends: 62 [2019-11-20 09:42:56,268 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-11-20 09:42:56,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-20 09:42:56,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 47. [2019-11-20 09:42:56,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-20 09:42:56,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2019-11-20 09:42:56,277 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 14 [2019-11-20 09:42:56,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:42:56,278 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2019-11-20 09:42:56,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-20 09:42:56,278 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2019-11-20 09:42:56,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-20 09:42:56,279 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:42:56,279 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:42:56,280 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:42:56,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:42:56,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1930806771, now seen corresponding path program 1 times [2019-11-20 09:42:56,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:42:56,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921267917] [2019-11-20 09:42:56,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:42:56,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:42:56,330 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 09:42:56,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921267917] [2019-11-20 09:42:56,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059870469] [2019-11-20 09:42:56,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_323965c8-e395-462f-be55-39f2a7c2e6cf/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 09:42:56,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:42:56,408 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 09:42:56,413 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:42:56,431 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 09:42:56,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 09:42:56,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-11-20 09:42:56,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904921815] [2019-11-20 09:42:56,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 09:42:56,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:42:56,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 09:42:56,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-20 09:42:56,434 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 5 states. [2019-11-20 09:42:56,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:42:56,482 INFO L93 Difference]: Finished difference Result 95 states and 105 transitions. [2019-11-20 09:42:56,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 09:42:56,483 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-11-20 09:42:56,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:42:56,484 INFO L225 Difference]: With dead ends: 95 [2019-11-20 09:42:56,484 INFO L226 Difference]: Without dead ends: 70 [2019-11-20 09:42:56,485 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-20 09:42:56,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-20 09:42:56,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 50. [2019-11-20 09:42:56,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-20 09:42:56,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2019-11-20 09:42:56,493 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 15 [2019-11-20 09:42:56,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:42:56,493 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2019-11-20 09:42:56,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 09:42:56,494 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2019-11-20 09:42:56,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 09:42:56,495 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:42:56,495 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:42:56,699 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 09:42:56,700 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:42:56,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:42:56,700 INFO L82 PathProgramCache]: Analyzing trace with hash -2016823096, now seen corresponding path program 1 times [2019-11-20 09:42:56,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:42:56,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919088295] [2019-11-20 09:42:56,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:42:56,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:42:56,795 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 09:42:56,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919088295] [2019-11-20 09:42:56,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:42:56,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-20 09:42:56,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427775408] [2019-11-20 09:42:56,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 09:42:56,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:42:56,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 09:42:56,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-20 09:42:56,797 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand 7 states. [2019-11-20 09:42:57,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:42:57,038 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2019-11-20 09:42:57,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 09:42:57,039 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-11-20 09:42:57,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:42:57,040 INFO L225 Difference]: With dead ends: 75 [2019-11-20 09:42:57,040 INFO L226 Difference]: Without dead ends: 73 [2019-11-20 09:42:57,041 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-11-20 09:42:57,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-11-20 09:42:57,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 58. [2019-11-20 09:42:57,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-20 09:42:57,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 68 transitions. [2019-11-20 09:42:57,060 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 68 transitions. Word has length 18 [2019-11-20 09:42:57,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:42:57,061 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 68 transitions. [2019-11-20 09:42:57,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 09:42:57,061 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 68 transitions. [2019-11-20 09:42:57,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 09:42:57,062 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:42:57,062 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:42:57,063 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:42:57,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:42:57,065 INFO L82 PathProgramCache]: Analyzing trace with hash -2016763514, now seen corresponding path program 1 times [2019-11-20 09:42:57,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:42:57,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699077523] [2019-11-20 09:42:57,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:42:57,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:42:57,149 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 09:42:57,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699077523] [2019-11-20 09:42:57,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:42:57,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-20 09:42:57,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509285212] [2019-11-20 09:42:57,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 09:42:57,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:42:57,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 09:42:57,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-20 09:42:57,151 INFO L87 Difference]: Start difference. First operand 58 states and 68 transitions. Second operand 6 states. [2019-11-20 09:42:57,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:42:57,270 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2019-11-20 09:42:57,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 09:42:57,270 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-11-20 09:42:57,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:42:57,271 INFO L225 Difference]: With dead ends: 83 [2019-11-20 09:42:57,271 INFO L226 Difference]: Without dead ends: 71 [2019-11-20 09:42:57,272 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 09:42:57,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-20 09:42:57,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 60. [2019-11-20 09:42:57,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-20 09:42:57,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 70 transitions. [2019-11-20 09:42:57,278 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 70 transitions. Word has length 18 [2019-11-20 09:42:57,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:42:57,278 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 70 transitions. [2019-11-20 09:42:57,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 09:42:57,279 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2019-11-20 09:42:57,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 09:42:57,279 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:42:57,279 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:42:57,280 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:42:57,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:42:57,280 INFO L82 PathProgramCache]: Analyzing trace with hash -749140944, now seen corresponding path program 2 times [2019-11-20 09:42:57,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:42:57,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783361487] [2019-11-20 09:42:57,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:42:57,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:42:57,631 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 09:42:57,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783361487] [2019-11-20 09:42:57,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941334005] [2019-11-20 09:42:57,632 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_323965c8-e395-462f-be55-39f2a7c2e6cf/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 09:42:57,700 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 09:42:57,701 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 09:42:57,702 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 36 conjunts are in the unsatisfiable core [2019-11-20 09:42:57,704 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:42:57,764 INFO L343 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2019-11-20 09:42:57,764 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 1 case distinctions, treesize of input 22 treesize of output 23 [2019-11-20 09:42:57,765 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:42:57,785 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:42:57,786 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 09:42:57,786 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:40 [2019-11-20 09:42:59,160 INFO L343 Elim1Store]: treesize reduction 17, result has 83.0 percent of original size [2019-11-20 09:42:59,160 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 92 [2019-11-20 09:42:59,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:42:59,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:42:59,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:42:59,166 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-20 09:42:59,254 INFO L567 ElimStorePlain]: treesize reduction 46, result has 64.9 percent of original size [2019-11-20 09:42:59,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:42:59,264 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 09:42:59,265 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:66, output treesize:238 [2019-11-20 09:42:59,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:42:59,400 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 09:42:59,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 09:42:59,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2019-11-20 09:42:59,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217521804] [2019-11-20 09:42:59,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-20 09:42:59,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:42:59,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-20 09:42:59,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=175, Unknown=1, NotChecked=0, Total=210 [2019-11-20 09:42:59,402 INFO L87 Difference]: Start difference. First operand 60 states and 70 transitions. Second operand 15 states. [2019-11-20 09:42:59,665 WARN L191 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 31 [2019-11-20 09:43:00,620 WARN L191 SmtUtils]: Spent 842.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 50 [2019-11-20 09:43:03,892 WARN L191 SmtUtils]: Spent 3.24 s on a formula simplification. DAG size of input: 95 DAG size of output: 57 [2019-11-20 09:43:06,226 WARN L191 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 53 [2019-11-20 09:43:07,306 WARN L191 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 77 DAG size of output: 52 [2019-11-20 09:43:09,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:43:09,642 INFO L93 Difference]: Finished difference Result 151 states and 168 transitions. [2019-11-20 09:43:09,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-20 09:43:09,642 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2019-11-20 09:43:09,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:43:09,643 INFO L225 Difference]: With dead ends: 151 [2019-11-20 09:43:09,643 INFO L226 Difference]: Without dead ends: 108 [2019-11-20 09:43:09,644 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=142, Invalid=409, Unknown=1, NotChecked=0, Total=552 [2019-11-20 09:43:09,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-11-20 09:43:09,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 63. [2019-11-20 09:43:09,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-20 09:43:09,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions. [2019-11-20 09:43:09,653 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 74 transitions. Word has length 18 [2019-11-20 09:43:09,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:43:09,653 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 74 transitions. [2019-11-20 09:43:09,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-20 09:43:09,653 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 74 transitions. [2019-11-20 09:43:09,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-20 09:43:09,654 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:43:09,654 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] [2019-11-20 09:43:09,857 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 09:43:09,857 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:43:09,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:43:09,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1136618134, now seen corresponding path program 1 times [2019-11-20 09:43:09,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:43:09,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286103436] [2019-11-20 09:43:09,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:43:09,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:43:10,032 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 09:43:10,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286103436] [2019-11-20 09:43:10,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:43:10,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-20 09:43:10,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236982567] [2019-11-20 09:43:10,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 09:43:10,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:43:10,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 09:43:10,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-20 09:43:10,034 INFO L87 Difference]: Start difference. First operand 63 states and 74 transitions. Second operand 8 states. [2019-11-20 09:43:10,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:43:10,269 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2019-11-20 09:43:10,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 09:43:10,269 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2019-11-20 09:43:10,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:43:10,270 INFO L225 Difference]: With dead ends: 92 [2019-11-20 09:43:10,270 INFO L226 Difference]: Without dead ends: 90 [2019-11-20 09:43:10,271 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-11-20 09:43:10,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-11-20 09:43:10,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 75. [2019-11-20 09:43:10,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-20 09:43:10,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 86 transitions. [2019-11-20 09:43:10,280 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 86 transitions. Word has length 20 [2019-11-20 09:43:10,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:43:10,280 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 86 transitions. [2019-11-20 09:43:10,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 09:43:10,281 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 86 transitions. [2019-11-20 09:43:10,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 09:43:10,282 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:43:10,282 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:43:10,282 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:43:10,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:43:10,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1824745194, now seen corresponding path program 3 times [2019-11-20 09:43:10,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:43:10,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320570250] [2019-11-20 09:43:10,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:43:10,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:43:10,334 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 09:43:10,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320570250] [2019-11-20 09:43:10,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [659912356] [2019-11-20 09:43:10,335 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_323965c8-e395-462f-be55-39f2a7c2e6cf/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 09:43:10,399 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-20 09:43:10,400 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 09:43:10,401 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 09:43:10,402 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:43:10,416 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 09:43:10,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 09:43:10,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-11-20 09:43:10,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426960779] [2019-11-20 09:43:10,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 09:43:10,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:43:10,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 09:43:10,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-20 09:43:10,417 INFO L87 Difference]: Start difference. First operand 75 states and 86 transitions. Second operand 8 states. [2019-11-20 09:43:10,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:43:10,538 INFO L93 Difference]: Finished difference Result 162 states and 183 transitions. [2019-11-20 09:43:10,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 09:43:10,538 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-11-20 09:43:10,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:43:10,539 INFO L225 Difference]: With dead ends: 162 [2019-11-20 09:43:10,539 INFO L226 Difference]: Without dead ends: 119 [2019-11-20 09:43:10,540 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-11-20 09:43:10,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-11-20 09:43:10,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 81. [2019-11-20 09:43:10,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-11-20 09:43:10,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 94 transitions. [2019-11-20 09:43:10,550 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 94 transitions. Word has length 21 [2019-11-20 09:43:10,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:43:10,550 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 94 transitions. [2019-11-20 09:43:10,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 09:43:10,550 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 94 transitions. [2019-11-20 09:43:10,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 09:43:10,551 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:43:10,551 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] [2019-11-20 09:43:10,757 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 09:43:10,757 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:43:10,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:43:10,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1368206676, now seen corresponding path program 1 times [2019-11-20 09:43:10,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:43:10,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203829936] [2019-11-20 09:43:10,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:43:10,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:43:11,152 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 09:43:11,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203829936] [2019-11-20 09:43:11,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:43:11,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-20 09:43:11,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299356566] [2019-11-20 09:43:11,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 09:43:11,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:43:11,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 09:43:11,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-20 09:43:11,160 INFO L87 Difference]: Start difference. First operand 81 states and 94 transitions. Second operand 12 states. [2019-11-20 09:43:12,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:43:12,047 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2019-11-20 09:43:12,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-20 09:43:12,047 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2019-11-20 09:43:12,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:43:12,048 INFO L225 Difference]: With dead ends: 109 [2019-11-20 09:43:12,048 INFO L226 Difference]: Without dead ends: 91 [2019-11-20 09:43:12,049 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=170, Invalid=480, Unknown=0, NotChecked=0, Total=650 [2019-11-20 09:43:12,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-20 09:43:12,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 75. [2019-11-20 09:43:12,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-20 09:43:12,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 88 transitions. [2019-11-20 09:43:12,060 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 88 transitions. Word has length 22 [2019-11-20 09:43:12,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:43:12,060 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 88 transitions. [2019-11-20 09:43:12,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 09:43:12,061 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 88 transitions. [2019-11-20 09:43:12,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-20 09:43:12,064 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:43:12,064 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:43:12,065 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:43:12,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:43:12,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1533202012, now seen corresponding path program 1 times [2019-11-20 09:43:12,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:43:12,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736649490] [2019-11-20 09:43:12,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:43:12,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:43:12,305 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 09:43:12,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736649490] [2019-11-20 09:43:12,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:43:12,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-20 09:43:12,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195969338] [2019-11-20 09:43:12,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 09:43:12,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:43:12,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 09:43:12,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-20 09:43:12,307 INFO L87 Difference]: Start difference. First operand 75 states and 88 transitions. Second operand 10 states. [2019-11-20 09:43:12,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:43:12,537 INFO L93 Difference]: Finished difference Result 80 states and 92 transitions. [2019-11-20 09:43:12,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 09:43:12,537 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2019-11-20 09:43:12,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:43:12,538 INFO L225 Difference]: With dead ends: 80 [2019-11-20 09:43:12,538 INFO L226 Difference]: Without dead ends: 66 [2019-11-20 09:43:12,538 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-11-20 09:43:12,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-20 09:43:12,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2019-11-20 09:43:12,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-20 09:43:12,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 77 transitions. [2019-11-20 09:43:12,551 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 77 transitions. Word has length 23 [2019-11-20 09:43:12,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:43:12,552 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 77 transitions. [2019-11-20 09:43:12,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 09:43:12,552 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 77 transitions. [2019-11-20 09:43:12,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-20 09:43:12,553 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:43:12,554 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:43:12,554 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:43:12,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:43:12,554 INFO L82 PathProgramCache]: Analyzing trace with hash -684996589, now seen corresponding path program 1 times [2019-11-20 09:43:12,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:43:12,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313637185] [2019-11-20 09:43:12,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:43:12,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:43:12,734 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 09:43:12,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313637185] [2019-11-20 09:43:12,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273055238] [2019-11-20 09:43:12,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_323965c8-e395-462f-be55-39f2a7c2e6cf/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 09:43:12,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:43:12,803 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-20 09:43:12,808 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:43:12,843 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 10 treesize of output 8 [2019-11-20 09:43:12,844 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:43:12,857 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:43:12,858 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 09:43:12,858 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2019-11-20 09:43:13,108 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-20 09:43:13,108 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:43:13,123 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:43:13,124 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 09:43:13,124 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:19 [2019-11-20 09:43:13,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:13,200 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 09:43:13,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 09:43:13,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2019-11-20 09:43:13,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914255055] [2019-11-20 09:43:13,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-20 09:43:13,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:43:13,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-20 09:43:13,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2019-11-20 09:43:13,202 INFO L87 Difference]: Start difference. First operand 65 states and 77 transitions. Second operand 20 states. [2019-11-20 09:43:13,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:43:13,980 INFO L93 Difference]: Finished difference Result 114 states and 129 transitions. [2019-11-20 09:43:13,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-20 09:43:13,980 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 23 [2019-11-20 09:43:13,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:43:13,981 INFO L225 Difference]: With dead ends: 114 [2019-11-20 09:43:13,981 INFO L226 Difference]: Without dead ends: 112 [2019-11-20 09:43:13,982 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=452, Invalid=1108, Unknown=0, NotChecked=0, Total=1560 [2019-11-20 09:43:13,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-20 09:43:13,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 69. [2019-11-20 09:43:13,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-11-20 09:43:13,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 81 transitions. [2019-11-20 09:43:13,989 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 81 transitions. Word has length 23 [2019-11-20 09:43:13,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:43:13,989 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 81 transitions. [2019-11-20 09:43:13,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-20 09:43:13,989 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 81 transitions. [2019-11-20 09:43:13,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-20 09:43:13,990 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:43:13,990 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:43:14,193 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 09:43:14,200 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:43:14,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:43:14,200 INFO L82 PathProgramCache]: Analyzing trace with hash -684937007, now seen corresponding path program 1 times [2019-11-20 09:43:14,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:43:14,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790285523] [2019-11-20 09:43:14,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:43:14,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:43:14,302 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 09:43:14,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790285523] [2019-11-20 09:43:14,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673027647] [2019-11-20 09:43:14,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_323965c8-e395-462f-be55-39f2a7c2e6cf/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 09:43:14,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:43:14,367 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-20 09:43:14,369 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:43:14,381 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 10 treesize of output 8 [2019-11-20 09:43:14,381 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:43:14,390 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:43:14,391 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 09:43:14,391 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2019-11-20 09:43:14,436 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-20 09:43:14,436 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:43:14,443 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:43:14,444 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 09:43:14,444 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:38, output treesize:11 [2019-11-20 09:43:14,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:14,471 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 09:43:14,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 09:43:14,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 11 [2019-11-20 09:43:14,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211516575] [2019-11-20 09:43:14,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 09:43:14,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:43:14,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 09:43:14,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-11-20 09:43:14,472 INFO L87 Difference]: Start difference. First operand 69 states and 81 transitions. Second operand 6 states. [2019-11-20 09:43:14,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:43:14,545 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2019-11-20 09:43:14,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 09:43:14,546 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-11-20 09:43:14,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:43:14,547 INFO L225 Difference]: With dead ends: 92 [2019-11-20 09:43:14,547 INFO L226 Difference]: Without dead ends: 72 [2019-11-20 09:43:14,547 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2019-11-20 09:43:14,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-11-20 09:43:14,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 67. [2019-11-20 09:43:14,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-11-20 09:43:14,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 77 transitions. [2019-11-20 09:43:14,554 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 77 transitions. Word has length 23 [2019-11-20 09:43:14,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:43:14,554 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 77 transitions. [2019-11-20 09:43:14,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 09:43:14,554 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 77 transitions. [2019-11-20 09:43:14,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-20 09:43:14,555 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:43:14,555 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:43:14,758 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 09:43:14,758 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:43:14,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:43:14,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1414385655, now seen corresponding path program 1 times [2019-11-20 09:43:14,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:43:14,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30273966] [2019-11-20 09:43:14,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:43:14,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:43:14,887 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 09:43:14,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30273966] [2019-11-20 09:43:14,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703762310] [2019-11-20 09:43:14,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_323965c8-e395-462f-be55-39f2a7c2e6cf/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 09:43:14,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:43:14,949 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-20 09:43:14,950 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:43:15,015 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 09:43:15,028 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:43:15,028 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 39 [2019-11-20 09:43:15,029 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:43:15,054 INFO L567 ElimStorePlain]: treesize reduction 16, result has 68.0 percent of original size [2019-11-20 09:43:15,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:15,056 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 09:43:15,056 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:33 [2019-11-20 09:43:15,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:15,096 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 09:43:15,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 09:43:15,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [12] total 16 [2019-11-20 09:43:15,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059342039] [2019-11-20 09:43:15,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 09:43:15,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 09:43:15,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 09:43:15,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2019-11-20 09:43:15,098 INFO L87 Difference]: Start difference. First operand 67 states and 77 transitions. Second operand 7 states. [2019-11-20 09:43:15,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:43:15,225 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2019-11-20 09:43:15,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 09:43:15,225 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-11-20 09:43:15,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:43:15,226 INFO L225 Difference]: With dead ends: 80 [2019-11-20 09:43:15,226 INFO L226 Difference]: Without dead ends: 68 [2019-11-20 09:43:15,226 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2019-11-20 09:43:15,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-20 09:43:15,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 65. [2019-11-20 09:43:15,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-20 09:43:15,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2019-11-20 09:43:15,233 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 27 [2019-11-20 09:43:15,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:43:15,233 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2019-11-20 09:43:15,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 09:43:15,233 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2019-11-20 09:43:15,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-20 09:43:15,234 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:43:15,234 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:43:15,436 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 09:43:15,437 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:43:15,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:43:15,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1612959071, now seen corresponding path program 4 times [2019-11-20 09:43:15,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 09:43:15,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980943919] [2019-11-20 09:43:15,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 09:43:15,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:43:15,595 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Undeclared function symbol (const Int) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:478) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.term(WrapperScript.java:250) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.term(WrapperScript.java:250) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SmtUtils.termWithLocalSimplification(SmtUtils.java:1307) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SmtUtils.termWithLocalSimplification(SmtUtils.java:1188) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.TermTransferrer.convertApplicationTerm(TermTransferrer.java:182) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$BuildApplicationTerm.walk(TermTransformer.java:339) 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.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computePredicates(NestedInterpolantsBuilder.java:573) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:171) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:300) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:202) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:107) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.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) [2019-11-20 09:43:15,600 INFO L168 Benchmark]: Toolchain (without parser) took 22064.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 201.9 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -113.3 MB). Peak memory consumption was 88.6 MB. Max. memory is 11.5 GB. [2019-11-20 09:43:15,600 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 09:43:15,600 INFO L168 Benchmark]: CACSL2BoogieTranslator took 361.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -185.4 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2019-11-20 09:43:15,601 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.89 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 09:43:15,601 INFO L168 Benchmark]: Boogie Preprocessor took 36.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 09:43:15,602 INFO L168 Benchmark]: RCFGBuilder took 485.25 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 09:43:15,602 INFO L168 Benchmark]: TraceAbstraction took 21136.30 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 61.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 37.6 MB). Peak memory consumption was 98.9 MB. Max. memory is 11.5 GB. [2019-11-20 09:43:15,607 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.30 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 361.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -185.4 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 40.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.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 485.25 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 21136.30 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 61.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 37.6 MB). Peak memory consumption was 98.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Undeclared function symbol (const Int) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Undeclared function symbol (const Int): de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:478) 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 09:43:17,534 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 09:43:17,536 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 09:43:17,547 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 09:43:17,547 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 09:43:17,548 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 09:43:17,550 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 09:43:17,552 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 09:43:17,554 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 09:43:17,555 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 09:43:17,556 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 09:43:17,557 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 09:43:17,558 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 09:43:17,559 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 09:43:17,560 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 09:43:17,561 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 09:43:17,562 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 09:43:17,563 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 09:43:17,565 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 09:43:17,567 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 09:43:17,568 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 09:43:17,569 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 09:43:17,571 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 09:43:17,571 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 09:43:17,574 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 09:43:17,575 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 09:43:17,576 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 09:43:17,576 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 09:43:17,577 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 09:43:17,578 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 09:43:17,580 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 09:43:17,580 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 09:43:17,582 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 09:43:17,582 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 09:43:17,583 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 09:43:17,584 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 09:43:17,585 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 09:43:17,585 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 09:43:17,586 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 09:43:17,586 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 09:43:17,587 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 09:43:17,589 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_323965c8-e395-462f-be55-39f2a7c2e6cf/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-20 09:43:17,607 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 09:43:17,608 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 09:43:17,610 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 09:43:17,610 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 09:43:17,610 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 09:43:17,611 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 09:43:17,611 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 09:43:17,611 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 09:43:17,612 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 09:43:17,612 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 09:43:17,613 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 09:43:17,613 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 09:43:17,613 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-20 09:43:17,613 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-20 09:43:17,614 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 09:43:17,614 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 09:43:17,614 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 09:43:17,615 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 09:43:17,615 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 09:43:17,615 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 09:43:17,615 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 09:43:17,616 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 09:43:17,616 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 09:43:17,616 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 09:43:17,616 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 09:43:17,617 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 09:43:17,617 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-20 09:43:17,617 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-20 09:43:17,617 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 09:43:17,618 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 09:43:17,618 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_323965c8-e395-462f-be55-39f2a7c2e6cf/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 -> c261d11d6e37ef6eda45455c8074b5a0eac3352b [2019-11-20 09:43:17,904 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 09:43:17,913 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 09:43:17,916 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 09:43:17,918 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 09:43:17,918 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 09:43:17,918 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_323965c8-e395-462f-be55-39f2a7c2e6cf/bin/uautomizer/../../sv-benchmarks/c/verifythis/duplets.c [2019-11-20 09:43:17,966 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_323965c8-e395-462f-be55-39f2a7c2e6cf/bin/uautomizer/data/9995ee02d/5013569006854226aa2c66a732c7a214/FLAGb61c34788 [2019-11-20 09:43:18,415 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 09:43:18,416 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_323965c8-e395-462f-be55-39f2a7c2e6cf/sv-benchmarks/c/verifythis/duplets.c [2019-11-20 09:43:18,423 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_323965c8-e395-462f-be55-39f2a7c2e6cf/bin/uautomizer/data/9995ee02d/5013569006854226aa2c66a732c7a214/FLAGb61c34788 [2019-11-20 09:43:18,435 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_323965c8-e395-462f-be55-39f2a7c2e6cf/bin/uautomizer/data/9995ee02d/5013569006854226aa2c66a732c7a214 [2019-11-20 09:43:18,438 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 09:43:18,439 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 09:43:18,440 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 09:43:18,440 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 09:43:18,444 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 09:43:18,445 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:43:18" (1/1) ... [2019-11-20 09:43:18,447 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@297d489c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:43:18, skipping insertion in model container [2019-11-20 09:43:18,448 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:43:18" (1/1) ... [2019-11-20 09:43:18,454 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 09:43:18,472 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 09:43:18,688 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 09:43:18,699 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 09:43:18,742 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 09:43:18,837 INFO L192 MainTranslator]: Completed translation [2019-11-20 09:43:18,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:43:18 WrapperNode [2019-11-20 09:43:18,838 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 09:43:18,839 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 09:43:18,839 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 09:43:18,839 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 09:43:18,848 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:43:18" (1/1) ... [2019-11-20 09:43:18,867 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:43:18" (1/1) ... [2019-11-20 09:43:18,903 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 09:43:18,903 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 09:43:18,903 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 09:43:18,903 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 09:43:18,915 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:43:18" (1/1) ... [2019-11-20 09:43:18,915 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:43:18" (1/1) ... [2019-11-20 09:43:18,927 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:43:18" (1/1) ... [2019-11-20 09:43:18,927 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:43:18" (1/1) ... [2019-11-20 09:43:18,935 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:43:18" (1/1) ... [2019-11-20 09:43:18,940 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:43:18" (1/1) ... [2019-11-20 09:43:18,942 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:43:18" (1/1) ... [2019-11-20 09:43:18,945 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 09:43:18,945 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 09:43:18,945 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 09:43:18,945 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 09:43:18,946 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:43:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_323965c8-e395-462f-be55-39f2a7c2e6cf/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 09:43:19,019 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 09:43:19,020 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-20 09:43:19,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-20 09:43:19,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 09:43:19,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 09:43:19,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 09:43:19,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-20 09:43:19,454 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 09:43:19,454 INFO L285 CfgBuilder]: Removed 22 assume(true) statements. [2019-11-20 09:43:19,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:43:19 BoogieIcfgContainer [2019-11-20 09:43:19,455 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 09:43:19,456 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 09:43:19,456 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 09:43:19,459 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 09:43:19,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 09:43:18" (1/3) ... [2019-11-20 09:43:19,460 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@643394cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:43:19, skipping insertion in model container [2019-11-20 09:43:19,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:43:18" (2/3) ... [2019-11-20 09:43:19,460 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@643394cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:43:19, skipping insertion in model container [2019-11-20 09:43:19,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:43:19" (3/3) ... [2019-11-20 09:43:19,462 INFO L109 eAbstractionObserver]: Analyzing ICFG duplets.c [2019-11-20 09:43:19,469 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 09:43:19,474 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-20 09:43:19,483 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-20 09:43:19,503 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 09:43:19,503 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 09:43:19,503 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 09:43:19,503 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 09:43:19,503 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 09:43:19,504 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 09:43:19,504 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 09:43:19,504 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 09:43:19,518 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2019-11-20 09:43:19,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-20 09:43:19,523 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:43:19,524 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:43:19,524 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:43:19,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:43:19,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1545573471, now seen corresponding path program 1 times [2019-11-20 09:43:19,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 09:43:19,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [138136333] [2019-11-20 09:43:19,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_323965c8-e395-462f-be55-39f2a7c2e6cf/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 09:43:19,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:43:19,644 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-20 09:43:19,649 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:43:19,661 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 09:43:19,661 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 09:43:19,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 09:43:19,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [138136333] [2019-11-20 09:43:19,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:43:19,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-20 09:43:19,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503901401] [2019-11-20 09:43:19,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-20 09:43:19,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 09:43:19,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-20 09:43:19,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 09:43:19,686 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 2 states. [2019-11-20 09:43:19,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:43:19,702 INFO L93 Difference]: Finished difference Result 72 states and 94 transitions. [2019-11-20 09:43:19,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-20 09:43:19,703 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2019-11-20 09:43:19,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:43:19,712 INFO L225 Difference]: With dead ends: 72 [2019-11-20 09:43:19,713 INFO L226 Difference]: Without dead ends: 34 [2019-11-20 09:43:19,716 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 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 09:43:19,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-11-20 09:43:19,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-11-20 09:43:19,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-20 09:43:19,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2019-11-20 09:43:19,748 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 9 [2019-11-20 09:43:19,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:43:19,749 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2019-11-20 09:43:19,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-20 09:43:19,749 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2019-11-20 09:43:19,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-20 09:43:19,750 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:43:19,750 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:43:19,952 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 09:43:19,953 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:43:19,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:43:19,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1566814454, now seen corresponding path program 1 times [2019-11-20 09:43:19,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 09:43:19,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1069361821] [2019-11-20 09:43:19,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_323965c8-e395-462f-be55-39f2a7c2e6cf/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 09:43:20,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:43:20,099 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 09:43:20,100 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:43:20,209 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 09:43:20,209 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 09:43:20,252 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 09:43:20,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1069361821] [2019-11-20 09:43:20,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:43:20,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-11-20 09:43:20,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108894444] [2019-11-20 09:43:20,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 09:43:20,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 09:43:20,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 09:43:20,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-20 09:43:20,256 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 7 states. [2019-11-20 09:43:20,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:43:20,487 INFO L93 Difference]: Finished difference Result 112 states and 122 transitions. [2019-11-20 09:43:20,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 09:43:20,488 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-11-20 09:43:20,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:43:20,490 INFO L225 Difference]: With dead ends: 112 [2019-11-20 09:43:20,490 INFO L226 Difference]: Without dead ends: 87 [2019-11-20 09:43:20,491 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-11-20 09:43:20,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-11-20 09:43:20,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 35. [2019-11-20 09:43:20,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-20 09:43:20,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2019-11-20 09:43:20,500 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 9 [2019-11-20 09:43:20,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:43:20,501 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2019-11-20 09:43:20,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 09:43:20,501 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2019-11-20 09:43:20,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-20 09:43:20,502 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:43:20,502 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:43:20,704 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 09:43:20,704 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:43:20,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:43:20,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1283622276, now seen corresponding path program 1 times [2019-11-20 09:43:20,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 09:43:20,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1561259350] [2019-11-20 09:43:20,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_323965c8-e395-462f-be55-39f2a7c2e6cf/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 09:43:20,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:43:20,795 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 09:43:20,796 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:43:20,822 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 09:43:20,823 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 09:43:20,850 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 09:43:20,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1561259350] [2019-11-20 09:43:20,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:43:20,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 09:43:20,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255600054] [2019-11-20 09:43:20,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 09:43:20,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 09:43:20,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 09:43:20,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 09:43:20,852 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 6 states. [2019-11-20 09:43:20,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:43:20,961 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2019-11-20 09:43:20,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 09:43:20,963 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-11-20 09:43:20,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:43:20,964 INFO L225 Difference]: With dead ends: 59 [2019-11-20 09:43:20,965 INFO L226 Difference]: Without dead ends: 57 [2019-11-20 09:43:20,965 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-20 09:43:20,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-20 09:43:20,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 37. [2019-11-20 09:43:20,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-20 09:43:20,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-11-20 09:43:20,977 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 10 [2019-11-20 09:43:20,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:43:20,977 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-11-20 09:43:20,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 09:43:20,979 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-11-20 09:43:20,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-20 09:43:20,979 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:43:20,980 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:43:21,185 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 09:43:21,186 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:43:21,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:43:21,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1818513337, now seen corresponding path program 1 times [2019-11-20 09:43:21,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 09:43:21,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1291239510] [2019-11-20 09:43:21,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_323965c8-e395-462f-be55-39f2a7c2e6cf/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 09:43:21,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:43:21,296 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-20 09:43:21,298 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:43:21,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 09:43:21,388 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 09:43:21,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 09:43:21,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1291239510] [2019-11-20 09:43:21,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:43:21,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-11-20 09:43:21,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917168464] [2019-11-20 09:43:21,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 09:43:21,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 09:43:21,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 09:43:21,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-20 09:43:21,494 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 8 states. [2019-11-20 09:43:21,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:43:21,991 INFO L93 Difference]: Finished difference Result 140 states and 155 transitions. [2019-11-20 09:43:21,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 09:43:21,993 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-11-20 09:43:21,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:43:21,995 INFO L225 Difference]: With dead ends: 140 [2019-11-20 09:43:21,995 INFO L226 Difference]: Without dead ends: 108 [2019-11-20 09:43:21,996 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-11-20 09:43:22,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-11-20 09:43:22,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 38. [2019-11-20 09:43:22,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-20 09:43:22,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2019-11-20 09:43:22,017 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 12 [2019-11-20 09:43:22,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:43:22,018 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2019-11-20 09:43:22,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 09:43:22,018 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2019-11-20 09:43:22,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-20 09:43:22,019 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:43:22,019 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:43:22,221 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 09:43:22,221 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:43:22,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:43:22,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1916123426, now seen corresponding path program 1 times [2019-11-20 09:43:22,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 09:43:22,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1697041979] [2019-11-20 09:43:22,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_323965c8-e395-462f-be55-39f2a7c2e6cf/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 09:43:22,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:43:22,393 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-20 09:43:22,395 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:43:22,449 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 10 treesize of output 8 [2019-11-20 09:43:22,450 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:43:22,487 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:43:22,488 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 09:43:22,488 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2019-11-20 09:43:22,662 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-20 09:43:22,662 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:43:22,689 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:43:22,691 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 09:43:22,691 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:28 [2019-11-20 09:43:22,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:22,909 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 09:43:22,909 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 09:43:22,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:22,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:23,003 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 144 treesize of output 136 [2019-11-20 09:43:23,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:23,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:23,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:23,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:23,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:23,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:23,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:23,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:23,016 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 09:43:23,176 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-11-20 09:43:23,177 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:43:23,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:23,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:43:23,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:23,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:23,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:23,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:23,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:43:23,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:23,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:23,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:23,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:23,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:43:23,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:23,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:23,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:23,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:23,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:23,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:23,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:43:23,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:23,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:23,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:43:23,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:23,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:23,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:23,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:23,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:23,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:23,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:23,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:43:23,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:23,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:23,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:23,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:23,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:23,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:23,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:23,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:43:23,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:23,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:43:23,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:23,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:23,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:43:23,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:23,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:23,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:43:23,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:43:23,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:23,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:43:23,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:23,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:23,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:23,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:43:23,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:23,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:23,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:23,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:23,274 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 27 dim-0 vars, and 2 xjuncts. [2019-11-20 09:43:23,274 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:64, output treesize:809 [2019-11-20 09:43:23,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:23,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:23,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:23,698 WARN L191 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 24 [2019-11-20 09:43:23,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:23,898 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 09:43:23,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1697041979] [2019-11-20 09:43:23,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:43:23,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 9] imperfect sequences [] total 16 [2019-11-20 09:43:23,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367170441] [2019-11-20 09:43:23,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-20 09:43:23,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 09:43:23,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-20 09:43:23,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-11-20 09:43:23,900 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 16 states. [2019-11-20 09:43:24,196 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2019-11-20 09:43:24,578 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2019-11-20 09:43:24,823 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 28 [2019-11-20 09:43:25,147 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2019-11-20 09:43:25,449 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 28 [2019-11-20 09:43:25,809 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 32 [2019-11-20 09:43:26,080 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 31 [2019-11-20 09:43:26,590 WARN L191 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 35 [2019-11-20 09:43:26,871 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-11-20 09:43:27,128 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 35 [2019-11-20 09:43:27,468 WARN L191 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 36 [2019-11-20 09:43:27,908 WARN L191 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 37 [2019-11-20 09:43:28,312 WARN L191 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 36 [2019-11-20 09:43:28,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:43:28,469 INFO L93 Difference]: Finished difference Result 166 states and 187 transitions. [2019-11-20 09:43:28,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-20 09:43:28,470 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 14 [2019-11-20 09:43:28,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:43:28,471 INFO L225 Difference]: With dead ends: 166 [2019-11-20 09:43:28,471 INFO L226 Difference]: Without dead ends: 148 [2019-11-20 09:43:28,473 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=545, Invalid=1261, Unknown=0, NotChecked=0, Total=1806 [2019-11-20 09:43:28,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-11-20 09:43:28,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 56. [2019-11-20 09:43:28,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-20 09:43:28,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2019-11-20 09:43:28,486 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 14 [2019-11-20 09:43:28,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:43:28,487 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2019-11-20 09:43:28,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-20 09:43:28,487 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2019-11-20 09:43:28,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-20 09:43:28,488 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:43:28,488 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:43:28,702 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 09:43:28,702 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:43:28,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:43:28,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1930806771, now seen corresponding path program 1 times [2019-11-20 09:43:28,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 09:43:28,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [841263342] [2019-11-20 09:43:28,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_323965c8-e395-462f-be55-39f2a7c2e6cf/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 09:43:28,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:43:28,796 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 09:43:28,798 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:43:28,924 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 09:43:28,924 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 09:43:29,037 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 09:43:29,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [841263342] [2019-11-20 09:43:29,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 09:43:29,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2019-11-20 09:43:29,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644712979] [2019-11-20 09:43:29,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-20 09:43:29,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 09:43:29,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-20 09:43:29,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-11-20 09:43:29,039 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. Second operand 13 states. [2019-11-20 09:43:29,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:43:29,538 INFO L93 Difference]: Finished difference Result 286 states and 321 transitions. [2019-11-20 09:43:29,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-20 09:43:29,542 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 15 [2019-11-20 09:43:29,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:43:29,544 INFO L225 Difference]: With dead ends: 286 [2019-11-20 09:43:29,544 INFO L226 Difference]: Without dead ends: 254 [2019-11-20 09:43:29,545 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=143, Invalid=319, Unknown=0, NotChecked=0, Total=462 [2019-11-20 09:43:29,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-11-20 09:43:29,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 70. [2019-11-20 09:43:29,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-20 09:43:29,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 86 transitions. [2019-11-20 09:43:29,566 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 86 transitions. Word has length 15 [2019-11-20 09:43:29,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:43:29,567 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 86 transitions. [2019-11-20 09:43:29,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-20 09:43:29,567 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 86 transitions. [2019-11-20 09:43:29,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-20 09:43:29,568 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:43:29,568 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:43:29,768 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 09:43:29,769 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:43:29,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:43:29,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1838976614, now seen corresponding path program 1 times [2019-11-20 09:43:29,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 09:43:29,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1726584146] [2019-11-20 09:43:29,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_323965c8-e395-462f-be55-39f2a7c2e6cf/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 09:43:29,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:43:29,917 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-20 09:43:29,918 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:43:29,938 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 10 treesize of output 8 [2019-11-20 09:43:29,939 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:43:29,956 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:43:29,956 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 09:43:29,956 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2019-11-20 09:43:29,981 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-20 09:43:29,981 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:43:29,998 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:43:29,999 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 09:43:29,999 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:11 [2019-11-20 09:43:30,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:30,023 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 09:43:30,023 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 09:43:30,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:30,035 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 70 treesize of output 66 [2019-11-20 09:43:30,037 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:43:30,130 INFO L567 ElimStorePlain]: treesize reduction 20, result has 60.8 percent of original size [2019-11-20 09:43:30,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:43:30,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:30,133 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2019-11-20 09:43:30,133 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:14 [2019-11-20 09:43:30,151 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 09:43:30,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1726584146] [2019-11-20 09:43:30,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:43:30,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2019-11-20 09:43:30,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651033550] [2019-11-20 09:43:30,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 09:43:30,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 09:43:30,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 09:43:30,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-20 09:43:30,153 INFO L87 Difference]: Start difference. First operand 70 states and 86 transitions. Second operand 7 states. [2019-11-20 09:43:30,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:43:30,403 INFO L93 Difference]: Finished difference Result 137 states and 158 transitions. [2019-11-20 09:43:30,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 09:43:30,403 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-11-20 09:43:30,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:43:30,404 INFO L225 Difference]: With dead ends: 137 [2019-11-20 09:43:30,404 INFO L226 Difference]: Without dead ends: 119 [2019-11-20 09:43:30,405 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-11-20 09:43:30,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-11-20 09:43:30,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 75. [2019-11-20 09:43:30,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-20 09:43:30,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 93 transitions. [2019-11-20 09:43:30,415 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 93 transitions. Word has length 17 [2019-11-20 09:43:30,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:43:30,416 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 93 transitions. [2019-11-20 09:43:30,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 09:43:30,416 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 93 transitions. [2019-11-20 09:43:30,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 09:43:30,417 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:43:30,417 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:43:30,619 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 09:43:30,620 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:43:30,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:43:30,620 INFO L82 PathProgramCache]: Analyzing trace with hash -2016823096, now seen corresponding path program 1 times [2019-11-20 09:43:30,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 09:43:30,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [851637799] [2019-11-20 09:43:30,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_323965c8-e395-462f-be55-39f2a7c2e6cf/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 09:43:30,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:43:30,760 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-20 09:43:30,761 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:43:30,958 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:43:30,958 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 39 [2019-11-20 09:43:30,959 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:43:31,016 INFO L567 ElimStorePlain]: treesize reduction 16, result has 66.7 percent of original size [2019-11-20 09:43:31,017 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 09:43:31,017 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:17 [2019-11-20 09:43:31,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:31,140 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 09:43:31,140 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 09:43:31,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:31,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:31,246 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 144 treesize of output 136 [2019-11-20 09:43:31,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:31,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:31,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:31,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:31,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:31,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:31,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:31,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:31,256 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 09:43:31,375 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-11-20 09:43:31,375 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:43:31,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:43:31,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:31,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:31,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:31,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:31,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:31,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:31,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:31,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:31,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:31,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:31,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:31,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:31,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:31,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:31,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:31,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:31,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:31,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:31,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:31,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:31,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:31,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:31,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:31,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:31,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:31,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:31,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:31,405 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2019-11-20 09:43:31,405 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:64, output treesize:193 [2019-11-20 09:43:31,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:31,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:31,686 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 09:43:31,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [851637799] [2019-11-20 09:43:31,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:43:31,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 9] imperfect sequences [] total 16 [2019-11-20 09:43:31,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353518713] [2019-11-20 09:43:31,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-20 09:43:31,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 09:43:31,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-20 09:43:31,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-11-20 09:43:31,688 INFO L87 Difference]: Start difference. First operand 75 states and 93 transitions. Second operand 16 states. [2019-11-20 09:43:32,408 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 29 [2019-11-20 09:43:33,059 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 26 [2019-11-20 09:43:33,539 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 29 [2019-11-20 09:43:33,877 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 32 [2019-11-20 09:43:34,396 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 28 [2019-11-20 09:43:34,673 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 30 [2019-11-20 09:43:34,891 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 31 [2019-11-20 09:43:35,110 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 39 [2019-11-20 09:43:35,347 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 36 [2019-11-20 09:43:35,542 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 33 [2019-11-20 09:43:35,750 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 30 [2019-11-20 09:43:35,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:43:35,810 INFO L93 Difference]: Finished difference Result 185 states and 206 transitions. [2019-11-20 09:43:35,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-20 09:43:35,811 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2019-11-20 09:43:35,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:43:35,812 INFO L225 Difference]: With dead ends: 185 [2019-11-20 09:43:35,812 INFO L226 Difference]: Without dead ends: 173 [2019-11-20 09:43:35,813 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 482 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=526, Invalid=1280, Unknown=0, NotChecked=0, Total=1806 [2019-11-20 09:43:35,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-11-20 09:43:35,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 87. [2019-11-20 09:43:35,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-11-20 09:43:35,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 106 transitions. [2019-11-20 09:43:35,823 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 106 transitions. Word has length 18 [2019-11-20 09:43:35,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:43:35,824 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 106 transitions. [2019-11-20 09:43:35,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-20 09:43:35,824 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 106 transitions. [2019-11-20 09:43:35,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 09:43:35,825 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:43:35,825 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:43:36,040 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 09:43:36,040 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:43:36,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:43:36,041 INFO L82 PathProgramCache]: Analyzing trace with hash -749140944, now seen corresponding path program 2 times [2019-11-20 09:43:36,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 09:43:36,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [28120170] [2019-11-20 09:43:36,041 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_323965c8-e395-462f-be55-39f2a7c2e6cf/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 09:43:36,188 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 09:43:36,189 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 09:43:36,191 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-20 09:43:36,193 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:43:36,233 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 09:43:36,233 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 23 [2019-11-20 09:43:36,234 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:43:36,293 INFO L567 ElimStorePlain]: treesize reduction 3, result has 93.8 percent of original size [2019-11-20 09:43:36,294 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 09:43:36,294 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:42 [2019-11-20 09:43:36,433 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 09:43:36,442 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 09:43:36,505 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:43:36,505 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 62 [2019-11-20 09:43:36,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:36,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:36,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:36,507 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-20 09:43:36,661 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2019-11-20 09:43:36,664 INFO L567 ElimStorePlain]: treesize reduction 33, result has 68.0 percent of original size [2019-11-20 09:43:36,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:36,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:36,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:36,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:36,667 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 09:43:36,667 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:61, output treesize:70 [2019-11-20 09:43:36,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:36,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:36,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:36,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:36,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:36,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:36,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:36,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:36,994 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 09:43:36,994 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 09:43:37,291 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 41 treesize of output 37 [2019-11-20 09:43:37,302 INFO L343 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-11-20 09:43:37,303 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 267 treesize of output 243 [2019-11-20 09:43:37,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:43:37,629 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-20 09:43:37,872 WARN L191 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 17 [2019-11-20 09:43:37,875 INFO L567 ElimStorePlain]: treesize reduction 8419, result has 0.6 percent of original size [2019-11-20 09:43:37,875 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-11-20 09:43:37,889 INFO L567 ElimStorePlain]: treesize reduction 79, result has 1.3 percent of original size [2019-11-20 09:43:37,890 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 09:43:37,890 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:68, output treesize:1 [2019-11-20 09:43:37,891 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 09:43:37,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [28120170] [2019-11-20 09:43:37,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 09:43:37,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2019-11-20 09:43:37,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149916961] [2019-11-20 09:43:37,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-20 09:43:37,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 09:43:37,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-20 09:43:37,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2019-11-20 09:43:37,893 INFO L87 Difference]: Start difference. First operand 87 states and 106 transitions. Second operand 15 states. [2019-11-20 09:43:42,565 WARN L191 SmtUtils]: Spent 2.15 s on a formula simplification. DAG size of input: 74 DAG size of output: 71 [2019-11-20 09:43:48,863 WARN L191 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-11-20 09:43:50,990 WARN L191 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-11-20 09:43:57,443 WARN L191 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-11-20 09:44:01,700 WARN L191 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 34 DAG size of output: 33 [2019-11-20 09:44:02,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:44:02,359 INFO L93 Difference]: Finished difference Result 186 states and 217 transitions. [2019-11-20 09:44:02,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-20 09:44:02,362 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2019-11-20 09:44:02,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:44:02,364 INFO L225 Difference]: With dead ends: 186 [2019-11-20 09:44:02,364 INFO L226 Difference]: Without dead ends: 125 [2019-11-20 09:44:02,365 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 20.0s TimeCoverageRelationStatistics Valid=136, Invalid=460, Unknown=4, NotChecked=0, Total=600 [2019-11-20 09:44:02,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-11-20 09:44:02,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 81. [2019-11-20 09:44:02,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-11-20 09:44:02,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 97 transitions. [2019-11-20 09:44:02,388 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 97 transitions. Word has length 18 [2019-11-20 09:44:02,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:44:02,388 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 97 transitions. [2019-11-20 09:44:02,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-20 09:44:02,388 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 97 transitions. [2019-11-20 09:44:02,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-20 09:44:02,390 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:44:02,391 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] [2019-11-20 09:44:02,593 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 09:44:02,593 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:44:02,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:44:02,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1136618134, now seen corresponding path program 1 times [2019-11-20 09:44:02,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 09:44:02,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1570595106] [2019-11-20 09:44:02,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_323965c8-e395-462f-be55-39f2a7c2e6cf/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 09:44:02,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:44:02,734 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-20 09:44:02,736 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:44:02,757 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 10 treesize of output 8 [2019-11-20 09:44:02,757 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:44:02,782 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:44:02,783 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 09:44:02,783 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2019-11-20 09:44:02,860 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-20 09:44:02,861 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:44:02,890 INFO L567 ElimStorePlain]: treesize reduction 4, result has 84.0 percent of original size [2019-11-20 09:44:02,890 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 09:44:02,890 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:21 [2019-11-20 09:44:02,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:44:02,934 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 09:44:02,935 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 09:44:02,971 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:44:02,971 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 344 treesize of output 324 [2019-11-20 09:44:02,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 09:44:02,973 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2019-11-20 09:44:03,266 WARN L191 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 39 [2019-11-20 09:44:03,266 INFO L567 ElimStorePlain]: treesize reduction 730, result has 12.0 percent of original size [2019-11-20 09:44:03,267 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-20 09:44:03,267 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:60, output treesize:94 [2019-11-20 09:44:03,411 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-11-20 09:44:03,487 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 09:44:03,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1570595106] [2019-11-20 09:44:03,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 09:44:03,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2019-11-20 09:44:03,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832743517] [2019-11-20 09:44:03,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 09:44:03,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 09:44:03,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 09:44:03,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-20 09:44:03,488 INFO L87 Difference]: Start difference. First operand 81 states and 97 transitions. Second operand 10 states. [2019-11-20 09:44:03,849 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 25 [2019-11-20 09:44:04,151 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 30 [2019-11-20 09:44:04,313 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 33 [2019-11-20 09:44:04,686 WARN L191 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 36 [2019-11-20 09:44:05,137 WARN L191 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2019-11-20 09:44:05,299 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-11-20 09:44:05,455 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 34 [2019-11-20 09:44:05,741 WARN L191 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2019-11-20 09:44:05,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:44:05,756 INFO L93 Difference]: Finished difference Result 156 states and 175 transitions. [2019-11-20 09:44:05,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-20 09:44:05,757 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-20 09:44:05,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:44:05,758 INFO L225 Difference]: With dead ends: 156 [2019-11-20 09:44:05,758 INFO L226 Difference]: Without dead ends: 154 [2019-11-20 09:44:05,759 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=149, Invalid=313, Unknown=0, NotChecked=0, Total=462 [2019-11-20 09:44:05,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-20 09:44:05,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 104. [2019-11-20 09:44:05,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-20 09:44:05,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 126 transitions. [2019-11-20 09:44:05,771 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 126 transitions. Word has length 20 [2019-11-20 09:44:05,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:44:05,772 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 126 transitions. [2019-11-20 09:44:05,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 09:44:05,772 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 126 transitions. [2019-11-20 09:44:05,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 09:44:05,773 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:44:05,773 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:44:05,976 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 09:44:05,976 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:44:05,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:44:05,976 INFO L82 PathProgramCache]: Analyzing trace with hash 557122624, now seen corresponding path program 1 times [2019-11-20 09:44:05,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 09:44:05,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1513268483] [2019-11-20 09:44:05,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_323965c8-e395-462f-be55-39f2a7c2e6cf/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 09:44:06,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:44:06,094 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-20 09:44:06,096 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:44:06,156 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:44:06,157 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 39 [2019-11-20 09:44:06,157 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:44:06,184 INFO L567 ElimStorePlain]: treesize reduction 16, result has 61.9 percent of original size [2019-11-20 09:44:06,185 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 09:44:06,185 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:11 [2019-11-20 09:44:06,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:44:06,211 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 09:44:06,211 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 09:44:06,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:44:06,229 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 70 treesize of output 66 [2019-11-20 09:44:06,233 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:44:06,350 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 22 [2019-11-20 09:44:06,351 INFO L567 ElimStorePlain]: treesize reduction 20, result has 60.8 percent of original size [2019-11-20 09:44:06,351 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-11-20 09:44:06,351 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:10 [2019-11-20 09:44:06,426 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 09:44:06,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1513268483] [2019-11-20 09:44:06,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 09:44:06,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-11-20 09:44:06,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870826011] [2019-11-20 09:44:06,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-20 09:44:06,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 09:44:06,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-20 09:44:06,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-20 09:44:06,428 INFO L87 Difference]: Start difference. First operand 104 states and 126 transitions. Second operand 11 states. [2019-11-20 09:44:07,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:44:07,101 INFO L93 Difference]: Finished difference Result 240 states and 264 transitions. [2019-11-20 09:44:07,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-20 09:44:07,105 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2019-11-20 09:44:07,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:44:07,107 INFO L225 Difference]: With dead ends: 240 [2019-11-20 09:44:07,107 INFO L226 Difference]: Without dead ends: 224 [2019-11-20 09:44:07,108 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=189, Invalid=363, Unknown=0, NotChecked=0, Total=552 [2019-11-20 09:44:07,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-11-20 09:44:07,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 108. [2019-11-20 09:44:07,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-20 09:44:07,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 130 transitions. [2019-11-20 09:44:07,124 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 130 transitions. Word has length 21 [2019-11-20 09:44:07,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:44:07,125 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 130 transitions. [2019-11-20 09:44:07,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-20 09:44:07,125 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 130 transitions. [2019-11-20 09:44:07,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 09:44:07,125 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:44:07,126 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 09:44:07,326 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 09:44:07,326 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:44:07,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:44:07,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1824745194, now seen corresponding path program 3 times [2019-11-20 09:44:07,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 09:44:07,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1133774335] [2019-11-20 09:44:07,327 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_323965c8-e395-462f-be55-39f2a7c2e6cf/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 09:44:07,525 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-20 09:44:07,526 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 09:44:07,528 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-20 09:44:07,529 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:44:07,706 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 09:44:07,706 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 09:44:08,021 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 09:44:08,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1133774335] [2019-11-20 09:44:08,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 09:44:08,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2019-11-20 09:44:08,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360659514] [2019-11-20 09:44:08,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-20 09:44:08,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 09:44:08,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-20 09:44:08,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2019-11-20 09:44:08,023 INFO L87 Difference]: Start difference. First operand 108 states and 130 transitions. Second operand 16 states. [2019-11-20 09:44:10,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 09:44:10,390 INFO L93 Difference]: Finished difference Result 384 states and 423 transitions. [2019-11-20 09:44:10,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-11-20 09:44:10,392 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2019-11-20 09:44:10,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 09:44:10,394 INFO L225 Difference]: With dead ends: 384 [2019-11-20 09:44:10,394 INFO L226 Difference]: Without dead ends: 359 [2019-11-20 09:44:10,395 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 652 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=510, Invalid=1746, Unknown=0, NotChecked=0, Total=2256 [2019-11-20 09:44:10,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2019-11-20 09:44:10,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 122. [2019-11-20 09:44:10,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-11-20 09:44:10,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 151 transitions. [2019-11-20 09:44:10,412 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 151 transitions. Word has length 21 [2019-11-20 09:44:10,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 09:44:10,412 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 151 transitions. [2019-11-20 09:44:10,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-20 09:44:10,412 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 151 transitions. [2019-11-20 09:44:10,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 09:44:10,413 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 09:44:10,413 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] [2019-11-20 09:44:10,616 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 09:44:10,617 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 09:44:10,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 09:44:10,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1368206676, now seen corresponding path program 1 times [2019-11-20 09:44:10,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 09:44:10,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1494512941] [2019-11-20 09:44:10,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_323965c8-e395-462f-be55-39f2a7c2e6cf/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 09:44:10,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 09:44:10,791 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 39 conjunts are in the unsatisfiable core [2019-11-20 09:44:10,793 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 09:44:10,810 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-20 09:44:10,811 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:44:10,835 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:44:10,836 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 09:44:10,836 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-11-20 09:44:10,902 INFO L343 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2019-11-20 09:44:10,903 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 1 case distinctions, treesize of input 22 treesize of output 23 [2019-11-20 09:44:10,903 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:44:10,942 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:44:10,943 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-20 09:44:10,943 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:36 [2019-11-20 09:44:11,022 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 09:44:11,032 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:44:11,033 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 32 [2019-11-20 09:44:11,033 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:44:11,083 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 09:44:11,083 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 09:44:11,083 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:60, output treesize:48 [2019-11-20 09:44:11,302 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 09:44:11,307 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 09:44:11,308 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2019-11-20 09:44:11,309 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 09:44:11,385 INFO L567 ElimStorePlain]: treesize reduction 4, result has 92.6 percent of original size [2019-11-20 09:44:11,385 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 09:44:11,386 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:67, output treesize:50 [2019-11-20 09:44:11,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 09:44:11,485 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 09:44:11,486 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 09:44:12,440 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 09:44:12,440 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: incompatible size at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.analyzeCosts(ArrayIndexBasedCostEstimation.java:211) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.computeCostEstimation(ArrayIndexBasedCostEstimation.java:152) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.(ArrayIndexBasedCostEstimation.java:64) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.computeCostEstimation(ElimStorePlain.java:519) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:390) 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.computeBackwardSequence(IterativePredicateTransformer.java:419) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:334) 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) [2019-11-20 09:44:12,444 INFO L168 Benchmark]: Toolchain (without parser) took 54005.08 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 357.0 MB). Free memory was 961.8 MB in the beginning and 984.4 MB in the end (delta: -22.6 MB). Peak memory consumption was 334.4 MB. Max. memory is 11.5 GB. [2019-11-20 09:44:12,444 INFO L168 Benchmark]: CDTParser took 0.22 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 09:44:12,444 INFO L168 Benchmark]: CACSL2BoogieTranslator took 398.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 186.1 MB). Free memory was 961.8 MB in the beginning and 1.2 GB in the end (delta: -214.2 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2019-11-20 09:44:12,445 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.81 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 09:44:12,445 INFO L168 Benchmark]: Boogie Preprocessor took 41.78 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 09:44:12,445 INFO L168 Benchmark]: RCFGBuilder took 510.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 31.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. [2019-11-20 09:44:12,445 INFO L168 Benchmark]: TraceAbstraction took 52986.58 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 170.9 MB). Free memory was 1.1 GB in the beginning and 984.4 MB in the end (delta: 160.1 MB). Peak memory consumption was 331.0 MB. Max. memory is 11.5 GB. [2019-11-20 09:44:12,447 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.22 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 398.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 186.1 MB). Free memory was 961.8 MB in the beginning and 1.2 GB in the end (delta: -214.2 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 63.81 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.78 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 510.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 31.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 52986.58 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 170.9 MB). Free memory was 1.1 GB in the beginning and 984.4 MB in the end (delta: 160.1 MB). Peak memory consumption was 331.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: incompatible size de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: incompatible size: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.analyzeCosts(ArrayIndexBasedCostEstimation.java:211) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...