./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/reducercommutativity/sep.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_fec8267c-a702-4f5a-8056-d3c4c3ce3269/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_fec8267c-a702-4f5a-8056-d3c4c3ce3269/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_fec8267c-a702-4f5a-8056-d3c4c3ce3269/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_fec8267c-a702-4f5a-8056-d3c4c3ce3269/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/reducercommutativity/sep.i -s /tmp/vcloud-vcloud-master/worker/run_dir_fec8267c-a702-4f5a-8056-d3c4c3ce3269/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_fec8267c-a702-4f5a-8056-d3c4c3ce3269/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 e150e83dea41703782a488455769a24bf6c8f600 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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_fec8267c-a702-4f5a-8056-d3c4c3ce3269/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_fec8267c-a702-4f5a-8056-d3c4c3ce3269/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_fec8267c-a702-4f5a-8056-d3c4c3ce3269/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_fec8267c-a702-4f5a-8056-d3c4c3ce3269/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/reducercommutativity/sep.i -s /tmp/vcloud-vcloud-master/worker/run_dir_fec8267c-a702-4f5a-8056-d3c4c3ce3269/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_fec8267c-a702-4f5a-8056-d3c4c3ce3269/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 e150e83dea41703782a488455769a24bf6c8f600 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 01:25:13,639 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 01:25:13,641 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 01:25:13,656 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 01:25:13,656 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 01:25:13,658 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 01:25:13,660 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 01:25:13,669 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 01:25:13,675 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 01:25:13,677 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 01:25:13,678 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 01:25:13,679 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 01:25:13,680 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 01:25:13,680 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 01:25:13,681 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 01:25:13,682 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 01:25:13,683 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 01:25:13,684 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 01:25:13,685 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 01:25:13,690 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 01:25:13,695 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 01:25:13,698 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 01:25:13,700 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 01:25:13,701 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 01:25:13,705 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 01:25:13,705 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 01:25:13,707 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 01:25:13,709 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 01:25:13,709 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 01:25:13,710 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 01:25:13,711 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 01:25:13,711 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 01:25:13,712 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 01:25:13,713 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 01:25:13,714 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 01:25:13,714 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 01:25:13,715 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 01:25:13,715 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 01:25:13,716 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 01:25:13,716 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 01:25:13,718 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 01:25:13,719 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_fec8267c-a702-4f5a-8056-d3c4c3ce3269/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 01:25:13,746 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 01:25:13,746 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 01:25:13,747 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 01:25:13,747 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 01:25:13,747 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 01:25:13,748 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 01:25:13,748 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 01:25:13,748 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 01:25:13,748 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 01:25:13,748 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 01:25:13,749 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 01:25:13,749 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 01:25:13,749 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 01:25:13,749 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 01:25:13,749 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 01:25:13,750 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 01:25:13,750 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 01:25:13,750 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 01:25:13,750 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 01:25:13,750 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 01:25:13,751 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 01:25:13,751 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 01:25:13,751 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 01:25:13,751 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 01:25:13,751 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 01:25:13,752 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 01:25:13,752 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 01:25:13,752 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 01:25:13,752 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_fec8267c-a702-4f5a-8056-d3c4c3ce3269/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 -> e150e83dea41703782a488455769a24bf6c8f600 [2019-11-20 01:25:13,955 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 01:25:13,974 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 01:25:13,977 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 01:25:13,978 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 01:25:13,979 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 01:25:13,980 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_fec8267c-a702-4f5a-8056-d3c4c3ce3269/bin/uautomizer/../../sv-benchmarks/c/reducercommutativity/sep.i [2019-11-20 01:25:14,032 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fec8267c-a702-4f5a-8056-d3c4c3ce3269/bin/uautomizer/data/522884d79/51649b1a36ef41db9885e50ecdf8e95b/FLAG81d428be9 [2019-11-20 01:25:14,448 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 01:25:14,449 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_fec8267c-a702-4f5a-8056-d3c4c3ce3269/sv-benchmarks/c/reducercommutativity/sep.i [2019-11-20 01:25:14,455 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fec8267c-a702-4f5a-8056-d3c4c3ce3269/bin/uautomizer/data/522884d79/51649b1a36ef41db9885e50ecdf8e95b/FLAG81d428be9 [2019-11-20 01:25:14,469 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_fec8267c-a702-4f5a-8056-d3c4c3ce3269/bin/uautomizer/data/522884d79/51649b1a36ef41db9885e50ecdf8e95b [2019-11-20 01:25:14,472 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 01:25:14,473 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 01:25:14,478 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 01:25:14,478 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 01:25:14,482 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 01:25:14,482 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 01:25:14" (1/1) ... [2019-11-20 01:25:14,485 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47fc88e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:25:14, skipping insertion in model container [2019-11-20 01:25:14,485 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 01:25:14" (1/1) ... [2019-11-20 01:25:14,494 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 01:25:14,514 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 01:25:14,780 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 01:25:14,788 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 01:25:14,808 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 01:25:14,822 INFO L192 MainTranslator]: Completed translation [2019-11-20 01:25:14,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:25:14 WrapperNode [2019-11-20 01:25:14,822 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 01:25:14,823 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 01:25:14,824 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 01:25:14,824 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 01:25:14,831 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:25:14" (1/1) ... [2019-11-20 01:25:14,839 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:25:14" (1/1) ... [2019-11-20 01:25:14,867 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 01:25:14,869 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 01:25:14,869 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 01:25:14,869 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 01:25:14,878 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:25:14" (1/1) ... [2019-11-20 01:25:14,879 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:25:14" (1/1) ... [2019-11-20 01:25:14,890 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:25:14" (1/1) ... [2019-11-20 01:25:14,891 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:25:14" (1/1) ... [2019-11-20 01:25:14,905 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:25:14" (1/1) ... [2019-11-20 01:25:14,912 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:25:14" (1/1) ... [2019-11-20 01:25:14,918 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:25:14" (1/1) ... [2019-11-20 01:25:14,924 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 01:25:14,927 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 01:25:14,927 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 01:25:14,927 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 01:25:14,928 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:25:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fec8267c-a702-4f5a-8056-d3c4c3ce3269/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 01:25:15,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-20 01:25:15,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 01:25:15,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 01:25:15,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-20 01:25:15,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 01:25:15,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 01:25:15,426 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 01:25:15,426 INFO L285 CfgBuilder]: Removed 14 assume(true) statements. [2019-11-20 01:25:15,428 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:25:15 BoogieIcfgContainer [2019-11-20 01:25:15,428 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 01:25:15,429 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 01:25:15,429 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 01:25:15,432 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 01:25:15,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 01:25:14" (1/3) ... [2019-11-20 01:25:15,434 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@582af9d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 01:25:15, skipping insertion in model container [2019-11-20 01:25:15,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:25:14" (2/3) ... [2019-11-20 01:25:15,435 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@582af9d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 01:25:15, skipping insertion in model container [2019-11-20 01:25:15,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:25:15" (3/3) ... [2019-11-20 01:25:15,437 INFO L109 eAbstractionObserver]: Analyzing ICFG sep.i [2019-11-20 01:25:15,448 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 01:25:15,456 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 01:25:15,469 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 01:25:15,496 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 01:25:15,497 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 01:25:15,497 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 01:25:15,497 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 01:25:15,497 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 01:25:15,498 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 01:25:15,498 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 01:25:15,498 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 01:25:15,516 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2019-11-20 01:25:15,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-20 01:25:15,523 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:25:15,524 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:25:15,525 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:25:15,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:25:15,531 INFO L82 PathProgramCache]: Analyzing trace with hash -805411982, now seen corresponding path program 1 times [2019-11-20 01:25:15,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:25:15,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801235005] [2019-11-20 01:25:15,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:25:15,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:25:15,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:25:15,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801235005] [2019-11-20 01:25:15,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:25:15,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 01:25:15,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969672089] [2019-11-20 01:25:15,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-20 01:25:15,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:25:15,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-20 01:25:15,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 01:25:15,702 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2019-11-20 01:25:15,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:25:15,723 INFO L93 Difference]: Finished difference Result 52 states and 72 transitions. [2019-11-20 01:25:15,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-20 01:25:15,724 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-11-20 01:25:15,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:25:15,735 INFO L225 Difference]: With dead ends: 52 [2019-11-20 01:25:15,735 INFO L226 Difference]: Without dead ends: 24 [2019-11-20 01:25:15,738 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 01:25:15,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-11-20 01:25:15,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-11-20 01:25:15,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-20 01:25:15,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2019-11-20 01:25:15,776 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 16 [2019-11-20 01:25:15,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:25:15,776 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2019-11-20 01:25:15,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-20 01:25:15,776 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2019-11-20 01:25:15,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-20 01:25:15,777 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:25:15,777 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:25:15,778 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:25:15,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:25:15,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1872946201, now seen corresponding path program 1 times [2019-11-20 01:25:15,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:25:15,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844510721] [2019-11-20 01:25:15,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:25:15,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:25:15,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:25:15,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844510721] [2019-11-20 01:25:15,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:25:15,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:25:15,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651062408] [2019-11-20 01:25:15,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:25:15,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:25:15,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:25:15,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:25:15,892 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand 3 states. [2019-11-20 01:25:15,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:25:15,946 INFO L93 Difference]: Finished difference Result 45 states and 57 transitions. [2019-11-20 01:25:15,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:25:15,947 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-20 01:25:15,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:25:15,948 INFO L225 Difference]: With dead ends: 45 [2019-11-20 01:25:15,948 INFO L226 Difference]: Without dead ends: 27 [2019-11-20 01:25:15,949 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:25:15,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-20 01:25:15,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2019-11-20 01:25:15,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-20 01:25:15,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2019-11-20 01:25:15,957 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 16 [2019-11-20 01:25:15,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:25:15,958 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2019-11-20 01:25:15,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:25:15,958 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2019-11-20 01:25:15,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-20 01:25:15,959 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:25:15,960 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:25:15,960 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:25:15,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:25:15,961 INFO L82 PathProgramCache]: Analyzing trace with hash -567209286, now seen corresponding path program 1 times [2019-11-20 01:25:15,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:25:15,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679693380] [2019-11-20 01:25:15,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:25:16,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:25:16,079 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 01:25:16,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679693380] [2019-11-20 01:25:16,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:25:16,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 01:25:16,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003435328] [2019-11-20 01:25:16,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:25:16,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:25:16,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:25:16,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:25:16,082 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand 4 states. [2019-11-20 01:25:16,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:25:16,169 INFO L93 Difference]: Finished difference Result 46 states and 59 transitions. [2019-11-20 01:25:16,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:25:16,170 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-11-20 01:25:16,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:25:16,171 INFO L225 Difference]: With dead ends: 46 [2019-11-20 01:25:16,171 INFO L226 Difference]: Without dead ends: 33 [2019-11-20 01:25:16,172 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:25:16,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-11-20 01:25:16,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2019-11-20 01:25:16,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-20 01:25:16,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2019-11-20 01:25:16,182 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 19 [2019-11-20 01:25:16,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:25:16,190 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2019-11-20 01:25:16,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:25:16,190 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2019-11-20 01:25:16,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-20 01:25:16,191 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:25:16,191 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:25:16,192 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:25:16,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:25:16,193 INFO L82 PathProgramCache]: Analyzing trace with hash -2050984225, now seen corresponding path program 1 times [2019-11-20 01:25:16,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:25:16,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372945133] [2019-11-20 01:25:16,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:25:16,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:25:16,339 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 01:25:16,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372945133] [2019-11-20 01:25:16,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:25:16,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 01:25:16,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045642304] [2019-11-20 01:25:16,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:25:16,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:25:16,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:25:16,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:25:16,341 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand 4 states. [2019-11-20 01:25:16,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:25:16,390 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2019-11-20 01:25:16,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:25:16,391 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-11-20 01:25:16,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:25:16,392 INFO L225 Difference]: With dead ends: 39 [2019-11-20 01:25:16,392 INFO L226 Difference]: Without dead ends: 29 [2019-11-20 01:25:16,393 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:25:16,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-20 01:25:16,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-11-20 01:25:16,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-20 01:25:16,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2019-11-20 01:25:16,399 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 25 [2019-11-20 01:25:16,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:25:16,400 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2019-11-20 01:25:16,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:25:16,400 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2019-11-20 01:25:16,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-20 01:25:16,402 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:25:16,402 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:25:16,402 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:25:16,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:25:16,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1500824769, now seen corresponding path program 1 times [2019-11-20 01:25:16,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:25:16,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924965028] [2019-11-20 01:25:16,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:25:16,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:25:16,533 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 01:25:16,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924965028] [2019-11-20 01:25:16,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110051716] [2019-11-20 01:25:16,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fec8267c-a702-4f5a-8056-d3c4c3ce3269/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:25:16,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:25:16,636 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 01:25:16,642 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:25:16,695 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 01:25:16,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:25:16,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-11-20 01:25:16,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240980313] [2019-11-20 01:25:16,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 01:25:16,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:25:16,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 01:25:16,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-20 01:25:16,698 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand 6 states. [2019-11-20 01:25:16,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:25:16,777 INFO L93 Difference]: Finished difference Result 54 states and 67 transitions. [2019-11-20 01:25:16,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 01:25:16,781 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-11-20 01:25:16,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:25:16,782 INFO L225 Difference]: With dead ends: 54 [2019-11-20 01:25:16,782 INFO L226 Difference]: Without dead ends: 33 [2019-11-20 01:25:16,782 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-20 01:25:16,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-11-20 01:25:16,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2019-11-20 01:25:16,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-20 01:25:16,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2019-11-20 01:25:16,789 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 27 [2019-11-20 01:25:16,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:25:16,789 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2019-11-20 01:25:16,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 01:25:16,790 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2019-11-20 01:25:16,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-20 01:25:16,791 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:25:16,791 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:25:16,991 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:25:16,992 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:25:16,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:25:16,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1175870478, now seen corresponding path program 2 times [2019-11-20 01:25:16,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:25:16,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753995359] [2019-11-20 01:25:16,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:25:17,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:25:17,109 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-20 01:25:17,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753995359] [2019-11-20 01:25:17,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798627536] [2019-11-20 01:25:17,110 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fec8267c-a702-4f5a-8056-d3c4c3ce3269/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:25:17,186 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 01:25:17,186 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 01:25:17,187 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 01:25:17,191 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:25:17,226 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-20 01:25:17,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:25:17,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-11-20 01:25:17,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814969151] [2019-11-20 01:25:17,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 01:25:17,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:25:17,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 01:25:17,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-11-20 01:25:17,229 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand 7 states. [2019-11-20 01:25:17,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:25:17,345 INFO L93 Difference]: Finished difference Result 58 states and 74 transitions. [2019-11-20 01:25:17,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 01:25:17,346 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2019-11-20 01:25:17,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:25:17,347 INFO L225 Difference]: With dead ends: 58 [2019-11-20 01:25:17,347 INFO L226 Difference]: Without dead ends: 43 [2019-11-20 01:25:17,347 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2019-11-20 01:25:17,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-20 01:25:17,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 37. [2019-11-20 01:25:17,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-20 01:25:17,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 46 transitions. [2019-11-20 01:25:17,353 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 46 transitions. Word has length 30 [2019-11-20 01:25:17,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:25:17,354 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 46 transitions. [2019-11-20 01:25:17,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 01:25:17,354 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2019-11-20 01:25:17,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-20 01:25:17,355 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:25:17,356 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:25:17,562 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:25:17,562 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:25:17,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:25:17,563 INFO L82 PathProgramCache]: Analyzing trace with hash 657704709, now seen corresponding path program 3 times [2019-11-20 01:25:17,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:25:17,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949057228] [2019-11-20 01:25:17,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:25:17,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:25:18,700 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 01:25:18,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949057228] [2019-11-20 01:25:18,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819015531] [2019-11-20 01:25:18,701 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fec8267c-a702-4f5a-8056-d3c4c3ce3269/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:25:18,780 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-20 01:25:18,781 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 01:25:18,783 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-20 01:25:18,786 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:25:18,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:25:18,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:25:19,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:25:24,208 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 01:25:24,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:25:24,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 19 [2019-11-20 01:25:24,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859671155] [2019-11-20 01:25:24,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-20 01:25:24,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:25:24,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-20 01:25:24,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2019-11-20 01:25:24,214 INFO L87 Difference]: Start difference. First operand 37 states and 46 transitions. Second operand 19 states. [2019-11-20 01:25:25,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:25:25,285 INFO L93 Difference]: Finished difference Result 206 states and 252 transitions. [2019-11-20 01:25:25,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-20 01:25:25,286 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2019-11-20 01:25:25,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:25:25,289 INFO L225 Difference]: With dead ends: 206 [2019-11-20 01:25:25,290 INFO L226 Difference]: Without dead ends: 201 [2019-11-20 01:25:25,291 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 27 SyntacticMatches, 7 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2019-11-20 01:25:25,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-11-20 01:25:25,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 82. [2019-11-20 01:25:25,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-11-20 01:25:25,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 111 transitions. [2019-11-20 01:25:25,311 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 111 transitions. Word has length 36 [2019-11-20 01:25:25,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:25:25,311 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 111 transitions. [2019-11-20 01:25:25,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-20 01:25:25,311 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 111 transitions. [2019-11-20 01:25:25,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-20 01:25:25,313 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:25:25,313 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:25:25,517 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:25:25,517 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:25:25,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:25:25,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1862255225, now seen corresponding path program 1 times [2019-11-20 01:25:25,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:25:25,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631702189] [2019-11-20 01:25:25,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:25:25,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:25:27,160 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:25:27,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631702189] [2019-11-20 01:25:27,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528672539] [2019-11-20 01:25:27,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fec8267c-a702-4f5a-8056-d3c4c3ce3269/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:25:27,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:25:27,242 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 39 conjunts are in the unsatisfiable core [2019-11-20 01:25:27,245 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:25:27,611 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-11-20 01:25:27,611 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:25:27,620 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:25:27,621 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:25:27,621 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:15 [2019-11-20 01:25:27,681 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-11-20 01:25:27,681 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:25:27,693 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:25:27,694 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:25:27,694 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:33, output treesize:26 [2019-11-20 01:25:27,826 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 01:25:27,830 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:25:27,831 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 21 treesize of output 12 [2019-11-20 01:25:27,831 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:25:27,839 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:25:27,839 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 01:25:27,840 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:5 [2019-11-20 01:25:27,917 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 01:25:27,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:25:27,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 13] total 34 [2019-11-20 01:25:27,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375237118] [2019-11-20 01:25:27,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-11-20 01:25:27,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:25:27,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-11-20 01:25:27,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=974, Unknown=0, NotChecked=0, Total=1122 [2019-11-20 01:25:27,922 INFO L87 Difference]: Start difference. First operand 82 states and 111 transitions. Second operand 34 states. [2019-11-20 01:25:29,670 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 39 [2019-11-20 01:25:29,941 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 39 [2019-11-20 01:25:30,536 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 43 [2019-11-20 01:25:32,818 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-11-20 01:25:33,441 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 55 [2019-11-20 01:25:34,608 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-11-20 01:25:34,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:25:34,997 INFO L93 Difference]: Finished difference Result 468 states and 623 transitions. [2019-11-20 01:25:34,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-11-20 01:25:34,998 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 36 [2019-11-20 01:25:34,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:25:35,010 INFO L225 Difference]: With dead ends: 468 [2019-11-20 01:25:35,011 INFO L226 Difference]: Without dead ends: 419 [2019-11-20 01:25:35,018 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2940 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=1640, Invalid=8062, Unknown=0, NotChecked=0, Total=9702 [2019-11-20 01:25:35,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2019-11-20 01:25:35,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 189. [2019-11-20 01:25:35,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-11-20 01:25:35,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 252 transitions. [2019-11-20 01:25:35,087 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 252 transitions. Word has length 36 [2019-11-20 01:25:35,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:25:35,087 INFO L462 AbstractCegarLoop]: Abstraction has 189 states and 252 transitions. [2019-11-20 01:25:35,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-11-20 01:25:35,088 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 252 transitions. [2019-11-20 01:25:35,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-20 01:25:35,096 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:25:35,097 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:25:35,302 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:25:35,302 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:25:35,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:25:35,303 INFO L82 PathProgramCache]: Analyzing trace with hash 264677699, now seen corresponding path program 2 times [2019-11-20 01:25:35,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:25:35,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002695639] [2019-11-20 01:25:35,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:25:35,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:25:35,920 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 35 [2019-11-20 01:25:36,333 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 29 [2019-11-20 01:25:36,541 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-20 01:25:36,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002695639] [2019-11-20 01:25:36,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081283887] [2019-11-20 01:25:36,542 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fec8267c-a702-4f5a-8056-d3c4c3ce3269/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 01:25:36,610 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 01:25:36,610 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 01:25:36,612 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 45 conjunts are in the unsatisfiable core [2019-11-20 01:25:36,615 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:25:36,689 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:25:36,691 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2019-11-20 01:25:36,691 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:25:36,702 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:25:36,703 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:25:36,703 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:16 [2019-11-20 01:25:36,951 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:25:36,953 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 01:25:36,956 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:25:36,956 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 32 [2019-11-20 01:25:36,957 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:25:36,980 INFO L567 ElimStorePlain]: treesize reduction 13, result has 70.5 percent of original size [2019-11-20 01:25:36,981 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:25:36,981 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:31 [2019-11-20 01:25:37,027 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:25:37,040 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:25:37,040 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 58 [2019-11-20 01:25:37,041 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:25:37,077 INFO L567 ElimStorePlain]: treesize reduction 16, result has 75.4 percent of original size [2019-11-20 01:25:37,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:25:37,079 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 01:25:37,079 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:16 [2019-11-20 01:25:37,112 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 23 treesize of output 11 [2019-11-20 01:25:37,113 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:25:37,115 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:25:37,115 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:25:37,115 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:7 [2019-11-20 01:25:37,148 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 01:25:37,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:25:37,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 23 [2019-11-20 01:25:37,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689034139] [2019-11-20 01:25:37,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-20 01:25:37,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:25:37,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-20 01:25:37,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2019-11-20 01:25:37,150 INFO L87 Difference]: Start difference. First operand 189 states and 252 transitions. Second operand 23 states. [2019-11-20 01:25:40,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:25:40,007 INFO L93 Difference]: Finished difference Result 434 states and 570 transitions. [2019-11-20 01:25:40,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-11-20 01:25:40,008 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 36 [2019-11-20 01:25:40,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:25:40,012 INFO L225 Difference]: With dead ends: 434 [2019-11-20 01:25:40,012 INFO L226 Difference]: Without dead ends: 402 [2019-11-20 01:25:40,015 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 27 SyntacticMatches, 4 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1187 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=784, Invalid=3772, Unknown=0, NotChecked=0, Total=4556 [2019-11-20 01:25:40,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2019-11-20 01:25:40,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 289. [2019-11-20 01:25:40,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-11-20 01:25:40,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 382 transitions. [2019-11-20 01:25:40,059 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 382 transitions. Word has length 36 [2019-11-20 01:25:40,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:25:40,061 INFO L462 AbstractCegarLoop]: Abstraction has 289 states and 382 transitions. [2019-11-20 01:25:40,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-20 01:25:40,061 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 382 transitions. [2019-11-20 01:25:40,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-20 01:25:40,064 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:25:40,064 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:25:40,268 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:25:40,268 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:25:40,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:25:40,269 INFO L82 PathProgramCache]: Analyzing trace with hash 2043908103, now seen corresponding path program 1 times [2019-11-20 01:25:40,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:25:40,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238578894] [2019-11-20 01:25:40,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:25:40,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:25:41,016 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 28 [2019-11-20 01:25:41,464 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:25:41,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238578894] [2019-11-20 01:25:41,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550851768] [2019-11-20 01:25:41,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fec8267c-a702-4f5a-8056-d3c4c3ce3269/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 01:25:41,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:25:41,523 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 52 conjunts are in the unsatisfiable core [2019-11-20 01:25:41,526 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:25:41,807 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:25:41,808 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2019-11-20 01:25:41,808 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:25:41,823 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:25:41,823 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:25:41,823 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:53, output treesize:29 [2019-11-20 01:25:41,918 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 18 treesize of output 10 [2019-11-20 01:25:41,919 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:25:41,927 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:25:41,928 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:25:41,928 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:16 [2019-11-20 01:25:41,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-20 01:25:41,982 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:25:41,997 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:25:41,998 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:25:41,998 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:26 [2019-11-20 01:25:42,048 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 27 treesize of output 15 [2019-11-20 01:25:42,048 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:25:42,051 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:25:42,051 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:25:42,051 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:11 [2019-11-20 01:25:42,086 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-20 01:25:42,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:25:42,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 27 [2019-11-20 01:25:42,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321519490] [2019-11-20 01:25:42,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-20 01:25:42,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:25:42,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-20 01:25:42,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=620, Unknown=0, NotChecked=0, Total=702 [2019-11-20 01:25:42,089 INFO L87 Difference]: Start difference. First operand 289 states and 382 transitions. Second operand 27 states. [2019-11-20 01:25:44,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:25:44,575 INFO L93 Difference]: Finished difference Result 405 states and 529 transitions. [2019-11-20 01:25:44,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-20 01:25:44,576 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 36 [2019-11-20 01:25:44,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:25:44,578 INFO L225 Difference]: With dead ends: 405 [2019-11-20 01:25:44,579 INFO L226 Difference]: Without dead ends: 352 [2019-11-20 01:25:44,581 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=437, Invalid=2013, Unknown=0, NotChecked=0, Total=2450 [2019-11-20 01:25:44,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2019-11-20 01:25:44,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 321. [2019-11-20 01:25:44,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-11-20 01:25:44,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 422 transitions. [2019-11-20 01:25:44,614 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 422 transitions. Word has length 36 [2019-11-20 01:25:44,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:25:44,615 INFO L462 AbstractCegarLoop]: Abstraction has 321 states and 422 transitions. [2019-11-20 01:25:44,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-20 01:25:44,615 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 422 transitions. [2019-11-20 01:25:44,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-20 01:25:44,616 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:25:44,616 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:25:44,816 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:25:44,817 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:25:44,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:25:44,817 INFO L82 PathProgramCache]: Analyzing trace with hash 2013477131, now seen corresponding path program 1 times [2019-11-20 01:25:44,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:25:44,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496301758] [2019-11-20 01:25:44,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:25:44,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:25:45,303 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-20 01:25:45,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496301758] [2019-11-20 01:25:45,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036458667] [2019-11-20 01:25:45,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fec8267c-a702-4f5a-8056-d3c4c3ce3269/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:25:45,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:25:45,366 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-20 01:25:45,368 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:25:45,527 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-20 01:25:45,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:25:45,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 15 [2019-11-20 01:25:45,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214986686] [2019-11-20 01:25:45,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-20 01:25:45,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:25:45,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-20 01:25:45,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2019-11-20 01:25:45,528 INFO L87 Difference]: Start difference. First operand 321 states and 422 transitions. Second operand 15 states. [2019-11-20 01:25:45,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:25:45,951 INFO L93 Difference]: Finished difference Result 568 states and 733 transitions. [2019-11-20 01:25:45,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-20 01:25:45,952 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 36 [2019-11-20 01:25:45,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:25:45,955 INFO L225 Difference]: With dead ends: 568 [2019-11-20 01:25:45,955 INFO L226 Difference]: Without dead ends: 563 [2019-11-20 01:25:45,956 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 28 SyntacticMatches, 10 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2019-11-20 01:25:45,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2019-11-20 01:25:46,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 385. [2019-11-20 01:25:46,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2019-11-20 01:25:46,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 509 transitions. [2019-11-20 01:25:46,003 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 509 transitions. Word has length 36 [2019-11-20 01:25:46,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:25:46,003 INFO L462 AbstractCegarLoop]: Abstraction has 385 states and 509 transitions. [2019-11-20 01:25:46,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-20 01:25:46,003 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 509 transitions. [2019-11-20 01:25:46,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-20 01:25:46,005 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:25:46,005 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:25:46,208 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:25:46,208 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:25:46,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:25:46,208 INFO L82 PathProgramCache]: Analyzing trace with hash 932464323, now seen corresponding path program 2 times [2019-11-20 01:25:46,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:25:46,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847114890] [2019-11-20 01:25:46,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:25:46,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:25:46,641 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 31 [2019-11-20 01:25:46,791 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 35 [2019-11-20 01:25:47,205 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-20 01:25:47,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847114890] [2019-11-20 01:25:47,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1383312166] [2019-11-20 01:25:47,206 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fec8267c-a702-4f5a-8056-d3c4c3ce3269/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:25:47,258 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 01:25:47,258 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 01:25:47,259 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 53 conjunts are in the unsatisfiable core [2019-11-20 01:25:47,279 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:25:47,507 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:25:47,509 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 23 [2019-11-20 01:25:47,509 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:25:47,519 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:25:47,519 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:25:47,519 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:52, output treesize:28 [2019-11-20 01:25:47,647 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:25:47,649 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2019-11-20 01:25:47,650 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:25:47,657 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:25:47,658 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:25:47,658 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:30 [2019-11-20 01:25:47,712 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:25:47,723 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:25:47,724 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 59 [2019-11-20 01:25:47,724 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:25:47,754 INFO L567 ElimStorePlain]: treesize reduction 16, result has 75.8 percent of original size [2019-11-20 01:25:47,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:25:47,756 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 01:25:47,756 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:17 [2019-11-20 01:25:47,798 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 18 treesize of output 10 [2019-11-20 01:25:47,799 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:25:47,800 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:25:47,801 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:25:47,801 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:6 [2019-11-20 01:25:47,834 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 01:25:47,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:25:47,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 25 [2019-11-20 01:25:47,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126378542] [2019-11-20 01:25:47,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-20 01:25:47,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:25:47,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-20 01:25:47,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=522, Unknown=0, NotChecked=0, Total=600 [2019-11-20 01:25:47,836 INFO L87 Difference]: Start difference. First operand 385 states and 509 transitions. Second operand 25 states. [2019-11-20 01:25:50,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:25:50,021 INFO L93 Difference]: Finished difference Result 537 states and 697 transitions. [2019-11-20 01:25:50,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-11-20 01:25:50,022 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 36 [2019-11-20 01:25:50,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:25:50,025 INFO L225 Difference]: With dead ends: 537 [2019-11-20 01:25:50,025 INFO L226 Difference]: Without dead ends: 444 [2019-11-20 01:25:50,028 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 26 SyntacticMatches, 4 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 667 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=408, Invalid=2348, Unknown=0, NotChecked=0, Total=2756 [2019-11-20 01:25:50,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2019-11-20 01:25:50,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 384. [2019-11-20 01:25:50,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-11-20 01:25:50,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 499 transitions. [2019-11-20 01:25:50,077 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 499 transitions. Word has length 36 [2019-11-20 01:25:50,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:25:50,078 INFO L462 AbstractCegarLoop]: Abstraction has 384 states and 499 transitions. [2019-11-20 01:25:50,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-20 01:25:50,078 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 499 transitions. [2019-11-20 01:25:50,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-20 01:25:50,080 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:25:50,080 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:25:50,283 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:25:50,284 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:25:50,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:25:50,284 INFO L82 PathProgramCache]: Analyzing trace with hash -278211137, now seen corresponding path program 2 times [2019-11-20 01:25:50,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:25:50,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399725316] [2019-11-20 01:25:50,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:25:50,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:25:50,762 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-20 01:25:50,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399725316] [2019-11-20 01:25:50,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [97299351] [2019-11-20 01:25:50,762 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fec8267c-a702-4f5a-8056-d3c4c3ce3269/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:25:50,839 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 01:25:50,839 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 01:25:50,841 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-20 01:25:50,843 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:25:50,988 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-20 01:25:50,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:25:50,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 15 [2019-11-20 01:25:50,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214113771] [2019-11-20 01:25:50,990 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-20 01:25:50,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:25:50,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-20 01:25:50,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2019-11-20 01:25:50,991 INFO L87 Difference]: Start difference. First operand 384 states and 499 transitions. Second operand 15 states. [2019-11-20 01:25:51,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:25:51,741 INFO L93 Difference]: Finished difference Result 651 states and 831 transitions. [2019-11-20 01:25:51,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-20 01:25:51,742 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 36 [2019-11-20 01:25:51,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:25:51,746 INFO L225 Difference]: With dead ends: 651 [2019-11-20 01:25:51,746 INFO L226 Difference]: Without dead ends: 646 [2019-11-20 01:25:51,746 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 31 SyntacticMatches, 7 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2019-11-20 01:25:51,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2019-11-20 01:25:51,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 450. [2019-11-20 01:25:51,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2019-11-20 01:25:51,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 586 transitions. [2019-11-20 01:25:51,801 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 586 transitions. Word has length 36 [2019-11-20 01:25:51,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:25:51,802 INFO L462 AbstractCegarLoop]: Abstraction has 450 states and 586 transitions. [2019-11-20 01:25:51,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-20 01:25:51,802 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 586 transitions. [2019-11-20 01:25:51,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-20 01:25:51,803 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:25:51,804 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:25:52,008 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:25:52,010 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:25:52,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:25:52,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1077561285, now seen corresponding path program 1 times [2019-11-20 01:25:52,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:25:52,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759886073] [2019-11-20 01:25:52,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:25:52,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:25:52,776 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 01:25:52,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759886073] [2019-11-20 01:25:52,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424877990] [2019-11-20 01:25:52,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fec8267c-a702-4f5a-8056-d3c4c3ce3269/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:25:52,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:25:52,823 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-20 01:25:52,825 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:25:52,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:25:52,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:25:53,030 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 01:25:53,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:25:53,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 19 [2019-11-20 01:25:53,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8485283] [2019-11-20 01:25:53,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-20 01:25:53,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:25:53,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-20 01:25:53,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2019-11-20 01:25:53,032 INFO L87 Difference]: Start difference. First operand 450 states and 586 transitions. Second operand 19 states. [2019-11-20 01:25:54,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:25:54,347 INFO L93 Difference]: Finished difference Result 791 states and 1019 transitions. [2019-11-20 01:25:54,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-20 01:25:54,348 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2019-11-20 01:25:54,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:25:54,353 INFO L225 Difference]: With dead ends: 791 [2019-11-20 01:25:54,353 INFO L226 Difference]: Without dead ends: 786 [2019-11-20 01:25:54,354 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 29 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2019-11-20 01:25:54,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2019-11-20 01:25:54,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 528. [2019-11-20 01:25:54,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2019-11-20 01:25:54,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 695 transitions. [2019-11-20 01:25:54,433 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 695 transitions. Word has length 36 [2019-11-20 01:25:54,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:25:54,435 INFO L462 AbstractCegarLoop]: Abstraction has 528 states and 695 transitions. [2019-11-20 01:25:54,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-20 01:25:54,435 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 695 transitions. [2019-11-20 01:25:54,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-20 01:25:54,437 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:25:54,437 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:25:54,642 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:25:54,642 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:25:54,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:25:54,643 INFO L82 PathProgramCache]: Analyzing trace with hash 532244478, now seen corresponding path program 4 times [2019-11-20 01:25:54,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:25:54,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17704648] [2019-11-20 01:25:54,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:25:54,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:25:54,752 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 01:25:54,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17704648] [2019-11-20 01:25:54,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [297842087] [2019-11-20 01:25:54,752 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fec8267c-a702-4f5a-8056-d3c4c3ce3269/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:25:54,814 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-20 01:25:54,814 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 01:25:54,815 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 01:25:54,821 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:25:54,896 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 01:25:54,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:25:54,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2019-11-20 01:25:54,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595384964] [2019-11-20 01:25:54,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-20 01:25:54,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:25:54,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-20 01:25:54,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-11-20 01:25:54,898 INFO L87 Difference]: Start difference. First operand 528 states and 695 transitions. Second operand 13 states. [2019-11-20 01:25:55,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:25:55,162 INFO L93 Difference]: Finished difference Result 766 states and 999 transitions. [2019-11-20 01:25:55,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 01:25:55,163 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 39 [2019-11-20 01:25:55,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:25:55,166 INFO L225 Difference]: With dead ends: 766 [2019-11-20 01:25:55,166 INFO L226 Difference]: Without dead ends: 514 [2019-11-20 01:25:55,167 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2019-11-20 01:25:55,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2019-11-20 01:25:55,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 426. [2019-11-20 01:25:55,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-11-20 01:25:55,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 560 transitions. [2019-11-20 01:25:55,270 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 560 transitions. Word has length 39 [2019-11-20 01:25:55,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:25:55,270 INFO L462 AbstractCegarLoop]: Abstraction has 426 states and 560 transitions. [2019-11-20 01:25:55,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-20 01:25:55,270 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 560 transitions. [2019-11-20 01:25:55,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-20 01:25:55,271 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:25:55,271 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:25:55,477 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:25:55,477 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:25:55,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:25:55,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1417472424, now seen corresponding path program 5 times [2019-11-20 01:25:55,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:25:55,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450951072] [2019-11-20 01:25:55,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:25:55,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:25:55,583 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 01:25:55,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450951072] [2019-11-20 01:25:55,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622435505] [2019-11-20 01:25:55,584 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fec8267c-a702-4f5a-8056-d3c4c3ce3269/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:25:55,655 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-11-20 01:25:55,655 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 01:25:55,656 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 01:25:55,657 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:25:55,720 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 01:25:55,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:25:55,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2019-11-20 01:25:55,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839362879] [2019-11-20 01:25:55,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-20 01:25:55,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:25:55,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-20 01:25:55,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-11-20 01:25:55,722 INFO L87 Difference]: Start difference. First operand 426 states and 560 transitions. Second operand 13 states. [2019-11-20 01:25:55,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:25:55,993 INFO L93 Difference]: Finished difference Result 477 states and 632 transitions. [2019-11-20 01:25:55,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 01:25:55,994 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 39 [2019-11-20 01:25:55,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:25:55,996 INFO L225 Difference]: With dead ends: 477 [2019-11-20 01:25:55,997 INFO L226 Difference]: Without dead ends: 392 [2019-11-20 01:25:55,998 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2019-11-20 01:25:55,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2019-11-20 01:25:56,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 308. [2019-11-20 01:25:56,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2019-11-20 01:25:56,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 415 transitions. [2019-11-20 01:25:56,044 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 415 transitions. Word has length 39 [2019-11-20 01:25:56,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:25:56,044 INFO L462 AbstractCegarLoop]: Abstraction has 308 states and 415 transitions. [2019-11-20 01:25:56,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-20 01:25:56,045 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 415 transitions. [2019-11-20 01:25:56,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-20 01:25:56,046 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:25:56,046 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:25:56,250 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:25:56,250 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:25:56,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:25:56,251 INFO L82 PathProgramCache]: Analyzing trace with hash 825189825, now seen corresponding path program 6 times [2019-11-20 01:25:56,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:25:56,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987940601] [2019-11-20 01:25:56,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:25:56,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:25:56,388 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-20 01:25:56,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987940601] [2019-11-20 01:25:56,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034624178] [2019-11-20 01:25:56,389 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fec8267c-a702-4f5a-8056-d3c4c3ce3269/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:25:56,480 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-11-20 01:25:56,480 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 01:25:56,481 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 01:25:56,483 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:25:56,548 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-20 01:25:56,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:25:56,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2019-11-20 01:25:56,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724299361] [2019-11-20 01:25:56,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-20 01:25:56,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:25:56,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-20 01:25:56,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-11-20 01:25:56,551 INFO L87 Difference]: Start difference. First operand 308 states and 415 transitions. Second operand 11 states. [2019-11-20 01:25:56,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:25:56,843 INFO L93 Difference]: Finished difference Result 385 states and 513 transitions. [2019-11-20 01:25:56,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 01:25:56,844 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 45 [2019-11-20 01:25:56,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:25:56,846 INFO L225 Difference]: With dead ends: 385 [2019-11-20 01:25:56,846 INFO L226 Difference]: Without dead ends: 311 [2019-11-20 01:25:56,848 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2019-11-20 01:25:56,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2019-11-20 01:25:56,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 308. [2019-11-20 01:25:56,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2019-11-20 01:25:56,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 409 transitions. [2019-11-20 01:25:56,895 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 409 transitions. Word has length 45 [2019-11-20 01:25:56,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:25:56,895 INFO L462 AbstractCegarLoop]: Abstraction has 308 states and 409 transitions. [2019-11-20 01:25:56,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-20 01:25:56,896 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 409 transitions. [2019-11-20 01:25:56,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-20 01:25:56,897 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:25:56,897 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:25:57,102 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:25:57,102 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:25:57,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:25:57,102 INFO L82 PathProgramCache]: Analyzing trace with hash -159905373, now seen corresponding path program 7 times [2019-11-20 01:25:57,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:25:57,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117421395] [2019-11-20 01:25:57,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:25:57,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:25:58,132 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-20 01:25:58,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117421395] [2019-11-20 01:25:58,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074881393] [2019-11-20 01:25:58,133 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fec8267c-a702-4f5a-8056-d3c4c3ce3269/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:25:58,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:25:58,184 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 37 conjunts are in the unsatisfiable core [2019-11-20 01:25:58,185 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:25:58,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:25:58,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:25:58,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:25:58,707 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-20 01:25:58,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:25:58,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 22 [2019-11-20 01:25:58,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780031115] [2019-11-20 01:25:58,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-20 01:25:58,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:25:58,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-20 01:25:58,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2019-11-20 01:25:58,709 INFO L87 Difference]: Start difference. First operand 308 states and 409 transitions. Second operand 22 states. [2019-11-20 01:25:59,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:25:59,591 INFO L93 Difference]: Finished difference Result 670 states and 855 transitions. [2019-11-20 01:25:59,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-20 01:25:59,591 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 47 [2019-11-20 01:25:59,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:25:59,595 INFO L225 Difference]: With dead ends: 670 [2019-11-20 01:25:59,595 INFO L226 Difference]: Without dead ends: 665 [2019-11-20 01:25:59,596 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 36 SyntacticMatches, 9 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650 [2019-11-20 01:25:59,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2019-11-20 01:25:59,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 391. [2019-11-20 01:25:59,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2019-11-20 01:25:59,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 528 transitions. [2019-11-20 01:25:59,656 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 528 transitions. Word has length 47 [2019-11-20 01:25:59,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:25:59,656 INFO L462 AbstractCegarLoop]: Abstraction has 391 states and 528 transitions. [2019-11-20 01:25:59,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-20 01:25:59,657 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 528 transitions. [2019-11-20 01:25:59,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-20 01:25:59,658 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:25:59,658 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:25:59,861 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:25:59,861 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:25:59,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:25:59,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1615101989, now seen corresponding path program 3 times [2019-11-20 01:25:59,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:25:59,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912216280] [2019-11-20 01:25:59,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:25:59,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:26:00,329 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 32 [2019-11-20 01:26:00,592 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 31 [2019-11-20 01:26:01,110 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 1 proven. 35 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-20 01:26:01,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912216280] [2019-11-20 01:26:01,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2096197822] [2019-11-20 01:26:01,112 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fec8267c-a702-4f5a-8056-d3c4c3ce3269/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:26:01,161 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-20 01:26:01,161 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 01:26:01,162 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 33 conjunts are in the unsatisfiable core [2019-11-20 01:26:01,164 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:26:01,251 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-11-20 01:26:01,252 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:26:01,256 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:26:01,256 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:26:01,256 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:9 [2019-11-20 01:26:01,298 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-11-20 01:26:01,299 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:26:01,310 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:26:01,311 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:26:01,311 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2019-11-20 01:26:01,347 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:26:01,347 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 23 treesize of output 23 [2019-11-20 01:26:01,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:26:01,349 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-20 01:26:01,356 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:26:01,356 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:26:01,356 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:20 [2019-11-20 01:26:01,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:26:01,438 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-20 01:26:01,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:26:01,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 11] total 28 [2019-11-20 01:26:01,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413277202] [2019-11-20 01:26:01,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-20 01:26:01,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:26:01,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-20 01:26:01,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=644, Unknown=0, NotChecked=0, Total=756 [2019-11-20 01:26:01,441 INFO L87 Difference]: Start difference. First operand 391 states and 528 transitions. Second operand 28 states. [2019-11-20 01:26:02,728 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 29 [2019-11-20 01:26:04,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:26:04,400 INFO L93 Difference]: Finished difference Result 551 states and 729 transitions. [2019-11-20 01:26:04,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-11-20 01:26:04,402 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 47 [2019-11-20 01:26:04,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:26:04,407 INFO L225 Difference]: With dead ends: 551 [2019-11-20 01:26:04,407 INFO L226 Difference]: Without dead ends: 546 [2019-11-20 01:26:04,409 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1218 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=968, Invalid=3862, Unknown=0, NotChecked=0, Total=4830 [2019-11-20 01:26:04,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2019-11-20 01:26:04,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 454. [2019-11-20 01:26:04,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 454 states. [2019-11-20 01:26:04,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 606 transitions. [2019-11-20 01:26:04,471 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 606 transitions. Word has length 47 [2019-11-20 01:26:04,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:26:04,472 INFO L462 AbstractCegarLoop]: Abstraction has 454 states and 606 transitions. [2019-11-20 01:26:04,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-20 01:26:04,472 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 606 transitions. [2019-11-20 01:26:04,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-20 01:26:04,473 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:26:04,473 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:26:04,677 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:26:04,677 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:26:04,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:26:04,677 INFO L82 PathProgramCache]: Analyzing trace with hash -552932383, now seen corresponding path program 4 times [2019-11-20 01:26:04,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:26:04,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214414588] [2019-11-20 01:26:04,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:26:04,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:26:05,509 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 36 [2019-11-20 01:26:06,556 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:26:06,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214414588] [2019-11-20 01:26:06,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124167753] [2019-11-20 01:26:06,557 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fec8267c-a702-4f5a-8056-d3c4c3ce3269/bin/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:26:06,610 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-20 01:26:06,610 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 01:26:06,611 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 60 conjunts are in the unsatisfiable core [2019-11-20 01:26:06,612 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:26:07,139 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:26:07,140 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:26:07,142 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:26:07,143 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:26:07,143 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 40 [2019-11-20 01:26:07,144 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:26:07,157 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:26:07,158 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:26:07,158 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:51 [2019-11-20 01:26:07,282 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:26:07,283 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:26:07,284 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:26:07,285 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:26:07,286 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 01:26:07,288 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:26:07,288 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 58 [2019-11-20 01:26:07,289 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:26:07,318 INFO L567 ElimStorePlain]: treesize reduction 22, result has 70.7 percent of original size [2019-11-20 01:26:07,318 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:26:07,319 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:80, output treesize:48 [2019-11-20 01:26:07,480 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 01:26:07,481 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:26:07,482 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:26:07,483 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 34 [2019-11-20 01:26:07,483 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:26:07,502 INFO L567 ElimStorePlain]: treesize reduction 7, result has 82.5 percent of original size [2019-11-20 01:26:07,502 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 01:26:07,502 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:16 [2019-11-20 01:26:07,585 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 01:26:07,587 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:26:07,587 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 19 treesize of output 12 [2019-11-20 01:26:07,587 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:26:07,591 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:26:07,591 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:26:07,592 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:9 [2019-11-20 01:26:07,636 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 01:26:07,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:26:07,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 47 [2019-11-20 01:26:07,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863270452] [2019-11-20 01:26:07,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-11-20 01:26:07,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:26:07,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-11-20 01:26:07,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=1907, Unknown=0, NotChecked=0, Total=2162 [2019-11-20 01:26:07,638 INFO L87 Difference]: Start difference. First operand 454 states and 606 transitions. Second operand 47 states. [2019-11-20 01:26:14,039 WARN L191 SmtUtils]: Spent 623.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 30 [2019-11-20 01:26:16,461 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 64 [2019-11-20 01:26:16,629 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-11-20 01:26:17,765 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 62 [2019-11-20 01:26:18,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:26:18,149 INFO L93 Difference]: Finished difference Result 1420 states and 1867 transitions. [2019-11-20 01:26:18,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-11-20 01:26:18,149 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-11-20 01:26:18,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:26:18,154 INFO L225 Difference]: With dead ends: 1420 [2019-11-20 01:26:18,155 INFO L226 Difference]: Without dead ends: 1291 [2019-11-20 01:26:18,160 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6880 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=2404, Invalid=17902, Unknown=0, NotChecked=0, Total=20306 [2019-11-20 01:26:18,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states. [2019-11-20 01:26:18,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 927. [2019-11-20 01:26:18,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 927 states. [2019-11-20 01:26:18,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1204 transitions. [2019-11-20 01:26:18,371 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1204 transitions. Word has length 47 [2019-11-20 01:26:18,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:26:18,371 INFO L462 AbstractCegarLoop]: Abstraction has 927 states and 1204 transitions. [2019-11-20 01:26:18,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-11-20 01:26:18,371 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1204 transitions. [2019-11-20 01:26:18,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-20 01:26:18,373 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:26:18,374 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:26:18,578 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:26:18,578 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:26:18,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:26:18,579 INFO L82 PathProgramCache]: Analyzing trace with hash 499626149, now seen corresponding path program 3 times [2019-11-20 01:26:18,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:26:18,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534762970] [2019-11-20 01:26:18,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:26:18,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:26:19,912 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 1 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:26:19,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534762970] [2019-11-20 01:26:19,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800710068] [2019-11-20 01:26:19,913 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fec8267c-a702-4f5a-8056-d3c4c3ce3269/bin/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:26:19,981 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-20 01:26:19,981 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 01:26:19,983 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-20 01:26:19,984 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:26:20,253 INFO L343 Elim1Store]: treesize reduction 49, result has 59.5 percent of original size [2019-11-20 01:26:20,254 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 87 [2019-11-20 01:26:20,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:26:20,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:26:20,256 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:26:20,316 INFO L567 ElimStorePlain]: treesize reduction 62, result has 51.9 percent of original size [2019-11-20 01:26:20,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:26:20,317 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:26:20,317 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:58 [2019-11-20 01:26:20,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:26:20,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:26:20,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:26:20,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:26:20,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:26:20,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:26:20,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:26:20,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:26:20,741 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:26:20,741 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 31 treesize of output 31 [2019-11-20 01:26:20,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:26:20,743 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:26:20,754 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:26:20,754 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 46 treesize of output 46 [2019-11-20 01:26:20,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:26:20,756 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:26:20,788 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:26:20,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:26:20,790 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-11-20 01:26:20,790 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:78, output treesize:88 [2019-11-20 01:26:20,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:26:20,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:26:20,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:26:20,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:26:20,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:26:21,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:26:21,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:26:21,208 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-20 01:26:21,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:26:21,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 14] total 36 [2019-11-20 01:26:21,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315495175] [2019-11-20 01:26:21,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-11-20 01:26:21,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:26:21,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-11-20 01:26:21,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1127, Unknown=0, NotChecked=0, Total=1260 [2019-11-20 01:26:21,209 INFO L87 Difference]: Start difference. First operand 927 states and 1204 transitions. Second operand 36 states. [2019-11-20 01:26:25,779 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-11-20 01:26:33,170 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 68 [2019-11-20 01:26:33,914 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 64 [2019-11-20 01:26:34,557 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-11-20 01:26:35,138 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 91 [2019-11-20 01:26:35,545 WARN L191 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 87 [2019-11-20 01:26:35,813 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 88 [2019-11-20 01:26:36,794 WARN L191 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 69 [2019-11-20 01:26:39,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:26:39,136 INFO L93 Difference]: Finished difference Result 1875 states and 2431 transitions. [2019-11-20 01:26:39,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-11-20 01:26:39,137 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 47 [2019-11-20 01:26:39,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:26:39,143 INFO L225 Difference]: With dead ends: 1875 [2019-11-20 01:26:39,143 INFO L226 Difference]: Without dead ends: 1647 [2019-11-20 01:26:39,146 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 31 SyntacticMatches, 8 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4544 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=2106, Invalid=13394, Unknown=0, NotChecked=0, Total=15500 [2019-11-20 01:26:39,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1647 states. [2019-11-20 01:26:39,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1647 to 1199. [2019-11-20 01:26:39,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1199 states. [2019-11-20 01:26:39,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1199 states to 1199 states and 1540 transitions. [2019-11-20 01:26:39,419 INFO L78 Accepts]: Start accepts. Automaton has 1199 states and 1540 transitions. Word has length 47 [2019-11-20 01:26:39,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:26:39,419 INFO L462 AbstractCegarLoop]: Abstraction has 1199 states and 1540 transitions. [2019-11-20 01:26:39,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-11-20 01:26:39,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1199 states and 1540 transitions. [2019-11-20 01:26:39,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-20 01:26:39,422 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:26:39,423 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:26:39,626 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:26:39,627 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:26:39,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:26:39,627 INFO L82 PathProgramCache]: Analyzing trace with hash 247147749, now seen corresponding path program 3 times [2019-11-20 01:26:39,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:26:39,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460130433] [2019-11-20 01:26:39,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:26:39,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:26:40,141 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-20 01:26:40,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460130433] [2019-11-20 01:26:40,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [861657132] [2019-11-20 01:26:40,142 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fec8267c-a702-4f5a-8056-d3c4c3ce3269/bin/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:26:40,218 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-20 01:26:40,219 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 01:26:40,220 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 37 conjunts are in the unsatisfiable core [2019-11-20 01:26:40,221 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:26:40,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:26:40,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:26:40,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:26:40,564 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-20 01:26:40,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:26:40,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 18 [2019-11-20 01:26:40,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030081087] [2019-11-20 01:26:40,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-20 01:26:40,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:26:40,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-20 01:26:40,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2019-11-20 01:26:40,565 INFO L87 Difference]: Start difference. First operand 1199 states and 1540 transitions. Second operand 18 states. [2019-11-20 01:26:41,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:26:41,572 INFO L93 Difference]: Finished difference Result 1835 states and 2344 transitions. [2019-11-20 01:26:41,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-20 01:26:41,574 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 47 [2019-11-20 01:26:41,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:26:41,581 INFO L225 Difference]: With dead ends: 1835 [2019-11-20 01:26:41,582 INFO L226 Difference]: Without dead ends: 1830 [2019-11-20 01:26:41,582 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 38 SyntacticMatches, 11 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2019-11-20 01:26:41,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1830 states. [2019-11-20 01:26:41,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1830 to 1322. [2019-11-20 01:26:41,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1322 states. [2019-11-20 01:26:41,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 1695 transitions. [2019-11-20 01:26:41,857 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 1695 transitions. Word has length 47 [2019-11-20 01:26:41,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:26:41,857 INFO L462 AbstractCegarLoop]: Abstraction has 1322 states and 1695 transitions. [2019-11-20 01:26:41,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-20 01:26:41,858 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 1695 transitions. [2019-11-20 01:26:41,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-20 01:26:41,861 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:26:41,861 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:26:42,065 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:26:42,065 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:26:42,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:26:42,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1531712671, now seen corresponding path program 4 times [2019-11-20 01:26:42,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:26:42,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094296125] [2019-11-20 01:26:42,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:26:42,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:26:43,022 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-20 01:26:43,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094296125] [2019-11-20 01:26:43,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1193109052] [2019-11-20 01:26:43,023 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fec8267c-a702-4f5a-8056-d3c4c3ce3269/bin/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:26:43,120 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-20 01:26:43,120 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 01:26:43,123 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 38 conjunts are in the unsatisfiable core [2019-11-20 01:26:43,124 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:26:43,325 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2019-11-20 01:26:43,325 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:26:43,336 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:26:43,337 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:26:43,337 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:47, output treesize:29 [2019-11-20 01:26:43,401 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:26:43,401 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 29 treesize of output 25 [2019-11-20 01:26:43,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:26:43,403 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-20 01:26:43,412 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:26:43,412 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:26:43,412 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:25 [2019-11-20 01:26:43,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:26:43,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:26:43,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:26:43,569 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-20 01:26:43,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:26:43,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2019-11-20 01:26:43,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254977845] [2019-11-20 01:26:43,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-20 01:26:43,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:26:43,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-20 01:26:43,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2019-11-20 01:26:43,571 INFO L87 Difference]: Start difference. First operand 1322 states and 1695 transitions. Second operand 23 states. [2019-11-20 01:26:44,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:26:44,776 INFO L93 Difference]: Finished difference Result 1877 states and 2395 transitions. [2019-11-20 01:26:44,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-20 01:26:44,777 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 47 [2019-11-20 01:26:44,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:26:44,782 INFO L225 Difference]: With dead ends: 1877 [2019-11-20 01:26:44,782 INFO L226 Difference]: Without dead ends: 1308 [2019-11-20 01:26:44,783 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 36 SyntacticMatches, 6 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=187, Invalid=1073, Unknown=0, NotChecked=0, Total=1260 [2019-11-20 01:26:44,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2019-11-20 01:26:44,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 1239. [2019-11-20 01:26:44,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1239 states. [2019-11-20 01:26:44,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 1567 transitions. [2019-11-20 01:26:44,973 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 1567 transitions. Word has length 47 [2019-11-20 01:26:44,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:26:44,974 INFO L462 AbstractCegarLoop]: Abstraction has 1239 states and 1567 transitions. [2019-11-20 01:26:44,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-20 01:26:44,974 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 1567 transitions. [2019-11-20 01:26:44,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-20 01:26:44,976 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:26:44,977 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:26:45,180 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:26:45,180 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:26:45,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:26:45,181 INFO L82 PathProgramCache]: Analyzing trace with hash -830112797, now seen corresponding path program 1 times [2019-11-20 01:26:45,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:26:45,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419602624] [2019-11-20 01:26:45,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:26:45,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:26:45,914 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 28 [2019-11-20 01:26:46,089 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 33 [2019-11-20 01:26:46,900 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-20 01:26:46,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419602624] [2019-11-20 01:26:46,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [97919823] [2019-11-20 01:26:46,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fec8267c-a702-4f5a-8056-d3c4c3ce3269/bin/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:26:46,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:26:46,956 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 45 conjunts are in the unsatisfiable core [2019-11-20 01:26:46,957 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:26:47,420 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 18 treesize of output 10 [2019-11-20 01:26:47,421 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:26:47,430 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:26:47,430 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:26:47,431 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:16 [2019-11-20 01:26:47,497 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-11-20 01:26:47,497 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:26:47,523 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:26:47,524 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:26:47,524 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:27 [2019-11-20 01:26:47,817 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 01:26:47,819 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:26:47,820 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 22 treesize of output 13 [2019-11-20 01:26:47,820 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:26:47,827 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:26:47,827 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 01:26:47,828 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:6 [2019-11-20 01:26:47,918 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 24 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 01:26:47,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:26:47,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 16] total 37 [2019-11-20 01:26:47,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571811013] [2019-11-20 01:26:47,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-11-20 01:26:47,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:26:47,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-11-20 01:26:47,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1190, Unknown=0, NotChecked=0, Total=1332 [2019-11-20 01:26:47,921 INFO L87 Difference]: Start difference. First operand 1239 states and 1567 transitions. Second operand 37 states. [2019-11-20 01:26:51,067 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 38 [2019-11-20 01:26:55,505 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 45 [2019-11-20 01:27:00,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:27:00,344 INFO L93 Difference]: Finished difference Result 1672 states and 2087 transitions. [2019-11-20 01:27:00,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-11-20 01:27:00,344 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 47 [2019-11-20 01:27:00,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:27:00,350 INFO L225 Difference]: With dead ends: 1672 [2019-11-20 01:27:00,350 INFO L226 Difference]: Without dead ends: 1662 [2019-11-20 01:27:00,352 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6659 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=2735, Invalid=17571, Unknown=0, NotChecked=0, Total=20306 [2019-11-20 01:27:00,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1662 states. [2019-11-20 01:27:00,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1662 to 1245. [2019-11-20 01:27:00,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1245 states. [2019-11-20 01:27:00,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1245 states to 1245 states and 1573 transitions. [2019-11-20 01:27:00,584 INFO L78 Accepts]: Start accepts. Automaton has 1245 states and 1573 transitions. Word has length 47 [2019-11-20 01:27:00,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:27:00,584 INFO L462 AbstractCegarLoop]: Abstraction has 1245 states and 1573 transitions. [2019-11-20 01:27:00,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-11-20 01:27:00,585 INFO L276 IsEmpty]: Start isEmpty. Operand 1245 states and 1573 transitions. [2019-11-20 01:27:00,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-20 01:27:00,587 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:27:00,587 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:27:00,791 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:27:00,791 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:27:00,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:27:00,792 INFO L82 PathProgramCache]: Analyzing trace with hash 944894565, now seen corresponding path program 4 times [2019-11-20 01:27:00,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:27:00,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697863052] [2019-11-20 01:27:00,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:27:00,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:27:01,675 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 16 [2019-11-20 01:27:01,867 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-20 01:27:01,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697863052] [2019-11-20 01:27:01,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590214616] [2019-11-20 01:27:01,867 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fec8267c-a702-4f5a-8056-d3c4c3ce3269/bin/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:27:01,932 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-20 01:27:01,932 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 01:27:01,933 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 37 conjunts are in the unsatisfiable core [2019-11-20 01:27:01,934 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:27:01,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:27:01,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:27:02,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:27:02,293 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-20 01:27:02,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:27:02,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 18 [2019-11-20 01:27:02,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660659137] [2019-11-20 01:27:02,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-20 01:27:02,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:27:02,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-20 01:27:02,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2019-11-20 01:27:02,295 INFO L87 Difference]: Start difference. First operand 1245 states and 1573 transitions. Second operand 18 states. [2019-11-20 01:27:03,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:27:03,862 INFO L93 Difference]: Finished difference Result 1673 states and 2106 transitions. [2019-11-20 01:27:03,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-20 01:27:03,863 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 47 [2019-11-20 01:27:03,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:27:03,869 INFO L225 Difference]: With dead ends: 1673 [2019-11-20 01:27:03,869 INFO L226 Difference]: Without dead ends: 1668 [2019-11-20 01:27:03,870 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 40 SyntacticMatches, 9 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=94, Invalid=412, Unknown=0, NotChecked=0, Total=506 [2019-11-20 01:27:03,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1668 states. [2019-11-20 01:27:04,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1668 to 1355. [2019-11-20 01:27:04,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1355 states. [2019-11-20 01:27:04,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1355 states to 1355 states and 1719 transitions. [2019-11-20 01:27:04,120 INFO L78 Accepts]: Start accepts. Automaton has 1355 states and 1719 transitions. Word has length 47 [2019-11-20 01:27:04,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:27:04,120 INFO L462 AbstractCegarLoop]: Abstraction has 1355 states and 1719 transitions. [2019-11-20 01:27:04,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-20 01:27:04,121 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 1719 transitions. [2019-11-20 01:27:04,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-20 01:27:04,123 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:27:04,123 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:27:04,326 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:27:04,327 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:27:04,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:27:04,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1351947687, now seen corresponding path program 5 times [2019-11-20 01:27:04,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:27:04,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074535382] [2019-11-20 01:27:04,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:27:04,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:27:05,012 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 18 [2019-11-20 01:27:05,190 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-20 01:27:05,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074535382] [2019-11-20 01:27:05,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1867238657] [2019-11-20 01:27:05,190 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fec8267c-a702-4f5a-8056-d3c4c3ce3269/bin/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:27:05,311 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-11-20 01:27:05,311 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 01:27:05,313 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 37 conjunts are in the unsatisfiable core [2019-11-20 01:27:05,314 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:27:05,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:27:05,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:27:05,673 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-20 01:27:05,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:27:05,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 17 [2019-11-20 01:27:05,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763321864] [2019-11-20 01:27:05,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-20 01:27:05,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:27:05,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-20 01:27:05,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2019-11-20 01:27:05,675 INFO L87 Difference]: Start difference. First operand 1355 states and 1719 transitions. Second operand 17 states. [2019-11-20 01:27:08,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:27:08,811 INFO L93 Difference]: Finished difference Result 1892 states and 2404 transitions. [2019-11-20 01:27:08,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-20 01:27:08,818 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 47 [2019-11-20 01:27:08,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:27:08,824 INFO L225 Difference]: With dead ends: 1892 [2019-11-20 01:27:08,824 INFO L226 Difference]: Without dead ends: 1887 [2019-11-20 01:27:08,825 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 39 SyntacticMatches, 11 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2019-11-20 01:27:08,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1887 states. [2019-11-20 01:27:09,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1887 to 1432. [2019-11-20 01:27:09,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1432 states. [2019-11-20 01:27:09,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 1820 transitions. [2019-11-20 01:27:09,075 INFO L78 Accepts]: Start accepts. Automaton has 1432 states and 1820 transitions. Word has length 47 [2019-11-20 01:27:09,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:27:09,075 INFO L462 AbstractCegarLoop]: Abstraction has 1432 states and 1820 transitions. [2019-11-20 01:27:09,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-20 01:27:09,075 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 1820 transitions. [2019-11-20 01:27:09,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-20 01:27:09,078 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:27:09,078 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:27:09,282 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:27:09,282 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:27:09,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:27:09,282 INFO L82 PathProgramCache]: Analyzing trace with hash 2141389541, now seen corresponding path program 6 times [2019-11-20 01:27:09,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:27:09,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560602799] [2019-11-20 01:27:09,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:27:09,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:27:09,734 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-20 01:27:09,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560602799] [2019-11-20 01:27:09,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969956101] [2019-11-20 01:27:09,734 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fec8267c-a702-4f5a-8056-d3c4c3ce3269/bin/uautomizer/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:27:09,802 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-11-20 01:27:09,802 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 01:27:09,804 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 37 conjunts are in the unsatisfiable core [2019-11-20 01:27:09,805 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:27:09,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:27:09,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:27:10,005 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-20 01:27:10,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:27:10,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 18 [2019-11-20 01:27:10,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418429371] [2019-11-20 01:27:10,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-20 01:27:10,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:27:10,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-20 01:27:10,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2019-11-20 01:27:10,006 INFO L87 Difference]: Start difference. First operand 1432 states and 1820 transitions. Second operand 18 states. [2019-11-20 01:27:11,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:27:11,095 INFO L93 Difference]: Finished difference Result 1956 states and 2489 transitions. [2019-11-20 01:27:11,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-20 01:27:11,096 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 47 [2019-11-20 01:27:11,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:27:11,104 INFO L225 Difference]: With dead ends: 1956 [2019-11-20 01:27:11,104 INFO L226 Difference]: Without dead ends: 1951 [2019-11-20 01:27:11,105 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 40 SyntacticMatches, 9 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=91, Invalid=371, Unknown=0, NotChecked=0, Total=462 [2019-11-20 01:27:11,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1951 states. [2019-11-20 01:27:11,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1951 to 1510. [2019-11-20 01:27:11,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1510 states. [2019-11-20 01:27:11,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1510 states to 1510 states and 1922 transitions. [2019-11-20 01:27:11,393 INFO L78 Accepts]: Start accepts. Automaton has 1510 states and 1922 transitions. Word has length 47 [2019-11-20 01:27:11,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:27:11,394 INFO L462 AbstractCegarLoop]: Abstraction has 1510 states and 1922 transitions. [2019-11-20 01:27:11,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-20 01:27:11,394 INFO L276 IsEmpty]: Start isEmpty. Operand 1510 states and 1922 transitions. [2019-11-20 01:27:11,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-20 01:27:11,396 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:27:11,396 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:27:11,596 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:27:11,597 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:27:11,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:27:11,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1746524633, now seen corresponding path program 7 times [2019-11-20 01:27:11,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:27:11,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032152367] [2019-11-20 01:27:11,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:27:11,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:27:12,103 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-20 01:27:12,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032152367] [2019-11-20 01:27:12,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513721234] [2019-11-20 01:27:12,104 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fec8267c-a702-4f5a-8056-d3c4c3ce3269/bin/uautomizer/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:27:12,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:27:12,187 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 37 conjunts are in the unsatisfiable core [2019-11-20 01:27:12,188 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:27:12,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:27:12,374 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-20 01:27:12,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:27:12,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 17 [2019-11-20 01:27:12,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742008370] [2019-11-20 01:27:12,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-20 01:27:12,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:27:12,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-20 01:27:12,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2019-11-20 01:27:12,376 INFO L87 Difference]: Start difference. First operand 1510 states and 1922 transitions. Second operand 17 states. [2019-11-20 01:27:13,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:27:13,453 INFO L93 Difference]: Finished difference Result 1934 states and 2457 transitions. [2019-11-20 01:27:13,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-20 01:27:13,454 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 47 [2019-11-20 01:27:13,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:27:13,462 INFO L225 Difference]: With dead ends: 1934 [2019-11-20 01:27:13,462 INFO L226 Difference]: Without dead ends: 1929 [2019-11-20 01:27:13,463 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 40 SyntacticMatches, 10 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2019-11-20 01:27:13,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1929 states. [2019-11-20 01:27:13,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1929 to 1612. [2019-11-20 01:27:13,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1612 states. [2019-11-20 01:27:13,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1612 states to 1612 states and 2052 transitions. [2019-11-20 01:27:13,752 INFO L78 Accepts]: Start accepts. Automaton has 1612 states and 2052 transitions. Word has length 47 [2019-11-20 01:27:13,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:27:13,752 INFO L462 AbstractCegarLoop]: Abstraction has 1612 states and 2052 transitions. [2019-11-20 01:27:13,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-20 01:27:13,753 INFO L276 IsEmpty]: Start isEmpty. Operand 1612 states and 2052 transitions. [2019-11-20 01:27:13,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-20 01:27:13,754 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:27:13,754 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:27:13,955 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:27:13,955 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:27:13,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:27:13,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1048777817, now seen corresponding path program 8 times [2019-11-20 01:27:13,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:27:13,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262636984] [2019-11-20 01:27:13,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:27:13,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:27:14,434 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-20 01:27:14,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262636984] [2019-11-20 01:27:14,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331256994] [2019-11-20 01:27:14,435 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fec8267c-a702-4f5a-8056-d3c4c3ce3269/bin/uautomizer/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:27:14,506 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 01:27:14,506 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 01:27:14,507 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 37 conjunts are in the unsatisfiable core [2019-11-20 01:27:14,508 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:27:14,636 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-20 01:27:14,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:27:14,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 17 [2019-11-20 01:27:14,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005185644] [2019-11-20 01:27:14,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-20 01:27:14,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:27:14,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-20 01:27:14,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2019-11-20 01:27:14,638 INFO L87 Difference]: Start difference. First operand 1612 states and 2052 transitions. Second operand 17 states. [2019-11-20 01:27:15,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:27:15,705 INFO L93 Difference]: Finished difference Result 2281 states and 2906 transitions. [2019-11-20 01:27:15,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-20 01:27:15,712 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 47 [2019-11-20 01:27:15,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:27:15,720 INFO L225 Difference]: With dead ends: 2281 [2019-11-20 01:27:15,721 INFO L226 Difference]: Without dead ends: 2276 [2019-11-20 01:27:15,721 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 40 SyntacticMatches, 10 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2019-11-20 01:27:15,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2276 states. [2019-11-20 01:27:16,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2276 to 1717. [2019-11-20 01:27:16,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1717 states. [2019-11-20 01:27:16,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1717 states to 1717 states and 2188 transitions. [2019-11-20 01:27:16,044 INFO L78 Accepts]: Start accepts. Automaton has 1717 states and 2188 transitions. Word has length 47 [2019-11-20 01:27:16,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:27:16,044 INFO L462 AbstractCegarLoop]: Abstraction has 1717 states and 2188 transitions. [2019-11-20 01:27:16,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-20 01:27:16,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1717 states and 2188 transitions. [2019-11-20 01:27:16,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-20 01:27:16,046 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:27:16,047 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:27:16,247 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:27:16,247 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:27:16,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:27:16,248 INFO L82 PathProgramCache]: Analyzing trace with hash -641724695, now seen corresponding path program 2 times [2019-11-20 01:27:16,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:27:16,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746639527] [2019-11-20 01:27:16,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:27:16,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:27:16,836 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-20 01:27:16,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746639527] [2019-11-20 01:27:16,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200137813] [2019-11-20 01:27:16,837 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fec8267c-a702-4f5a-8056-d3c4c3ce3269/bin/uautomizer/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:27:16,892 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 01:27:16,892 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 01:27:16,894 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 37 conjunts are in the unsatisfiable core [2019-11-20 01:27:16,895 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:27:16,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:27:16,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:27:17,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:27:17,224 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-20 01:27:17,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:27:17,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 22 [2019-11-20 01:27:17,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598295863] [2019-11-20 01:27:17,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-20 01:27:17,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:27:17,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-20 01:27:17,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2019-11-20 01:27:17,225 INFO L87 Difference]: Start difference. First operand 1717 states and 2188 transitions. Second operand 22 states. [2019-11-20 01:27:18,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:27:18,675 INFO L93 Difference]: Finished difference Result 2540 states and 3237 transitions. [2019-11-20 01:27:18,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-20 01:27:18,675 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 47 [2019-11-20 01:27:18,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:27:18,685 INFO L225 Difference]: With dead ends: 2540 [2019-11-20 01:27:18,685 INFO L226 Difference]: Without dead ends: 2535 [2019-11-20 01:27:18,686 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 39 SyntacticMatches, 6 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650 [2019-11-20 01:27:18,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2535 states. [2019-11-20 01:27:19,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2535 to 1848. [2019-11-20 01:27:19,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1848 states. [2019-11-20 01:27:19,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 2363 transitions. [2019-11-20 01:27:19,065 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 2363 transitions. Word has length 47 [2019-11-20 01:27:19,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:27:19,065 INFO L462 AbstractCegarLoop]: Abstraction has 1848 states and 2363 transitions. [2019-11-20 01:27:19,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-20 01:27:19,065 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2363 transitions. [2019-11-20 01:27:19,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-20 01:27:19,068 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:27:19,068 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:27:19,269 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:27:19,269 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:27:19,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:27:19,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1764575751, now seen corresponding path program 5 times [2019-11-20 01:27:19,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:27:19,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807498838] [2019-11-20 01:27:19,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:27:19,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:27:19,379 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-20 01:27:19,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807498838] [2019-11-20 01:27:19,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061979479] [2019-11-20 01:27:19,379 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fec8267c-a702-4f5a-8056-d3c4c3ce3269/bin/uautomizer/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:27:19,448 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-11-20 01:27:19,449 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 01:27:19,450 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-20 01:27:19,451 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:27:19,491 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-20 01:27:19,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:27:19,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2019-11-20 01:27:19,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660323823] [2019-11-20 01:27:19,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-20 01:27:19,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:27:19,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-20 01:27:19,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-11-20 01:27:19,492 INFO L87 Difference]: Start difference. First operand 1848 states and 2363 transitions. Second operand 14 states. [2019-11-20 01:27:20,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:27:20,069 INFO L93 Difference]: Finished difference Result 2187 states and 2789 transitions. [2019-11-20 01:27:20,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-20 01:27:20,069 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 49 [2019-11-20 01:27:20,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:27:20,080 INFO L225 Difference]: With dead ends: 2187 [2019-11-20 01:27:20,080 INFO L226 Difference]: Without dead ends: 1961 [2019-11-20 01:27:20,081 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=209, Invalid=603, Unknown=0, NotChecked=0, Total=812 [2019-11-20 01:27:20,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1961 states. [2019-11-20 01:27:20,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1961 to 1751. [2019-11-20 01:27:20,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1751 states. [2019-11-20 01:27:20,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1751 states to 1751 states and 2207 transitions. [2019-11-20 01:27:20,420 INFO L78 Accepts]: Start accepts. Automaton has 1751 states and 2207 transitions. Word has length 49 [2019-11-20 01:27:20,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:27:20,420 INFO L462 AbstractCegarLoop]: Abstraction has 1751 states and 2207 transitions. [2019-11-20 01:27:20,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-20 01:27:20,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1751 states and 2207 transitions. [2019-11-20 01:27:20,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-20 01:27:20,422 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:27:20,422 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:27:20,625 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:27:20,625 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:27:20,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:27:20,625 INFO L82 PathProgramCache]: Analyzing trace with hash -130172768, now seen corresponding path program 8 times [2019-11-20 01:27:20,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:27:20,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935114512] [2019-11-20 01:27:20,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:27:20,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:27:20,736 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 15 proven. 19 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-20 01:27:20,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935114512] [2019-11-20 01:27:20,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [943777134] [2019-11-20 01:27:20,736 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fec8267c-a702-4f5a-8056-d3c4c3ce3269/bin/uautomizer/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:27:20,803 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 01:27:20,803 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 01:27:20,804 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 01:27:20,805 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:27:20,883 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 22 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-20 01:27:20,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:27:20,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2019-11-20 01:27:20,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746535221] [2019-11-20 01:27:20,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-20 01:27:20,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:27:20,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-20 01:27:20,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2019-11-20 01:27:20,884 INFO L87 Difference]: Start difference. First operand 1751 states and 2207 transitions. Second operand 16 states. [2019-11-20 01:27:21,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:27:21,496 INFO L93 Difference]: Finished difference Result 2076 states and 2595 transitions. [2019-11-20 01:27:21,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-20 01:27:21,497 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 50 [2019-11-20 01:27:21,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:27:21,502 INFO L225 Difference]: With dead ends: 2076 [2019-11-20 01:27:21,503 INFO L226 Difference]: Without dead ends: 1585 [2019-11-20 01:27:21,504 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2019-11-20 01:27:21,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1585 states. [2019-11-20 01:27:21,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1585 to 1359. [2019-11-20 01:27:21,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1359 states. [2019-11-20 01:27:21,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1359 states to 1359 states and 1745 transitions. [2019-11-20 01:27:21,753 INFO L78 Accepts]: Start accepts. Automaton has 1359 states and 1745 transitions. Word has length 50 [2019-11-20 01:27:21,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:27:21,753 INFO L462 AbstractCegarLoop]: Abstraction has 1359 states and 1745 transitions. [2019-11-20 01:27:21,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-20 01:27:21,753 INFO L276 IsEmpty]: Start isEmpty. Operand 1359 states and 1745 transitions. [2019-11-20 01:27:21,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-20 01:27:21,755 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:27:21,755 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:27:21,955 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:27:21,955 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:27:21,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:27:21,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1265236080, now seen corresponding path program 9 times [2019-11-20 01:27:21,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:27:21,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626956261] [2019-11-20 01:27:21,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:27:21,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:27:22,076 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 5 proven. 29 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-20 01:27:22,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626956261] [2019-11-20 01:27:22,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937252113] [2019-11-20 01:27:22,076 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fec8267c-a702-4f5a-8056-d3c4c3ce3269/bin/uautomizer/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:27:22,158 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-11-20 01:27:22,158 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 01:27:22,159 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-20 01:27:22,160 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:27:22,207 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 12 proven. 14 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-20 01:27:22,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:27:22,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 15 [2019-11-20 01:27:22,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787676366] [2019-11-20 01:27:22,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-20 01:27:22,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:27:22,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-20 01:27:22,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2019-11-20 01:27:22,209 INFO L87 Difference]: Start difference. First operand 1359 states and 1745 transitions. Second operand 15 states. [2019-11-20 01:27:22,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:27:22,729 INFO L93 Difference]: Finished difference Result 1663 states and 2138 transitions. [2019-11-20 01:27:22,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-20 01:27:22,729 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 50 [2019-11-20 01:27:22,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:27:22,733 INFO L225 Difference]: With dead ends: 1663 [2019-11-20 01:27:22,733 INFO L226 Difference]: Without dead ends: 1270 [2019-11-20 01:27:22,734 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=462, Unknown=0, NotChecked=0, Total=600 [2019-11-20 01:27:22,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states. [2019-11-20 01:27:22,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 895. [2019-11-20 01:27:22,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2019-11-20 01:27:22,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1173 transitions. [2019-11-20 01:27:22,928 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1173 transitions. Word has length 50 [2019-11-20 01:27:22,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:27:22,928 INFO L462 AbstractCegarLoop]: Abstraction has 895 states and 1173 transitions. [2019-11-20 01:27:22,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-20 01:27:22,928 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1173 transitions. [2019-11-20 01:27:22,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-20 01:27:22,929 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:27:22,929 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:27:23,130 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:27:23,130 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:27:23,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:27:23,130 INFO L82 PathProgramCache]: Analyzing trace with hash 660306497, now seen corresponding path program 10 times [2019-11-20 01:27:23,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:27:23,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512797152] [2019-11-20 01:27:23,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:27:23,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:27:23,881 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-20 01:27:23,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512797152] [2019-11-20 01:27:23,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040780821] [2019-11-20 01:27:23,882 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fec8267c-a702-4f5a-8056-d3c4c3ce3269/bin/uautomizer/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:27:23,948 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-20 01:27:23,949 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 01:27:23,950 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 53 conjunts are in the unsatisfiable core [2019-11-20 01:27:23,952 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:27:24,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:27:24,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:27:24,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:27:24,393 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-20 01:27:24,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:27:24,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 27 [2019-11-20 01:27:24,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646714267] [2019-11-20 01:27:24,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-20 01:27:24,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:27:24,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-20 01:27:24,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=621, Unknown=0, NotChecked=0, Total=702 [2019-11-20 01:27:24,395 INFO L87 Difference]: Start difference. First operand 895 states and 1173 transitions. Second operand 27 states. [2019-11-20 01:27:26,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:27:26,042 INFO L93 Difference]: Finished difference Result 1424 states and 1843 transitions. [2019-11-20 01:27:26,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-20 01:27:26,043 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 58 [2019-11-20 01:27:26,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:27:26,045 INFO L225 Difference]: With dead ends: 1424 [2019-11-20 01:27:26,045 INFO L226 Difference]: Without dead ends: 1419 [2019-11-20 01:27:26,046 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 47 SyntacticMatches, 7 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=147, Invalid=1043, Unknown=0, NotChecked=0, Total=1190 [2019-11-20 01:27:26,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2019-11-20 01:27:26,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 987. [2019-11-20 01:27:26,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 987 states. [2019-11-20 01:27:26,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 987 states to 987 states and 1302 transitions. [2019-11-20 01:27:26,242 INFO L78 Accepts]: Start accepts. Automaton has 987 states and 1302 transitions. Word has length 58 [2019-11-20 01:27:26,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:27:26,242 INFO L462 AbstractCegarLoop]: Abstraction has 987 states and 1302 transitions. [2019-11-20 01:27:26,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-20 01:27:26,243 INFO L276 IsEmpty]: Start isEmpty. Operand 987 states and 1302 transitions. [2019-11-20 01:27:26,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-20 01:27:26,245 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:27:26,245 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:27:26,447 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:27:26,447 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:27:26,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:27:26,447 INFO L82 PathProgramCache]: Analyzing trace with hash 267279487, now seen corresponding path program 6 times [2019-11-20 01:27:26,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:27:26,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444138895] [2019-11-20 01:27:26,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:27:26,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:27:27,807 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 47 [2019-11-20 01:27:28,416 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 3 proven. 50 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-20 01:27:28,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444138895] [2019-11-20 01:27:28,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135745295] [2019-11-20 01:27:28,416 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fec8267c-a702-4f5a-8056-d3c4c3ce3269/bin/uautomizer/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:27:28,499 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-11-20 01:27:28,500 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 01:27:28,501 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 51 conjunts are in the unsatisfiable core [2019-11-20 01:27:28,503 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:27:28,827 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:27:28,828 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:27:28,829 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:27:28,830 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:27:28,831 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 38 [2019-11-20 01:27:28,831 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:27:28,840 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:27:28,840 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:27:28,840 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2019-11-20 01:27:28,946 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 01:27:28,947 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:27:28,948 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:27:28,949 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:27:28,951 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:27:28,952 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:27:28,953 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:27:28,954 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:27:28,954 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 57 [2019-11-20 01:27:28,955 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:27:28,973 INFO L567 ElimStorePlain]: treesize reduction 18, result has 67.9 percent of original size [2019-11-20 01:27:28,974 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:27:28,974 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:38 [2019-11-20 01:27:29,079 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:27:29,080 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:27:29,081 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:27:29,082 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:27:29,082 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 36 [2019-11-20 01:27:29,082 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:27:29,089 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:27:29,089 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:27:29,089 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:30 [2019-11-20 01:27:29,166 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:27:29,167 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 82 [2019-11-20 01:27:29,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:27:29,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:27:29,169 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:27:29,223 INFO L567 ElimStorePlain]: treesize reduction 40, result has 61.9 percent of original size [2019-11-20 01:27:29,223 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:27:29,223 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:54 [2019-11-20 01:27:29,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:27:29,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:27:29,469 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:27:29,471 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2019-11-20 01:27:29,473 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:27:29,477 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 01:27:29,479 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 01:27:29,480 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2019-11-20 01:27:29,480 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:27:29,487 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 01:27:29,489 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:27:29,490 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 27 treesize of output 20 [2019-11-20 01:27:29,490 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 01:27:29,517 INFO L567 ElimStorePlain]: treesize reduction 14, result has 57.6 percent of original size [2019-11-20 01:27:29,517 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-20 01:27:29,517 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:88, output treesize:19 [2019-11-20 01:27:29,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:27:29,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:27:29,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:27:29,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:27:29,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:27:29,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:27:29,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:27:29,683 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 10 proven. 43 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-20 01:27:29,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:27:29,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 21] total 43 [2019-11-20 01:27:29,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750739143] [2019-11-20 01:27:29,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-11-20 01:27:29,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:27:29,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-11-20 01:27:29,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1649, Unknown=0, NotChecked=0, Total=1806 [2019-11-20 01:27:29,685 INFO L87 Difference]: Start difference. First operand 987 states and 1302 transitions. Second operand 43 states. [2019-11-20 01:27:30,745 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 53 [2019-11-20 01:27:33,085 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2019-11-20 01:27:34,252 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 48 [2019-11-20 01:27:34,743 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-11-20 01:27:35,461 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 61 [2019-11-20 01:27:37,412 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 63 [2019-11-20 01:27:37,571 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 59 [2019-11-20 01:27:38,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:27:38,536 INFO L93 Difference]: Finished difference Result 3025 states and 4054 transitions. [2019-11-20 01:27:38,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-11-20 01:27:38,536 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 58 [2019-11-20 01:27:38,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:27:38,539 INFO L225 Difference]: With dead ends: 3025 [2019-11-20 01:27:38,540 INFO L226 Difference]: Without dead ends: 2508 [2019-11-20 01:27:38,541 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2974 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=1449, Invalid=9893, Unknown=0, NotChecked=0, Total=11342 [2019-11-20 01:27:38,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2508 states. [2019-11-20 01:27:39,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2508 to 1839. [2019-11-20 01:27:39,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1839 states. [2019-11-20 01:27:39,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1839 states to 1839 states and 2405 transitions. [2019-11-20 01:27:39,025 INFO L78 Accepts]: Start accepts. Automaton has 1839 states and 2405 transitions. Word has length 58 [2019-11-20 01:27:39,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:27:39,026 INFO L462 AbstractCegarLoop]: Abstraction has 1839 states and 2405 transitions. [2019-11-20 01:27:39,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-11-20 01:27:39,026 INFO L276 IsEmpty]: Start isEmpty. Operand 1839 states and 2405 transitions. [2019-11-20 01:27:39,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-20 01:27:39,028 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:27:39,028 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:27:39,231 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:27:39,231 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:27:39,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:27:39,232 INFO L82 PathProgramCache]: Analyzing trace with hash 73500483, now seen corresponding path program 7 times [2019-11-20 01:27:39,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:27:39,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633337684] [2019-11-20 01:27:39,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:27:39,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:27:39,548 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 24 [2019-11-20 01:27:39,685 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 38 [2019-11-20 01:27:39,823 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 34 [2019-11-20 01:27:40,880 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 4 proven. 49 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-20 01:27:40,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633337684] [2019-11-20 01:27:40,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [97712975] [2019-11-20 01:27:40,881 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fec8267c-a702-4f5a-8056-d3c4c3ce3269/bin/uautomizer/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:27:40,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:27:40,939 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 53 conjunts are in the unsatisfiable core [2019-11-20 01:27:40,940 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:27:41,292 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:27:41,293 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:27:41,294 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:27:41,295 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:27:41,296 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 38 [2019-11-20 01:27:41,296 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:27:41,308 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:27:41,308 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:27:41,308 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:41 [2019-11-20 01:27:41,415 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 01:27:41,416 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:27:41,417 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:27:41,419 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:27:41,421 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:27:41,422 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 01:27:41,424 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:27:41,424 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 60 [2019-11-20 01:27:41,425 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:27:41,448 INFO L567 ElimStorePlain]: treesize reduction 36, result has 55.0 percent of original size [2019-11-20 01:27:41,448 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:27:41,448 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:58, output treesize:44 [2019-11-20 01:27:41,565 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:27:41,568 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:27:41,570 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:27:41,571 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:27:41,573 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:27:41,589 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:27:41,589 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 80 [2019-11-20 01:27:41,590 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:27:41,629 INFO L567 ElimStorePlain]: treesize reduction 29, result has 69.5 percent of original size [2019-11-20 01:27:41,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:27:41,630 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:27:41,630 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:60, output treesize:66 [2019-11-20 01:27:41,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:27:44,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:27:48,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:27:51,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:27:51,799 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:27:51,802 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:27:51,804 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:27:51,805 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:27:51,806 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:27:51,807 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:27:51,860 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:27:51,861 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 145 [2019-11-20 01:27:51,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:27:51,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:27:51,862 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:27:51,867 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:27:51,868 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:27:51,883 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:27:51,883 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 74 [2019-11-20 01:27:51,884 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:27:51,974 INFO L567 ElimStorePlain]: treesize reduction 119, result has 52.6 percent of original size [2019-11-20 01:27:51,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:27:51,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:27:51,975 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-20 01:27:51,975 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:111, output treesize:44 [2019-11-20 01:27:52,067 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 01:27:52,069 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:27:52,069 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 19 treesize of output 12 [2019-11-20 01:27:52,069 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:27:52,073 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:27:52,073 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:27:52,073 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:9 [2019-11-20 01:27:52,116 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 25 proven. 41 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-20 01:27:52,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:27:52,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 21] total 44 [2019-11-20 01:27:52,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84279457] [2019-11-20 01:27:52,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-11-20 01:27:52,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:27:52,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-11-20 01:27:52,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=1647, Unknown=2, NotChecked=0, Total=1892 [2019-11-20 01:27:52,118 INFO L87 Difference]: Start difference. First operand 1839 states and 2405 transitions. Second operand 44 states. [2019-11-20 01:28:05,971 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 59 [2019-11-20 01:28:08,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:28:08,482 INFO L93 Difference]: Finished difference Result 3827 states and 5005 transitions. [2019-11-20 01:28:08,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-11-20 01:28:08,482 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 58 [2019-11-20 01:28:08,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:28:08,487 INFO L225 Difference]: With dead ends: 3827 [2019-11-20 01:28:08,487 INFO L226 Difference]: Without dead ends: 3548 [2019-11-20 01:28:08,489 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 39 SyntacticMatches, 5 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3029 ImplicationChecksByTransitivity, 23.9s TimeCoverageRelationStatistics Valid=1599, Invalid=8495, Unknown=6, NotChecked=0, Total=10100 [2019-11-20 01:28:08,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3548 states. [2019-11-20 01:28:09,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3548 to 2612. [2019-11-20 01:28:09,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2612 states. [2019-11-20 01:28:09,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2612 states to 2612 states and 3389 transitions. [2019-11-20 01:28:09,169 INFO L78 Accepts]: Start accepts. Automaton has 2612 states and 3389 transitions. Word has length 58 [2019-11-20 01:28:09,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:28:09,170 INFO L462 AbstractCegarLoop]: Abstraction has 2612 states and 3389 transitions. [2019-11-20 01:28:09,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-11-20 01:28:09,170 INFO L276 IsEmpty]: Start isEmpty. Operand 2612 states and 3389 transitions. [2019-11-20 01:28:09,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-20 01:28:09,172 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:28:09,172 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:28:09,373 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:28:09,373 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:28:09,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:28:09,373 INFO L82 PathProgramCache]: Analyzing trace with hash -360761857, now seen corresponding path program 8 times [2019-11-20 01:28:09,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:28:09,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480707392] [2019-11-20 01:28:09,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:28:09,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:28:09,806 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 41 [2019-11-20 01:28:10,705 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 5 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:28:10,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480707392] [2019-11-20 01:28:10,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370718615] [2019-11-20 01:28:10,706 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fec8267c-a702-4f5a-8056-d3c4c3ce3269/bin/uautomizer/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:28:10,756 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 01:28:10,756 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 01:28:10,757 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 41 conjunts are in the unsatisfiable core [2019-11-20 01:28:10,759 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:28:10,784 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:28:10,784 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2019-11-20 01:28:10,785 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:28:10,793 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:28:10,794 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:28:10,794 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:16 [2019-11-20 01:28:10,947 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:28:10,948 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:28:10,948 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 01:28:10,950 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:28:10,950 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 41 [2019-11-20 01:28:10,950 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:28:10,969 INFO L567 ElimStorePlain]: treesize reduction 20, result has 66.7 percent of original size [2019-11-20 01:28:10,970 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:28:10,970 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:40 [2019-11-20 01:28:11,046 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:28:11,047 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:28:11,048 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:28:11,048 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:28:11,049 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:28:11,058 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:28:11,059 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 47 treesize of output 78 [2019-11-20 01:28:11,059 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:28:11,086 INFO L567 ElimStorePlain]: treesize reduction 28, result has 68.9 percent of original size [2019-11-20 01:28:11,086 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:28:11,086 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:62 [2019-11-20 01:28:11,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:28:11,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:28:11,231 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:28:11,233 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:28:11,234 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:28:11,236 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:28:11,237 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:28:11,239 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:28:11,243 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:28:11,244 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:28:11,246 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:28:11,268 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:28:11,268 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 96 [2019-11-20 01:28:11,268 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:28:11,274 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:28:11,275 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:28:11,277 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:28:11,278 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:28:11,279 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:28:11,280 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:28:11,281 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:28:11,282 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:28:11,283 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:28:11,285 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:28:11,287 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:28:11,288 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:28:11,289 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:28:11,304 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:28:11,305 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 81 treesize of output 141 [2019-11-20 01:28:11,305 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:28:11,391 INFO L567 ElimStorePlain]: treesize reduction 91, result has 63.3 percent of original size [2019-11-20 01:28:11,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:28:11,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:28:11,392 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-11-20 01:28:11,392 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:140, output treesize:157 [2019-11-20 01:28:11,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:28:11,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:28:19,287 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 63 [2019-11-20 01:28:19,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:28:19,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:28:57,565 WARN L191 SmtUtils]: Spent 28.08 s on a formula simplification that was a NOOP. DAG size: 66 [2019-11-20 01:29:06,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 01:29:06,987 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:29:06,989 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:29:06,991 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:29:06,995 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:29:06,997 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:29:07,003 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:29:07,006 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:29:07,007 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:29:07,019 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:29:07,021 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:29:07,046 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:29:07,054 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:29:07,065 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:29:07,069 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:29:07,159 INFO L237 Elim1Store]: Index analysis took 173 ms [2019-11-20 01:29:07,271 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:29:07,271 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 98 treesize of output 327 [2019-11-20 01:29:07,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:07,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:07,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:07,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:07,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:07,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:07,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:07,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:07,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:07,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:07,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:07,277 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:29:07,301 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:29:07,303 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:29:07,306 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:29:07,308 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:29:07,354 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:29:07,354 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 119 [2019-11-20 01:29:07,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:07,355 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:29:07,365 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:29:07,366 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:29:07,368 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:29:07,374 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:29:07,375 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:29:07,378 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:29:07,382 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:29:07,452 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:29:07,453 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 190 [2019-11-20 01:29:07,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:07,454 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 01:29:07,463 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:29:07,464 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:29:07,465 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:29:07,468 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:29:07,469 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:29:07,470 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:29:07,473 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:29:07,474 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:29:07,477 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:29:07,479 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:29:07,544 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:29:07,544 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 73 treesize of output 241 [2019-11-20 01:29:07,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:07,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:07,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:07,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:07,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:07,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:07,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:07,547 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 01:29:08,022 WARN L191 SmtUtils]: Spent 473.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 113 [2019-11-20 01:29:08,022 INFO L567 ElimStorePlain]: treesize reduction 810, result has 44.3 percent of original size [2019-11-20 01:29:08,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:08,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:29:08,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:29:08,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:29:08,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:08,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:08,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:08,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:08,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:08,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:08,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:29:08,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:08,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:08,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:08,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:08,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:08,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:08,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:08,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:08,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:08,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:08,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:08,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:08,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:08,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:08,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:08,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:08,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:08,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:08,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:08,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:08,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:08,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:08,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:08,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:08,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:08,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:08,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:08,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:08,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:08,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:08,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:08,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:08,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:08,075 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 4 xjuncts. [2019-11-20 01:29:08,076 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:296, output treesize:494 [2019-11-20 01:29:08,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:08,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:08,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:08,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:08,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:08,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:08,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:08,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:08,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:08,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:08,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:08,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:08,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:08,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:08,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:08,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:08,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:08,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:08,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:08,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:08,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:08,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:08,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:08,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:08,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:08,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:08,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:08,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:08,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:08,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:08,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:08,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:08,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:08,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:29:08,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:29:15,902 WARN L191 SmtUtils]: Spent 7.62 s on a formula simplification. DAG size of input: 113 DAG size of output: 13 [2019-11-20 01:29:15,906 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-11-20 01:29:15,906 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:29:15,908 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:29:15,909 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:29:15,909 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2019-11-20 01:29:15,942 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-11-20 01:29:15,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:29:15,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 16] total 42 [2019-11-20 01:29:15,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790544141] [2019-11-20 01:29:15,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-11-20 01:29:15,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:29:15,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-11-20 01:29:15,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1544, Unknown=9, NotChecked=0, Total=1722 [2019-11-20 01:29:15,944 INFO L87 Difference]: Start difference. First operand 2612 states and 3389 transitions. Second operand 42 states. [2019-11-20 01:30:01,078 WARN L191 SmtUtils]: Spent 3.55 s on a formula simplification. DAG size of input: 78 DAG size of output: 72 [2019-11-20 01:30:02,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:30:02,741 INFO L93 Difference]: Finished difference Result 3940 states and 5090 transitions. [2019-11-20 01:30:02,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-11-20 01:30:02,741 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 58 [2019-11-20 01:30:02,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:30:02,748 INFO L225 Difference]: With dead ends: 3940 [2019-11-20 01:30:02,749 INFO L226 Difference]: Without dead ends: 3787 [2019-11-20 01:30:02,750 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 45 SyntacticMatches, 5 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1900 ImplicationChecksByTransitivity, 93.3s TimeCoverageRelationStatistics Valid=959, Invalid=5992, Unknown=21, NotChecked=0, Total=6972 [2019-11-20 01:30:02,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3787 states. [2019-11-20 01:30:03,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3787 to 3044. [2019-11-20 01:30:03,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3044 states. [2019-11-20 01:30:03,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3044 states to 3044 states and 3902 transitions. [2019-11-20 01:30:03,721 INFO L78 Accepts]: Start accepts. Automaton has 3044 states and 3902 transitions. Word has length 58 [2019-11-20 01:30:03,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:30:03,721 INFO L462 AbstractCegarLoop]: Abstraction has 3044 states and 3902 transitions. [2019-11-20 01:30:03,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-11-20 01:30:03,721 INFO L276 IsEmpty]: Start isEmpty. Operand 3044 states and 3902 transitions. [2019-11-20 01:30:03,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-20 01:30:03,724 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:30:03,725 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:30:03,925 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:30:03,925 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:30:03,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:30:03,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1576425089, now seen corresponding path program 2 times [2019-11-20 01:30:03,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:30:03,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714767370] [2019-11-20 01:30:03,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:30:03,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:30:06,267 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 5 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:30:06,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714767370] [2019-11-20 01:30:06,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762231522] [2019-11-20 01:30:06,268 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fec8267c-a702-4f5a-8056-d3c4c3ce3269/bin/uautomizer/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:30:06,322 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 01:30:06,322 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 01:30:06,324 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 62 conjunts are in the unsatisfiable core [2019-11-20 01:30:06,325 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:30:06,861 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:30:06,862 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:30:06,865 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:30:06,866 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:30:06,866 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 39 [2019-11-20 01:30:06,867 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:30:06,877 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:30:06,877 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:30:06,877 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:42 [2019-11-20 01:30:07,005 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 01:30:07,006 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:30:07,007 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:30:07,008 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:30:07,009 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:30:07,010 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:30:07,011 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:30:07,014 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:30:07,014 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 58 [2019-11-20 01:30:07,015 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:30:07,035 INFO L567 ElimStorePlain]: treesize reduction 17, result has 70.2 percent of original size [2019-11-20 01:30:07,036 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:30:07,036 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:59, output treesize:40 [2019-11-20 01:30:07,170 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:30:07,171 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:30:07,172 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:30:07,173 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:30:07,174 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 37 [2019-11-20 01:30:07,174 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:30:07,182 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:30:07,183 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:30:07,183 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:53, output treesize:34 [2019-11-20 01:30:07,248 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:30:07,262 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:30:07,262 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 59 [2019-11-20 01:30:07,263 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:30:07,296 INFO L567 ElimStorePlain]: treesize reduction 16, result has 75.8 percent of original size [2019-11-20 01:30:07,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:30:07,297 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 01:30:07,298 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:17 [2019-11-20 01:30:07,469 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 18 treesize of output 10 [2019-11-20 01:30:07,469 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:30:07,471 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:30:07,471 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:30:07,471 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:6 [2019-11-20 01:30:07,535 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 13 proven. 60 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 01:30:07,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:30:07,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 23] total 51 [2019-11-20 01:30:07,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542878149] [2019-11-20 01:30:07,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-11-20 01:30:07,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:30:07,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-11-20 01:30:07,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=294, Invalid=2256, Unknown=0, NotChecked=0, Total=2550 [2019-11-20 01:30:07,537 INFO L87 Difference]: Start difference. First operand 3044 states and 3902 transitions. Second operand 51 states. [2019-11-20 01:30:12,998 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 55 [2019-11-20 01:30:13,835 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 91 [2019-11-20 01:30:15,447 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 78 [2019-11-20 01:30:15,836 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2019-11-20 01:30:16,604 WARN L191 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 102 [2019-11-20 01:30:16,871 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 88 [2019-11-20 01:30:17,927 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 86 [2019-11-20 01:30:18,225 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 91 [2019-11-20 01:30:18,484 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 79 [2019-11-20 01:30:18,684 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 79 [2019-11-20 01:30:19,039 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 90 [2019-11-20 01:30:19,406 WARN L191 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 104 [2019-11-20 01:30:19,709 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 75 [2019-11-20 01:30:20,243 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 96 [2019-11-20 01:30:20,730 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 79 [2019-11-20 01:30:20,932 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 83 [2019-11-20 01:30:21,205 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 76 [2019-11-20 01:30:21,578 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 91 [2019-11-20 01:30:24,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:30:24,188 INFO L93 Difference]: Finished difference Result 6352 states and 8126 transitions. [2019-11-20 01:30:24,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-11-20 01:30:24,189 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 58 [2019-11-20 01:30:24,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:30:24,198 INFO L225 Difference]: With dead ends: 6352 [2019-11-20 01:30:24,199 INFO L226 Difference]: Without dead ends: 5162 [2019-11-20 01:30:24,202 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6672 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=2833, Invalid=19219, Unknown=0, NotChecked=0, Total=22052 [2019-11-20 01:30:24,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5162 states. [2019-11-20 01:30:25,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5162 to 3578. [2019-11-20 01:30:25,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3578 states. [2019-11-20 01:30:25,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3578 states to 3578 states and 4506 transitions. [2019-11-20 01:30:25,353 INFO L78 Accepts]: Start accepts. Automaton has 3578 states and 4506 transitions. Word has length 58 [2019-11-20 01:30:25,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:30:25,354 INFO L462 AbstractCegarLoop]: Abstraction has 3578 states and 4506 transitions. [2019-11-20 01:30:25,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-11-20 01:30:25,354 INFO L276 IsEmpty]: Start isEmpty. Operand 3578 states and 4506 transitions. [2019-11-20 01:30:25,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-20 01:30:25,357 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:30:25,358 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:30:25,558 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:30:25,558 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:30:25,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:30:25,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1183398079, now seen corresponding path program 9 times [2019-11-20 01:30:25,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:30:25,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240500756] [2019-11-20 01:30:25,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:30:25,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:30:26,366 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-20 01:30:26,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240500756] [2019-11-20 01:30:26,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349446087] [2019-11-20 01:30:26,367 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fec8267c-a702-4f5a-8056-d3c4c3ce3269/bin/uautomizer/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:30:26,476 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-11-20 01:30:26,476 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 01:30:26,478 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 44 conjunts are in the unsatisfiable core [2019-11-20 01:30:26,480 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:30:26,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:30:26,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:30:26,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:30:26,796 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-20 01:30:26,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:30:26,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 21 [2019-11-20 01:30:26,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001056050] [2019-11-20 01:30:26,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-20 01:30:26,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:30:26,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-20 01:30:26,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2019-11-20 01:30:26,798 INFO L87 Difference]: Start difference. First operand 3578 states and 4506 transitions. Second operand 21 states. [2019-11-20 01:30:29,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:30:29,678 INFO L93 Difference]: Finished difference Result 5360 states and 6720 transitions. [2019-11-20 01:30:29,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-20 01:30:29,679 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 58 [2019-11-20 01:30:29,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:30:29,682 INFO L225 Difference]: With dead ends: 5360 [2019-11-20 01:30:29,682 INFO L226 Difference]: Without dead ends: 5355 [2019-11-20 01:30:29,683 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 51 SyntacticMatches, 9 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650 [2019-11-20 01:30:29,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5355 states. [2019-11-20 01:30:30,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5355 to 3775. [2019-11-20 01:30:30,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3775 states. [2019-11-20 01:30:30,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3775 states to 3775 states and 4758 transitions. [2019-11-20 01:30:30,839 INFO L78 Accepts]: Start accepts. Automaton has 3775 states and 4758 transitions. Word has length 58 [2019-11-20 01:30:30,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:30:30,839 INFO L462 AbstractCegarLoop]: Abstraction has 3775 states and 4758 transitions. [2019-11-20 01:30:30,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-20 01:30:30,840 INFO L276 IsEmpty]: Start isEmpty. Operand 3775 states and 4758 transitions. [2019-11-20 01:30:30,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-20 01:30:30,844 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:30:30,844 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:30:31,044 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:30:31,045 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:30:31,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:30:31,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1695498753, now seen corresponding path program 5 times [2019-11-20 01:30:31,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:30:31,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706667838] [2019-11-20 01:30:31,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:30:31,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:30:31,816 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 3 proven. 41 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-11-20 01:30:31,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706667838] [2019-11-20 01:30:31,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1086482670] [2019-11-20 01:30:31,817 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fec8267c-a702-4f5a-8056-d3c4c3ce3269/bin/uautomizer/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:30:31,885 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-11-20 01:30:31,885 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 01:30:31,886 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 40 conjunts are in the unsatisfiable core [2019-11-20 01:30:31,887 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:30:32,013 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:30:32,013 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2019-11-20 01:30:32,014 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:30:32,022 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:30:32,022 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:30:32,022 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:17 [2019-11-20 01:30:32,115 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 18 treesize of output 10 [2019-11-20 01:30:32,115 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:30:32,117 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:30:32,117 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:30:32,117 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:6 [2019-11-20 01:30:32,149 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 13 proven. 27 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-20 01:30:32,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:30:32,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11] total 25 [2019-11-20 01:30:32,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925514287] [2019-11-20 01:30:32,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-20 01:30:32,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:30:32,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-20 01:30:32,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=522, Unknown=0, NotChecked=0, Total=600 [2019-11-20 01:30:32,151 INFO L87 Difference]: Start difference. First operand 3775 states and 4758 transitions. Second operand 25 states. [2019-11-20 01:30:36,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:30:36,570 INFO L93 Difference]: Finished difference Result 5892 states and 7393 transitions. [2019-11-20 01:30:36,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-11-20 01:30:36,570 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 58 [2019-11-20 01:30:36,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:30:36,573 INFO L225 Difference]: With dead ends: 5892 [2019-11-20 01:30:36,573 INFO L226 Difference]: Without dead ends: 4900 [2019-11-20 01:30:36,575 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 798 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=530, Invalid=3010, Unknown=0, NotChecked=0, Total=3540 [2019-11-20 01:30:36,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4900 states. [2019-11-20 01:30:37,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4900 to 4106. [2019-11-20 01:30:37,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4106 states. [2019-11-20 01:30:37,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4106 states to 4106 states and 5127 transitions. [2019-11-20 01:30:37,714 INFO L78 Accepts]: Start accepts. Automaton has 4106 states and 5127 transitions. Word has length 58 [2019-11-20 01:30:37,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:30:37,714 INFO L462 AbstractCegarLoop]: Abstraction has 4106 states and 5127 transitions. [2019-11-20 01:30:37,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-20 01:30:37,714 INFO L276 IsEmpty]: Start isEmpty. Operand 4106 states and 5127 transitions. [2019-11-20 01:30:37,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-20 01:30:37,719 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:30:37,719 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:30:37,919 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:30:37,919 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:30:37,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:30:37,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1767885311, now seen corresponding path program 3 times [2019-11-20 01:30:37,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:30:37,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20513140] [2019-11-20 01:30:37,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:30:37,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:30:38,254 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 24 [2019-11-20 01:30:39,568 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 5 proven. 48 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-20 01:30:39,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20513140] [2019-11-20 01:30:39,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459020525] [2019-11-20 01:30:39,568 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fec8267c-a702-4f5a-8056-d3c4c3ce3269/bin/uautomizer/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:30:39,640 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-11-20 01:30:39,641 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 01:30:39,642 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 47 conjunts are in the unsatisfiable core [2019-11-20 01:30:39,643 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:30:39,814 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:30:39,817 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:30:39,818 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:30:39,819 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:30:39,819 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 32 [2019-11-20 01:30:39,819 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:30:39,826 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:30:39,826 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:30:39,826 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:16 [2019-11-20 01:30:39,865 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:30:39,866 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:30:39,867 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:30:39,868 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:30:39,868 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 39 [2019-11-20 01:30:39,869 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:30:39,876 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:30:39,877 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:30:39,877 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:39 [2019-11-20 01:30:39,967 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:30:39,968 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:30:39,969 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:30:39,970 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:30:39,970 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 01:30:39,972 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:30:39,972 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 57 treesize of output 57 [2019-11-20 01:30:39,973 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:30:39,989 INFO L567 ElimStorePlain]: treesize reduction 17, result has 69.6 percent of original size [2019-11-20 01:30:39,989 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:30:39,989 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:63, output treesize:39 [2019-11-20 01:30:40,092 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:30:40,093 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:30:40,094 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:30:40,095 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:30:40,095 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 37 [2019-11-20 01:30:40,096 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:30:40,103 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:30:40,104 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:30:40,104 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:53, output treesize:34 [2019-11-20 01:30:40,156 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:30:40,157 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:30:40,168 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:30:40,169 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 66 [2019-11-20 01:30:40,169 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:30:40,199 INFO L567 ElimStorePlain]: treesize reduction 16, result has 75.8 percent of original size [2019-11-20 01:30:40,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:30:40,200 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 01:30:40,200 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:17 [2019-11-20 01:30:40,294 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 18 treesize of output 10 [2019-11-20 01:30:40,294 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:30:40,296 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:30:40,296 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:30:40,296 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:6 [2019-11-20 01:30:40,344 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 13 proven. 31 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-11-20 01:30:40,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:30:40,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 16] total 39 [2019-11-20 01:30:40,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946645010] [2019-11-20 01:30:40,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-11-20 01:30:40,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:30:40,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-11-20 01:30:40,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1347, Unknown=0, NotChecked=0, Total=1482 [2019-11-20 01:30:40,346 INFO L87 Difference]: Start difference. First operand 4106 states and 5127 transitions. Second operand 39 states. [2019-11-20 01:30:43,624 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 33 [2019-11-20 01:30:44,773 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 40 [2019-11-20 01:30:45,600 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-11-20 01:30:46,047 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-11-20 01:30:46,316 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2019-11-20 01:30:46,636 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 66 [2019-11-20 01:30:50,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:30:50,602 INFO L93 Difference]: Finished difference Result 6108 states and 7674 transitions. [2019-11-20 01:30:50,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-11-20 01:30:50,602 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 58 [2019-11-20 01:30:50,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:30:50,607 INFO L225 Difference]: With dead ends: 6108 [2019-11-20 01:30:50,607 INFO L226 Difference]: Without dead ends: 5816 [2019-11-20 01:30:50,609 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2921 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=1314, Invalid=8786, Unknown=0, NotChecked=0, Total=10100 [2019-11-20 01:30:50,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5816 states. [2019-11-20 01:30:51,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5816 to 4296. [2019-11-20 01:30:51,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4296 states. [2019-11-20 01:30:51,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4296 states to 4296 states and 5354 transitions. [2019-11-20 01:30:51,846 INFO L78 Accepts]: Start accepts. Automaton has 4296 states and 5354 transitions. Word has length 58 [2019-11-20 01:30:51,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:30:51,846 INFO L462 AbstractCegarLoop]: Abstraction has 4296 states and 5354 transitions. [2019-11-20 01:30:51,846 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-11-20 01:30:51,846 INFO L276 IsEmpty]: Start isEmpty. Operand 4296 states and 5354 transitions. [2019-11-20 01:30:51,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-20 01:30:51,850 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:30:51,851 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:30:52,051 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:30:52,051 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:30:52,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:30:52,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1831599743, now seen corresponding path program 10 times [2019-11-20 01:30:52,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:30:52,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782031880] [2019-11-20 01:30:52,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:30:52,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:30:52,569 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-20 01:30:52,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782031880] [2019-11-20 01:30:52,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [229931045] [2019-11-20 01:30:52,570 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fec8267c-a702-4f5a-8056-d3c4c3ce3269/bin/uautomizer/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:30:52,655 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-20 01:30:52,655 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 01:30:52,657 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 43 conjunts are in the unsatisfiable core [2019-11-20 01:30:52,658 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:30:52,819 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-20 01:30:52,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:30:52,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 18 [2019-11-20 01:30:52,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675117152] [2019-11-20 01:30:52,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-20 01:30:52,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:30:52,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-20 01:30:52,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2019-11-20 01:30:52,821 INFO L87 Difference]: Start difference. First operand 4296 states and 5354 transitions. Second operand 18 states. [2019-11-20 01:30:55,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:30:55,032 INFO L93 Difference]: Finished difference Result 5435 states and 6791 transitions. [2019-11-20 01:30:55,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-20 01:30:55,032 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 58 [2019-11-20 01:30:55,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:30:55,035 INFO L225 Difference]: With dead ends: 5435 [2019-11-20 01:30:55,036 INFO L226 Difference]: Without dead ends: 5430 [2019-11-20 01:30:55,036 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 48 SyntacticMatches, 15 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2019-11-20 01:30:55,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5430 states. [2019-11-20 01:30:56,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5430 to 4429. [2019-11-20 01:30:56,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4429 states. [2019-11-20 01:30:56,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4429 states to 4429 states and 5518 transitions. [2019-11-20 01:30:56,360 INFO L78 Accepts]: Start accepts. Automaton has 4429 states and 5518 transitions. Word has length 58 [2019-11-20 01:30:56,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:30:56,360 INFO L462 AbstractCegarLoop]: Abstraction has 4429 states and 5518 transitions. [2019-11-20 01:30:56,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-20 01:30:56,361 INFO L276 IsEmpty]: Start isEmpty. Operand 4429 states and 5518 transitions. [2019-11-20 01:30:56,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-20 01:30:56,365 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:30:56,366 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:30:56,566 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:30:56,566 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:30:56,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:30:56,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1081320517, now seen corresponding path program 4 times [2019-11-20 01:30:56,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:30:56,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830493176] [2019-11-20 01:30:56,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:30:56,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:30:57,550 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-11-20 01:30:57,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830493176] [2019-11-20 01:30:57,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058903565] [2019-11-20 01:30:57,550 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fec8267c-a702-4f5a-8056-d3c4c3ce3269/bin/uautomizer/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:30:57,628 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-20 01:30:57,629 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 01:30:57,630 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 55 conjunts are in the unsatisfiable core [2019-11-20 01:30:57,632 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:31:06,308 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 01:31:06,310 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:31:06,310 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 23 treesize of output 13 [2019-11-20 01:31:06,310 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:31:06,319 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:31:06,319 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:31:06,320 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:16 [2019-11-20 01:31:06,370 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-11-20 01:31:06,371 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:31:06,382 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:31:06,382 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:31:06,382 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:27 [2019-11-20 01:31:06,601 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 01:31:06,603 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:31:06,603 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 22 treesize of output 13 [2019-11-20 01:31:06,603 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:31:06,608 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:31:06,609 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 01:31:06,609 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:6 [2019-11-20 01:31:06,661 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 7 proven. 59 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-20 01:31:06,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:31:06,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23] total 41 [2019-11-20 01:31:06,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415604599] [2019-11-20 01:31:06,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-11-20 01:31:06,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:31:06,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-11-20 01:31:06,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1476, Unknown=4, NotChecked=0, Total=1640 [2019-11-20 01:31:06,663 INFO L87 Difference]: Start difference. First operand 4429 states and 5518 transitions. Second operand 41 states. [2019-11-20 01:31:11,123 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 54 [2019-11-20 01:31:11,536 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 53 [2019-11-20 01:31:12,353 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 58 [2019-11-20 01:31:12,691 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 57 [2019-11-20 01:31:16,841 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 62 [2019-11-20 01:31:17,902 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 57 [2019-11-20 01:31:23,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:31:23,289 INFO L93 Difference]: Finished difference Result 6114 states and 7635 transitions. [2019-11-20 01:31:23,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2019-11-20 01:31:23,289 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 58 [2019-11-20 01:31:23,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:31:23,293 INFO L225 Difference]: With dead ends: 6114 [2019-11-20 01:31:23,293 INFO L226 Difference]: Without dead ends: 6093 [2019-11-20 01:31:23,294 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7418 ImplicationChecksByTransitivity, 20.4s TimeCoverageRelationStatistics Valid=2907, Invalid=20041, Unknown=4, NotChecked=0, Total=22952 [2019-11-20 01:31:23,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6093 states. [2019-11-20 01:31:24,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6093 to 4681. [2019-11-20 01:31:24,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4681 states. [2019-11-20 01:31:24,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4681 states to 4681 states and 5828 transitions. [2019-11-20 01:31:24,766 INFO L78 Accepts]: Start accepts. Automaton has 4681 states and 5828 transitions. Word has length 58 [2019-11-20 01:31:24,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:31:24,766 INFO L462 AbstractCegarLoop]: Abstraction has 4681 states and 5828 transitions. [2019-11-20 01:31:24,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-11-20 01:31:24,766 INFO L276 IsEmpty]: Start isEmpty. Operand 4681 states and 5828 transitions. [2019-11-20 01:31:24,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-20 01:31:24,771 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:31:24,772 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:31:24,972 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:31:24,972 INFO L410 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:31:24,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:31:24,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1438639417, now seen corresponding path program 11 times [2019-11-20 01:31:24,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:31:24,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376764953] [2019-11-20 01:31:24,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:31:24,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:31:25,717 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-20 01:31:25,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376764953] [2019-11-20 01:31:25,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481172038] [2019-11-20 01:31:25,718 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fec8267c-a702-4f5a-8056-d3c4c3ce3269/bin/uautomizer/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:31:25,868 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-11-20 01:31:25,868 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 01:31:25,870 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 55 conjunts are in the unsatisfiable core [2019-11-20 01:31:25,872 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:31:26,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:32:22,305 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-11-20 01:32:22,306 FATAL L310 FreeRefinementEngine]: Exception during interpolant generation: SMTLIBException [2019-11-20 01:32:22,506 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:32:22,507 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:153) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:140) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:934) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:773) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:576) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:201) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1461) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:654) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 42 more [2019-11-20 01:32:22,511 INFO L168 Benchmark]: Toolchain (without parser) took 428038.03 ms. Allocated memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: 1.0 GB). Free memory was 950.1 MB in the beginning and 1.5 GB in the end (delta: -592.8 MB). Peak memory consumption was 445.3 MB. Max. memory is 11.5 GB. [2019-11-20 01:32:22,511 INFO L168 Benchmark]: CDTParser took 0.25 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 01:32:22,512 INFO L168 Benchmark]: CACSL2BoogieTranslator took 345.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.2 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -166.9 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-11-20 01:32:22,512 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.97 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 01:32:22,512 INFO L168 Benchmark]: Boogie Preprocessor took 57.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-20 01:32:22,512 INFO L168 Benchmark]: RCFGBuilder took 501.23 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: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-11-20 01:32:22,513 INFO L168 Benchmark]: TraceAbstraction took 427081.23 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 915.9 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -455.0 MB). Peak memory consumption was 460.9 MB. Max. memory is 11.5 GB. [2019-11-20 01:32:22,514 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 345.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.2 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -166.9 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 44.97 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 57.83 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. * RCFGBuilder took 501.23 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: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 427081.23 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 915.9 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -455.0 MB). Peak memory consumption was 460.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-678e011 [2019-11-20 01:32:24,371 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 01:32:24,373 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 01:32:24,385 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 01:32:24,387 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 01:32:24,389 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 01:32:24,391 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 01:32:24,402 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 01:32:24,404 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 01:32:24,407 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 01:32:24,408 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 01:32:24,410 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 01:32:24,411 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 01:32:24,414 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 01:32:24,415 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 01:32:24,418 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 01:32:24,420 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 01:32:24,422 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 01:32:24,425 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 01:32:24,429 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 01:32:24,433 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 01:32:24,436 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 01:32:24,439 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 01:32:24,440 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 01:32:24,444 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 01:32:24,444 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 01:32:24,445 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 01:32:24,447 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 01:32:24,447 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 01:32:24,450 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 01:32:24,451 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 01:32:24,451 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 01:32:24,452 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 01:32:24,453 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 01:32:24,455 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 01:32:24,455 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 01:32:24,456 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 01:32:24,456 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 01:32:24,457 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 01:32:24,458 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 01:32:24,459 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 01:32:24,460 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_fec8267c-a702-4f5a-8056-d3c4c3ce3269/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-20 01:32:24,496 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 01:32:24,496 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 01:32:24,497 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 01:32:24,497 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 01:32:24,498 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 01:32:24,498 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 01:32:24,498 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 01:32:24,499 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 01:32:24,499 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 01:32:24,499 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 01:32:24,499 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 01:32:24,500 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 01:32:24,500 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-20 01:32:24,500 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-20 01:32:24,501 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 01:32:24,501 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 01:32:24,501 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 01:32:24,501 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 01:32:24,502 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 01:32:24,502 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 01:32:24,502 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 01:32:24,503 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 01:32:24,503 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 01:32:24,503 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 01:32:24,503 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 01:32:24,504 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 01:32:24,504 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-20 01:32:24,504 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-20 01:32:24,504 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 01:32:24,505 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 01:32:24,505 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_fec8267c-a702-4f5a-8056-d3c4c3ce3269/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 -> e150e83dea41703782a488455769a24bf6c8f600 [2019-11-20 01:32:24,869 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 01:32:24,890 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 01:32:24,893 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 01:32:24,896 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 01:32:24,897 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 01:32:24,898 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_fec8267c-a702-4f5a-8056-d3c4c3ce3269/bin/uautomizer/../../sv-benchmarks/c/reducercommutativity/sep.i [2019-11-20 01:32:24,966 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fec8267c-a702-4f5a-8056-d3c4c3ce3269/bin/uautomizer/data/b68aa7fac/faa68316f5ef472aad3d1edc9978973f/FLAGf3cd9a924 [2019-11-20 01:32:25,363 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 01:32:25,364 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_fec8267c-a702-4f5a-8056-d3c4c3ce3269/sv-benchmarks/c/reducercommutativity/sep.i [2019-11-20 01:32:25,371 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fec8267c-a702-4f5a-8056-d3c4c3ce3269/bin/uautomizer/data/b68aa7fac/faa68316f5ef472aad3d1edc9978973f/FLAGf3cd9a924 [2019-11-20 01:32:25,755 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_fec8267c-a702-4f5a-8056-d3c4c3ce3269/bin/uautomizer/data/b68aa7fac/faa68316f5ef472aad3d1edc9978973f [2019-11-20 01:32:25,759 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 01:32:25,761 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 01:32:25,763 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 01:32:25,763 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 01:32:25,767 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 01:32:25,768 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 01:32:25" (1/1) ... [2019-11-20 01:32:25,770 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fe7f9a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:32:25, skipping insertion in model container [2019-11-20 01:32:25,771 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 01:32:25" (1/1) ... [2019-11-20 01:32:25,778 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 01:32:25,795 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 01:32:26,001 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 01:32:26,017 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 01:32:26,062 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 01:32:26,083 INFO L192 MainTranslator]: Completed translation [2019-11-20 01:32:26,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:32:26 WrapperNode [2019-11-20 01:32:26,084 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 01:32:26,085 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 01:32:26,085 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 01:32:26,086 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 01:32:26,096 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:32:26" (1/1) ... [2019-11-20 01:32:26,108 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:32:26" (1/1) ... [2019-11-20 01:32:26,258 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 01:32:26,258 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 01:32:26,258 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 01:32:26,259 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 01:32:26,276 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:32:26" (1/1) ... [2019-11-20 01:32:26,277 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:32:26" (1/1) ... [2019-11-20 01:32:26,290 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:32:26" (1/1) ... [2019-11-20 01:32:26,291 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:32:26" (1/1) ... [2019-11-20 01:32:26,307 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:32:26" (1/1) ... [2019-11-20 01:32:26,321 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:32:26" (1/1) ... [2019-11-20 01:32:26,326 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:32:26" (1/1) ... [2019-11-20 01:32:26,333 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 01:32:26,333 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 01:32:26,333 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 01:32:26,333 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 01:32:26,334 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:32:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fec8267c-a702-4f5a-8056-d3c4c3ce3269/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 01:32:26,397 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-20 01:32:26,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 01:32:26,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 01:32:26,398 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 01:32:26,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 01:32:26,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-20 01:32:26,807 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 01:32:26,807 INFO L285 CfgBuilder]: Removed 14 assume(true) statements. [2019-11-20 01:32:26,808 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:32:26 BoogieIcfgContainer [2019-11-20 01:32:26,808 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 01:32:26,809 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 01:32:26,810 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 01:32:26,813 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 01:32:26,813 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 01:32:25" (1/3) ... [2019-11-20 01:32:26,814 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f506ba9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 01:32:26, skipping insertion in model container [2019-11-20 01:32:26,814 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:32:26" (2/3) ... [2019-11-20 01:32:26,815 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f506ba9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 01:32:26, skipping insertion in model container [2019-11-20 01:32:26,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:32:26" (3/3) ... [2019-11-20 01:32:26,817 INFO L109 eAbstractionObserver]: Analyzing ICFG sep.i [2019-11-20 01:32:26,827 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 01:32:26,834 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 01:32:26,845 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 01:32:26,869 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 01:32:26,869 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 01:32:26,869 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 01:32:26,870 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 01:32:26,870 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 01:32:26,870 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 01:32:26,870 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 01:32:26,871 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 01:32:26,884 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2019-11-20 01:32:26,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-20 01:32:26,890 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:32:26,891 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:32:26,891 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:32:26,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:32:26,897 INFO L82 PathProgramCache]: Analyzing trace with hash -805411982, now seen corresponding path program 1 times [2019-11-20 01:32:26,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:32:26,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [60377711] [2019-11-20 01:32:26,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fec8267c-a702-4f5a-8056-d3c4c3ce3269/bin/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:32:27,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:32:27,012 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-20 01:32:27,018 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:32:27,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:32:27,036 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:32:27,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:32:27,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [60377711] [2019-11-20 01:32:27,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:32:27,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-20 01:32:27,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158196006] [2019-11-20 01:32:27,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-20 01:32:27,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:32:27,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-20 01:32:27,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 01:32:27,070 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2019-11-20 01:32:27,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:32:27,092 INFO L93 Difference]: Finished difference Result 52 states and 72 transitions. [2019-11-20 01:32:27,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-20 01:32:27,094 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-11-20 01:32:27,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:32:27,105 INFO L225 Difference]: With dead ends: 52 [2019-11-20 01:32:27,105 INFO L226 Difference]: Without dead ends: 24 [2019-11-20 01:32:27,108 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 01:32:27,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-11-20 01:32:27,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-11-20 01:32:27,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-20 01:32:27,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2019-11-20 01:32:27,139 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 16 [2019-11-20 01:32:27,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:32:27,139 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2019-11-20 01:32:27,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-20 01:32:27,140 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2019-11-20 01:32:27,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-20 01:32:27,141 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:32:27,141 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:32:27,341 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:32:27,342 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:32:27,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:32:27,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1872946201, now seen corresponding path program 1 times [2019-11-20 01:32:27,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:32:27,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [180804067] [2019-11-20 01:32:27,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fec8267c-a702-4f5a-8056-d3c4c3ce3269/bin/uautomizer/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:32:27,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:32:27,462 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 01:32:27,464 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:32:27,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:32:27,505 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:32:27,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:32:27,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [180804067] [2019-11-20 01:32:27,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:32:27,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 01:32:27,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555881184] [2019-11-20 01:32:27,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:32:27,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:32:27,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:32:27,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:32:27,540 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand 4 states. [2019-11-20 01:32:27,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:32:27,646 INFO L93 Difference]: Finished difference Result 46 states and 59 transitions. [2019-11-20 01:32:27,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:32:27,648 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-20 01:32:27,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:32:27,649 INFO L225 Difference]: With dead ends: 46 [2019-11-20 01:32:27,649 INFO L226 Difference]: Without dead ends: 28 [2019-11-20 01:32:27,650 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:32:27,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-20 01:32:27,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-11-20 01:32:27,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-20 01:32:27,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2019-11-20 01:32:27,656 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 16 [2019-11-20 01:32:27,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:32:27,657 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-11-20 01:32:27,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:32:27,657 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2019-11-20 01:32:27,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 01:32:27,658 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:32:27,659 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:32:27,869 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:32:27,872 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:32:27,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:32:27,873 INFO L82 PathProgramCache]: Analyzing trace with hash -877574393, now seen corresponding path program 1 times [2019-11-20 01:32:27,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:32:27,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [113192188] [2019-11-20 01:32:27,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fec8267c-a702-4f5a-8056-d3c4c3ce3269/bin/uautomizer/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:32:28,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:32:28,004 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 01:32:28,007 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:32:28,124 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:32:28,124 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:32:28,343 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:32:28,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [113192188] [2019-11-20 01:32:28,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:32:28,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-11-20 01:32:28,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578788806] [2019-11-20 01:32:28,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 01:32:28,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:32:28,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 01:32:28,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-11-20 01:32:28,347 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 12 states. [2019-11-20 01:32:28,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:32:28,779 INFO L93 Difference]: Finished difference Result 77 states and 103 transitions. [2019-11-20 01:32:28,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 01:32:28,781 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2019-11-20 01:32:28,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:32:28,783 INFO L225 Difference]: With dead ends: 77 [2019-11-20 01:32:28,783 INFO L226 Difference]: Without dead ends: 61 [2019-11-20 01:32:28,784 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-11-20 01:32:28,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-20 01:32:28,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 54. [2019-11-20 01:32:28,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-20 01:32:28,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 68 transitions. [2019-11-20 01:32:28,797 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 68 transitions. Word has length 22 [2019-11-20 01:32:28,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:32:28,798 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 68 transitions. [2019-11-20 01:32:28,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 01:32:28,798 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 68 transitions. [2019-11-20 01:32:28,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-20 01:32:28,800 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:32:28,801 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:32:29,004 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:32:29,004 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:32:29,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:32:29,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1474637889, now seen corresponding path program 1 times [2019-11-20 01:32:29,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:32:29,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1837473356] [2019-11-20 01:32:29,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fec8267c-a702-4f5a-8056-d3c4c3ce3269/bin/uautomizer/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:32:29,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:32:29,155 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-20 01:32:29,157 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:32:29,313 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 01:32:29,314 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:32:29,639 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 01:32:29,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1837473356] [2019-11-20 01:32:29,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:32:29,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2019-11-20 01:32:29,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894360108] [2019-11-20 01:32:29,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-20 01:32:29,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:32:29,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-20 01:32:29,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2019-11-20 01:32:29,643 INFO L87 Difference]: Start difference. First operand 54 states and 68 transitions. Second operand 16 states. [2019-11-20 01:32:30,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:32:30,375 INFO L93 Difference]: Finished difference Result 140 states and 187 transitions. [2019-11-20 01:32:30,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-20 01:32:30,376 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 31 [2019-11-20 01:32:30,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:32:30,378 INFO L225 Difference]: With dead ends: 140 [2019-11-20 01:32:30,378 INFO L226 Difference]: Without dead ends: 123 [2019-11-20 01:32:30,379 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=143, Invalid=319, Unknown=0, NotChecked=0, Total=462 [2019-11-20 01:32:30,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-11-20 01:32:30,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 93. [2019-11-20 01:32:30,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-20 01:32:30,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 123 transitions. [2019-11-20 01:32:30,400 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 123 transitions. Word has length 31 [2019-11-20 01:32:30,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:32:30,400 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 123 transitions. [2019-11-20 01:32:30,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-20 01:32:30,401 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 123 transitions. [2019-11-20 01:32:30,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-20 01:32:30,403 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:32:30,404 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:32:30,607 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:32:30,607 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:32:30,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:32:30,608 INFO L82 PathProgramCache]: Analyzing trace with hash -2038223641, now seen corresponding path program 2 times [2019-11-20 01:32:30,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:32:30,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2006431965] [2019-11-20 01:32:30,609 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fec8267c-a702-4f5a-8056-d3c4c3ce3269/bin/uautomizer/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:32:30,727 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-20 01:32:30,727 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 01:32:30,729 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 01:32:30,732 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:32:30,767 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-20 01:32:30,769 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:32:30,822 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-20 01:32:30,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2006431965] [2019-11-20 01:32:30,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:32:30,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 01:32:30,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212889402] [2019-11-20 01:32:30,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 01:32:30,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:32:30,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 01:32:30,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-20 01:32:30,826 INFO L87 Difference]: Start difference. First operand 93 states and 123 transitions. Second operand 6 states. [2019-11-20 01:32:30,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:32:30,968 INFO L93 Difference]: Finished difference Result 128 states and 168 transitions. [2019-11-20 01:32:30,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 01:32:30,969 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-11-20 01:32:30,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:32:30,972 INFO L225 Difference]: With dead ends: 128 [2019-11-20 01:32:30,973 INFO L226 Difference]: Without dead ends: 99 [2019-11-20 01:32:30,973 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-11-20 01:32:30,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-11-20 01:32:30,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2019-11-20 01:32:30,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-20 01:32:30,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 126 transitions. [2019-11-20 01:32:30,998 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 126 transitions. Word has length 34 [2019-11-20 01:32:30,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:32:30,999 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 126 transitions. [2019-11-20 01:32:30,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 01:32:30,999 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 126 transitions. [2019-11-20 01:32:31,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-20 01:32:31,000 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:32:31,000 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:32:31,201 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:32:31,201 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:32:31,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:32:31,202 INFO L82 PathProgramCache]: Analyzing trace with hash 657704709, now seen corresponding path program 1 times [2019-11-20 01:32:31,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:32:31,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1562571476] [2019-11-20 01:32:31,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fec8267c-a702-4f5a-8056-d3c4c3ce3269/bin/uautomizer/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:32:31,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:32:31,428 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-20 01:32:31,431 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:32:31,733 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 01:32:31,734 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:32:32,221 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-20 01:32:32,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1562571476] [2019-11-20 01:32:32,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:32:32,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 27 [2019-11-20 01:32:32,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134644505] [2019-11-20 01:32:32,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-20 01:32:32,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:32:32,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-20 01:32:32,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=611, Unknown=0, NotChecked=0, Total=702 [2019-11-20 01:32:32,235 INFO L87 Difference]: Start difference. First operand 96 states and 126 transitions. Second operand 27 states. [2019-11-20 01:32:33,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:32:33,252 INFO L93 Difference]: Finished difference Result 457 states and 585 transitions. [2019-11-20 01:32:33,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-20 01:32:33,253 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 36 [2019-11-20 01:32:33,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:32:33,259 INFO L225 Difference]: With dead ends: 457 [2019-11-20 01:32:33,259 INFO L226 Difference]: Without dead ends: 450 [2019-11-20 01:32:33,260 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=138, Invalid=792, Unknown=0, NotChecked=0, Total=930 [2019-11-20 01:32:33,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-11-20 01:32:33,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 190. [2019-11-20 01:32:33,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-11-20 01:32:33,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 259 transitions. [2019-11-20 01:32:33,323 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 259 transitions. Word has length 36 [2019-11-20 01:32:33,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:32:33,323 INFO L462 AbstractCegarLoop]: Abstraction has 190 states and 259 transitions. [2019-11-20 01:32:33,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-20 01:32:33,324 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 259 transitions. [2019-11-20 01:32:33,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-20 01:32:33,332 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:32:33,332 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:32:33,536 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:32:33,536 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:32:33,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:32:33,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1862255225, now seen corresponding path program 1 times [2019-11-20 01:32:33,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:32:33,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [128685312] [2019-11-20 01:32:33,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fec8267c-a702-4f5a-8056-d3c4c3ce3269/bin/uautomizer/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:32:33,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:32:33,802 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-20 01:32:33,805 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:32:33,919 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:32:33,937 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2019-11-20 01:32:33,938 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:32:33,970 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:32:33,971 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:32:33,971 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:20 [2019-11-20 01:32:34,099 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-11-20 01:32:34,100 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:32:34,116 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:32:34,116 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:32:34,117 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:16 [2019-11-20 01:32:34,163 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-11-20 01:32:34,163 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:32:34,196 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:32:34,197 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:32:34,197 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:27 [2019-11-20 01:32:34,331 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 01:32:34,334 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:32:34,334 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 21 treesize of output 12 [2019-11-20 01:32:34,335 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:32:34,344 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:32:34,345 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 01:32:34,345 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:5 [2019-11-20 01:32:34,383 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 01:32:34,387 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:32:34,509 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 19 treesize of output 17 [2019-11-20 01:32:34,531 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 38 treesize of output 34 [2019-11-20 01:32:34,538 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-20 01:32:34,551 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:32:34,551 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-11-20 01:32:34,557 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:32:34,557 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-20 01:32:34,558 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:16 [2019-11-20 01:32:34,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:32:34,870 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2019-11-20 01:32:34,882 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 30 treesize of output 26 [2019-11-20 01:32:34,884 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-20 01:32:34,887 INFO L567 ElimStorePlain]: treesize reduction 18, result has 5.3 percent of original size [2019-11-20 01:32:34,888 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:32:34,890 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:32:34,890 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 01:32:34,890 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:7 [2019-11-20 01:32:35,127 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 01:32:35,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [128685312] [2019-11-20 01:32:35,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:32:35,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2019-11-20 01:32:35,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531375128] [2019-11-20 01:32:35,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-20 01:32:35,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:32:35,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-20 01:32:35,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2019-11-20 01:32:35,130 INFO L87 Difference]: Start difference. First operand 190 states and 259 transitions. Second operand 23 states. [2019-11-20 01:32:37,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:32:37,119 INFO L93 Difference]: Finished difference Result 250 states and 321 transitions. [2019-11-20 01:32:37,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-20 01:32:37,120 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 36 [2019-11-20 01:32:37,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:32:37,122 INFO L225 Difference]: With dead ends: 250 [2019-11-20 01:32:37,123 INFO L226 Difference]: Without dead ends: 240 [2019-11-20 01:32:37,124 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=312, Invalid=1094, Unknown=0, NotChecked=0, Total=1406 [2019-11-20 01:32:37,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-11-20 01:32:37,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 203. [2019-11-20 01:32:37,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-11-20 01:32:37,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 274 transitions. [2019-11-20 01:32:37,150 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 274 transitions. Word has length 36 [2019-11-20 01:32:37,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:32:37,151 INFO L462 AbstractCegarLoop]: Abstraction has 203 states and 274 transitions. [2019-11-20 01:32:37,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-20 01:32:37,151 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 274 transitions. [2019-11-20 01:32:37,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-20 01:32:37,153 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:32:37,153 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:32:37,358 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:32:37,358 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:32:37,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:32:37,359 INFO L82 PathProgramCache]: Analyzing trace with hash 264677699, now seen corresponding path program 2 times [2019-11-20 01:32:37,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:32:37,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [351557274] [2019-11-20 01:32:37,360 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fec8267c-a702-4f5a-8056-d3c4c3ce3269/bin/uautomizer/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:32:37,631 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 01:32:37,631 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 01:32:37,633 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-20 01:32:37,637 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:32:37,866 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:32:37,868 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 22 [2019-11-20 01:32:37,869 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:32:37,907 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:32:37,908 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:32:37,908 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:31 [2019-11-20 01:32:38,151 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:32:38,152 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2019-11-20 01:32:38,153 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:32:38,186 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:32:38,186 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:32:38,186 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:33 [2019-11-20 01:32:38,303 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 01:32:38,307 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:32:38,309 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:32:38,310 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2019-11-20 01:32:38,310 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:32:38,383 INFO L567 ElimStorePlain]: treesize reduction 12, result has 72.7 percent of original size [2019-11-20 01:32:38,384 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 01:32:38,385 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:52, output treesize:16 [2019-11-20 01:32:38,422 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-11-20 01:32:38,423 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:32:38,425 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:32:38,425 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:32:38,425 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2019-11-20 01:32:38,463 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 01:32:38,464 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:32:39,276 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:32:39,277 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 32 treesize of output 36 [2019-11-20 01:32:39,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:32:39,280 INFO L392 ElimStorePlain]: Different costs {0=[v_arrayElimCell_16], 1=[v_arrayElimCell_15]} [2019-11-20 01:32:39,484 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:32:39,485 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: This case should habe been handled by DER at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:192) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.(DerPreprocessor.java:95) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:291) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.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 01:32:39,489 INFO L168 Benchmark]: Toolchain (without parser) took 13727.88 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 277.3 MB). Free memory was 960.4 MB in the beginning and 1.2 GB in the end (delta: -200.8 MB). Peak memory consumption was 76.5 MB. Max. memory is 11.5 GB. [2019-11-20 01:32:39,489 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 1.0 GB. Free memory is still 987.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 01:32:39,490 INFO L168 Benchmark]: CACSL2BoogieTranslator took 321.91 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-20 01:32:39,491 INFO L168 Benchmark]: Boogie Procedure Inliner took 172.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 176.7 MB). Free memory was 949.7 MB in the beginning and 1.2 GB in the end (delta: -221.5 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. [2019-11-20 01:32:39,491 INFO L168 Benchmark]: Boogie Preprocessor took 74.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-20 01:32:39,492 INFO L168 Benchmark]: RCFGBuilder took 475.39 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: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. [2019-11-20 01:32:39,493 INFO L168 Benchmark]: TraceAbstraction took 12678.30 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 100.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -22.2 MB). Peak memory consumption was 78.5 MB. Max. memory is 11.5 GB. [2019-11-20 01:32:39,496 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.33 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 321.91 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 172.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 176.7 MB). Free memory was 949.7 MB in the beginning and 1.2 GB in the end (delta: -221.5 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 74.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 475.39 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: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12678.30 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 100.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -22.2 MB). Peak memory consumption was 78.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: This case should habe been handled by DER: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...