./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-cav19/array_min_and_copy_shift_sum_add.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_c7415de1-6752-485e-b282-dac27b9c9c41/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c7415de1-6752-485e-b282-dac27b9c9c41/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c7415de1-6752-485e-b282-dac27b9c9c41/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c7415de1-6752-485e-b282-dac27b9c9c41/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/array-cav19/array_min_and_copy_shift_sum_add.c -s /tmp/vcloud-vcloud-master/worker/run_dir_c7415de1-6752-485e-b282-dac27b9c9c41/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c7415de1-6752-485e-b282-dac27b9c9c41/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 15531371c32798be6bd0f72c21bf4d37b6362d8d ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_c7415de1-6752-485e-b282-dac27b9c9c41/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c7415de1-6752-485e-b282-dac27b9c9c41/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c7415de1-6752-485e-b282-dac27b9c9c41/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c7415de1-6752-485e-b282-dac27b9c9c41/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/array-cav19/array_min_and_copy_shift_sum_add.c -s /tmp/vcloud-vcloud-master/worker/run_dir_c7415de1-6752-485e-b282-dac27b9c9c41/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c7415de1-6752-485e-b282-dac27b9c9c41/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 15531371c32798be6bd0f72c21bf4d37b6362d8d ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 21:20:06,921 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 21:20:06,923 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 21:20:06,931 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 21:20:06,932 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 21:20:06,932 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 21:20:06,933 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 21:20:06,935 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 21:20:06,937 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 21:20:06,938 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 21:20:06,939 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 21:20:06,940 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 21:20:06,940 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 21:20:06,941 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 21:20:06,942 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 21:20:06,943 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 21:20:06,943 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 21:20:06,944 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 21:20:06,946 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 21:20:06,948 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 21:20:06,949 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 21:20:06,950 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 21:20:06,951 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 21:20:06,952 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 21:20:06,954 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 21:20:06,954 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 21:20:06,955 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 21:20:06,955 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 21:20:06,956 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 21:20:06,956 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 21:20:06,957 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 21:20:06,957 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 21:20:06,958 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 21:20:06,958 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 21:20:06,959 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 21:20:06,959 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 21:20:06,959 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 21:20:06,960 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 21:20:06,960 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 21:20:06,961 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 21:20:06,961 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 21:20:06,962 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c7415de1-6752-485e-b282-dac27b9c9c41/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 21:20:06,973 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 21:20:06,973 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 21:20:06,974 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 21:20:06,974 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 21:20:06,974 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 21:20:06,974 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 21:20:06,974 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 21:20:06,975 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 21:20:06,975 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 21:20:06,975 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 21:20:06,975 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 21:20:06,975 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 21:20:06,975 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 21:20:06,975 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 21:20:06,976 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 21:20:06,976 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 21:20:06,976 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 21:20:06,976 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 21:20:06,976 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 21:20:06,976 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 21:20:06,977 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 21:20:06,977 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 21:20:06,977 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 21:20:06,977 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 21:20:06,977 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 21:20:06,977 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 21:20:06,977 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 21:20:06,977 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 21:20:06,978 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 21:20:06,978 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 21:20:06,978 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 21:20:06,978 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 21:20:06,978 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 21:20:06,978 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 21:20:06,978 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 21:20:06,978 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 21:20:06,979 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 21:20:06,979 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 21:20:06,979 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 21:20:06,979 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 21:20:06,979 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_c7415de1-6752-485e-b282-dac27b9c9c41/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 15531371c32798be6bd0f72c21bf4d37b6362d8d [2019-12-07 21:20:07,094 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 21:20:07,104 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 21:20:07,107 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 21:20:07,108 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 21:20:07,109 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 21:20:07,109 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c7415de1-6752-485e-b282-dac27b9c9c41/bin/utaipan/../../sv-benchmarks/c/array-cav19/array_min_and_copy_shift_sum_add.c [2019-12-07 21:20:07,150 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c7415de1-6752-485e-b282-dac27b9c9c41/bin/utaipan/data/88245f00f/d0d9320d56b4480c957a3f49aa1cedf7/FLAG64244b749 [2019-12-07 21:20:07,508 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 21:20:07,508 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c7415de1-6752-485e-b282-dac27b9c9c41/sv-benchmarks/c/array-cav19/array_min_and_copy_shift_sum_add.c [2019-12-07 21:20:07,512 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c7415de1-6752-485e-b282-dac27b9c9c41/bin/utaipan/data/88245f00f/d0d9320d56b4480c957a3f49aa1cedf7/FLAG64244b749 [2019-12-07 21:20:07,520 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c7415de1-6752-485e-b282-dac27b9c9c41/bin/utaipan/data/88245f00f/d0d9320d56b4480c957a3f49aa1cedf7 [2019-12-07 21:20:07,522 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 21:20:07,523 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 21:20:07,524 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 21:20:07,524 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 21:20:07,526 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 21:20:07,527 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 09:20:07" (1/1) ... [2019-12-07 21:20:07,528 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3260b9b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:20:07, skipping insertion in model container [2019-12-07 21:20:07,529 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 09:20:07" (1/1) ... [2019-12-07 21:20:07,534 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 21:20:07,545 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 21:20:07,650 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 21:20:07,653 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 21:20:07,700 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 21:20:07,712 INFO L208 MainTranslator]: Completed translation [2019-12-07 21:20:07,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:20:07 WrapperNode [2019-12-07 21:20:07,713 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 21:20:07,713 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 21:20:07,713 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 21:20:07,713 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 21:20:07,720 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:20:07" (1/1) ... [2019-12-07 21:20:07,725 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:20:07" (1/1) ... [2019-12-07 21:20:07,738 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 21:20:07,739 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 21:20:07,739 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 21:20:07,739 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 21:20:07,745 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:20:07" (1/1) ... [2019-12-07 21:20:07,745 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:20:07" (1/1) ... [2019-12-07 21:20:07,746 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:20:07" (1/1) ... [2019-12-07 21:20:07,747 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:20:07" (1/1) ... [2019-12-07 21:20:07,750 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:20:07" (1/1) ... [2019-12-07 21:20:07,753 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:20:07" (1/1) ... [2019-12-07 21:20:07,754 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:20:07" (1/1) ... [2019-12-07 21:20:07,756 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 21:20:07,756 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 21:20:07,756 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 21:20:07,756 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 21:20:07,757 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:20:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c7415de1-6752-485e-b282-dac27b9c9c41/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 21:20:07,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 21:20:07,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 21:20:07,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 21:20:07,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 21:20:07,795 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 21:20:07,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 21:20:08,034 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 21:20:08,034 INFO L287 CfgBuilder]: Removed 9 assume(true) statements. [2019-12-07 21:20:08,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:20:08 BoogieIcfgContainer [2019-12-07 21:20:08,035 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 21:20:08,036 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 21:20:08,036 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 21:20:08,039 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 21:20:08,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 09:20:07" (1/3) ... [2019-12-07 21:20:08,040 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c769f6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 09:20:08, skipping insertion in model container [2019-12-07 21:20:08,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:20:07" (2/3) ... [2019-12-07 21:20:08,040 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c769f6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 09:20:08, skipping insertion in model container [2019-12-07 21:20:08,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:20:08" (3/3) ... [2019-12-07 21:20:08,042 INFO L109 eAbstractionObserver]: Analyzing ICFG array_min_and_copy_shift_sum_add.c [2019-12-07 21:20:08,049 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 21:20:08,053 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 21:20:08,060 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 21:20:08,074 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 21:20:08,074 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 21:20:08,075 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 21:20:08,075 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 21:20:08,075 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 21:20:08,075 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 21:20:08,075 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 21:20:08,075 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 21:20:08,083 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2019-12-07 21:20:08,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 21:20:08,087 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:20:08,087 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-07 21:20:08,087 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:20:08,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:20:08,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1294578295, now seen corresponding path program 1 times [2019-12-07 21:20:08,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:20:08,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717899218] [2019-12-07 21:20:08,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:20:08,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:20:08,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:20:08,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717899218] [2019-12-07 21:20:08,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:20:08,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:20:08,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421631051] [2019-12-07 21:20:08,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:20:08,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:20:08,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:20:08,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:20:08,233 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 4 states. [2019-12-07 21:20:08,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:20:08,262 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2019-12-07 21:20:08,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 21:20:08,263 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-12-07 21:20:08,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:20:08,269 INFO L225 Difference]: With dead ends: 17 [2019-12-07 21:20:08,269 INFO L226 Difference]: Without dead ends: 8 [2019-12-07 21:20:08,272 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:20:08,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-12-07 21:20:08,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-12-07 21:20:08,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-12-07 21:20:08,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2019-12-07 21:20:08,293 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 10 transitions. Word has length 6 [2019-12-07 21:20:08,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:20:08,293 INFO L462 AbstractCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-12-07 21:20:08,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:20:08,293 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2019-12-07 21:20:08,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 21:20:08,294 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:20:08,294 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:20:08,294 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:20:08,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:20:08,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1477410799, now seen corresponding path program 1 times [2019-12-07 21:20:08,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:20:08,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384429774] [2019-12-07 21:20:08,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:20:08,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:20:08,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:20:08,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384429774] [2019-12-07 21:20:08,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:20:08,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 21:20:08,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461236290] [2019-12-07 21:20:08,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 21:20:08,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:20:08,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 21:20:08,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:20:08,333 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. Second operand 5 states. [2019-12-07 21:20:08,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:20:08,356 INFO L93 Difference]: Finished difference Result 18 states and 24 transitions. [2019-12-07 21:20:08,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:20:08,357 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-12-07 21:20:08,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:20:08,357 INFO L225 Difference]: With dead ends: 18 [2019-12-07 21:20:08,357 INFO L226 Difference]: Without dead ends: 10 [2019-12-07 21:20:08,358 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:20:08,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-12-07 21:20:08,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-12-07 21:20:08,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-12-07 21:20:08,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2019-12-07 21:20:08,360 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 12 transitions. Word has length 7 [2019-12-07 21:20:08,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:20:08,360 INFO L462 AbstractCegarLoop]: Abstraction has 10 states and 12 transitions. [2019-12-07 21:20:08,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 21:20:08,360 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 12 transitions. [2019-12-07 21:20:08,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 21:20:08,361 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:20:08,361 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:20:08,361 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:20:08,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:20:08,361 INFO L82 PathProgramCache]: Analyzing trace with hash 940865821, now seen corresponding path program 1 times [2019-12-07 21:20:08,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:20:08,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111401579] [2019-12-07 21:20:08,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:20:08,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:20:08,562 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:20:08,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111401579] [2019-12-07 21:20:08,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [878034537] [2019-12-07 21:20:08,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c7415de1-6752-485e-b282-dac27b9c9c41/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:20:08,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:20:08,597 INFO L264 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 21 conjunts are in the unsatisfiable core [2019-12-07 21:20:08,602 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:20:08,712 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:20:08,712 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 42 [2019-12-07 21:20:08,713 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:20:08,729 INFO L614 ElimStorePlain]: treesize reduction 16, result has 66.0 percent of original size [2019-12-07 21:20:08,730 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 21:20:08,730 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:33, output treesize:14 [2019-12-07 21:20:08,764 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-12-07 21:20:08,765 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:20:08,766 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:20:08,766 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 21:20:08,767 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-12-07 21:20:08,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:20:08,778 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:20:08,778 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:20:08,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:20:08,846 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:20:08,846 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 18 treesize of output 19 [2019-12-07 21:20:08,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:20:08,847 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 21:20:08,850 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:20:08,850 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 21:20:08,850 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:13 [2019-12-07 21:20:08,867 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:20:08,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [938608800] [2019-12-07 21:20:08,882 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2019-12-07 21:20:08,882 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 21:20:08,885 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 21:20:08,889 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 21:20:08,890 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 21:20:09,123 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 21:20:09,389 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 21:20:09,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 21:20:09,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2019-12-07 21:20:09,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707131759] [2019-12-07 21:20:09,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-07 21:20:09,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:20:09,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-07 21:20:09,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=467, Unknown=0, NotChecked=0, Total=552 [2019-12-07 21:20:09,392 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. Second operand 20 states. [2019-12-07 21:20:09,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:20:09,592 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2019-12-07 21:20:09,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 21:20:09,593 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 9 [2019-12-07 21:20:09,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:20:09,593 INFO L225 Difference]: With dead ends: 16 [2019-12-07 21:20:09,593 INFO L226 Difference]: Without dead ends: 13 [2019-12-07 21:20:09,594 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=130, Invalid=682, Unknown=0, NotChecked=0, Total=812 [2019-12-07 21:20:09,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-12-07 21:20:09,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-12-07 21:20:09,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-12-07 21:20:09,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2019-12-07 21:20:09,596 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 15 transitions. Word has length 9 [2019-12-07 21:20:09,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:20:09,597 INFO L462 AbstractCegarLoop]: Abstraction has 12 states and 15 transitions. [2019-12-07 21:20:09,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-07 21:20:09,597 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 15 transitions. [2019-12-07 21:20:09,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 21:20:09,597 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:20:09,597 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:20:09,798 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:20:09,798 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:20:09,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:20:09,799 INFO L82 PathProgramCache]: Analyzing trace with hash -898119939, now seen corresponding path program 2 times [2019-12-07 21:20:09,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:20:09,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999851250] [2019-12-07 21:20:09,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:20:09,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:20:09,850 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 21:20:09,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999851250] [2019-12-07 21:20:09,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1096221391] [2019-12-07 21:20:09,851 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c7415de1-6752-485e-b282-dac27b9c9c41/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:20:09,876 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-07 21:20:09,876 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 21:20:09,877 INFO L264 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 21:20:09,878 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:20:09,905 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 21:20:09,905 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:20:09,926 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 21:20:09,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1509027204] [2019-12-07 21:20:09,927 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2019-12-07 21:20:09,927 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 21:20:09,928 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 21:20:09,928 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 21:20:09,928 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 21:20:10,080 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 21:20:10,262 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 21:20:10,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 21:20:10,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2019-12-07 21:20:10,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189907276] [2019-12-07 21:20:10,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 21:20:10,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:20:10,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 21:20:10,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-12-07 21:20:10,263 INFO L87 Difference]: Start difference. First operand 12 states and 15 transitions. Second operand 11 states. [2019-12-07 21:20:10,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:20:10,313 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2019-12-07 21:20:10,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 21:20:10,313 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2019-12-07 21:20:10,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:20:10,313 INFO L225 Difference]: With dead ends: 26 [2019-12-07 21:20:10,313 INFO L226 Difference]: Without dead ends: 16 [2019-12-07 21:20:10,314 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2019-12-07 21:20:10,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-12-07 21:20:10,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 12. [2019-12-07 21:20:10,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-12-07 21:20:10,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2019-12-07 21:20:10,316 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 10 [2019-12-07 21:20:10,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:20:10,316 INFO L462 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-12-07 21:20:10,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 21:20:10,316 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2019-12-07 21:20:10,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 21:20:10,317 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:20:10,317 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:20:10,517 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:20:10,518 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:20:10,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:20:10,519 INFO L82 PathProgramCache]: Analyzing trace with hash -198882543, now seen corresponding path program 3 times [2019-12-07 21:20:10,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:20:10,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782945268] [2019-12-07 21:20:10,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:20:10,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:20:10,669 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 21:20:10,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782945268] [2019-12-07 21:20:10,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [829086587] [2019-12-07 21:20:10,670 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c7415de1-6752-485e-b282-dac27b9c9c41/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:20:10,696 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 21:20:10,696 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 21:20:10,696 INFO L264 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 21:20:10,697 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:20:10,715 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 21:20:10,716 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:20:10,734 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 21:20:10,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1387432465] [2019-12-07 21:20:10,735 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2019-12-07 21:20:10,735 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 21:20:10,736 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 21:20:10,736 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 21:20:10,736 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 21:20:10,867 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 21:20:11,042 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 21:20:11,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 21:20:11,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 11 [2019-12-07 21:20:11,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813850125] [2019-12-07 21:20:11,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 21:20:11,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:20:11,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 21:20:11,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-12-07 21:20:11,043 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 11 states. [2019-12-07 21:20:11,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:20:11,086 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2019-12-07 21:20:11,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 21:20:11,086 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-12-07 21:20:11,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:20:11,087 INFO L225 Difference]: With dead ends: 16 [2019-12-07 21:20:11,087 INFO L226 Difference]: Without dead ends: 13 [2019-12-07 21:20:11,087 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 21 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2019-12-07 21:20:11,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-12-07 21:20:11,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-12-07 21:20:11,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-12-07 21:20:11,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2019-12-07 21:20:11,089 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 11 [2019-12-07 21:20:11,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:20:11,089 INFO L462 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2019-12-07 21:20:11,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 21:20:11,089 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2019-12-07 21:20:11,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 21:20:11,090 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:20:11,090 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-12-07 21:20:11,290 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:20:11,291 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:20:11,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:20:11,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1870580855, now seen corresponding path program 4 times [2019-12-07 21:20:11,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:20:11,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499719140] [2019-12-07 21:20:11,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:20:11,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:20:11,701 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 52 [2019-12-07 21:20:11,839 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:20:11,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499719140] [2019-12-07 21:20:11,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461837043] [2019-12-07 21:20:11,840 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c7415de1-6752-485e-b282-dac27b9c9c41/bin/utaipan/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-12-07 21:20:11,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:20:11,867 INFO L264 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 32 conjunts are in the unsatisfiable core [2019-12-07 21:20:11,868 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:20:12,249 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:20:12,249 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:20:12,566 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@6309d54f [2019-12-07 21:20:12,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2003898657] [2019-12-07 21:20:12,567 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2019-12-07 21:20:12,567 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 21:20:12,567 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 21:20:12,567 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 21:20:12,567 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 21:20:12,572 FATAL L? ?]: Ignoring exception! java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@6309d54f at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.lock(ManagedScript.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker.assertLhs(IncrementalPlicationChecker.java:74) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker.checkPlication(IncrementalPlicationChecker.java:106) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ArrayIndexEqualityManager.(ArrayIndexEqualityManager.java:91) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.computeCostEstimation(ElimStorePlain.java:555) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:428) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:234) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.quantifier(PartialQuantifierElimination.java:146) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.newQuantifier(SymbolicTools.java:279) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.projectExistentially(SymbolicTools.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermDomainOperationProvider.projectExistentially(TermDomainOperationProvider.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateTransformer.strongestPostcondition(PredicateTransformer.java:131) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.post(SymbolicTools.java:116) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretInternal(DagInterpreter.java:227) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:209) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:187) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:165) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 21:20:12,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-12-07 21:20:12,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-12-07 21:20:12,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123124154] [2019-12-07 21:20:12,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 21:20:12,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:20:12,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 21:20:12,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=768, Unknown=0, NotChecked=0, Total=870 [2019-12-07 21:20:12,574 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand 12 states. [2019-12-07 21:20:12,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 21:20:12,775 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:20:12,775 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@6309d54f at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.lock(ManagedScript.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:354) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:202) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:127) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ProtectiveHoareTripleChecker.checkInternal(ProtectiveHoareTripleChecker.java:60) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.EfficientHoareTripleChecker.checkInternal(EfficientHoareTripleChecker.java:62) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:698) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:627) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:454) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 21:20:12,777 INFO L168 Benchmark]: Toolchain (without parser) took 5254.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 946.1 MB in the beginning and 821.8 MB in the end (delta: 124.3 MB). Peak memory consumption was 263.2 MB. Max. memory is 11.5 GB. [2019-12-07 21:20:12,778 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 21:20:12,778 INFO L168 Benchmark]: CACSL2BoogieTranslator took 189.14 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 91.2 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -138.5 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. [2019-12-07 21:20:12,778 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.44 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 21:20:12,778 INFO L168 Benchmark]: Boogie Preprocessor took 17.01 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 21:20:12,779 INFO L168 Benchmark]: RCFGBuilder took 279.28 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. [2019-12-07 21:20:12,779 INFO L168 Benchmark]: TraceAbstraction took 4740.43 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 47.7 MB). Free memory was 1.1 GB in the beginning and 821.8 MB in the end (delta: 229.7 MB). Peak memory consumption was 277.4 MB. Max. memory is 11.5 GB. [2019-12-07 21:20:12,780 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 189.14 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 91.2 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -138.5 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 25.44 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.01 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 279.28 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4740.43 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 47.7 MB). Free memory was 1.1 GB in the beginning and 821.8 MB in the end (delta: 229.7 MB). Peak memory consumption was 277.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@6309d54f de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@6309d54f: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.lock(ManagedScript.java:83) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-f470102 [2019-12-07 21:20:14,120 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 21:20:14,122 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 21:20:14,130 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 21:20:14,130 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 21:20:14,131 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 21:20:14,132 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 21:20:14,133 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 21:20:14,135 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 21:20:14,135 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 21:20:14,136 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 21:20:14,137 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 21:20:14,137 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 21:20:14,138 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 21:20:14,138 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 21:20:14,139 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 21:20:14,140 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 21:20:14,141 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 21:20:14,143 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 21:20:14,145 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 21:20:14,146 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 21:20:14,147 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 21:20:14,148 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 21:20:14,149 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 21:20:14,152 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 21:20:14,152 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 21:20:14,152 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 21:20:14,153 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 21:20:14,153 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 21:20:14,154 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 21:20:14,154 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 21:20:14,155 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 21:20:14,155 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 21:20:14,156 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 21:20:14,156 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 21:20:14,157 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 21:20:14,157 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 21:20:14,157 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 21:20:14,158 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 21:20:14,158 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 21:20:14,159 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 21:20:14,159 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c7415de1-6752-485e-b282-dac27b9c9c41/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2019-12-07 21:20:14,173 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 21:20:14,173 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 21:20:14,174 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 21:20:14,174 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 21:20:14,174 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 21:20:14,174 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 21:20:14,174 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 21:20:14,175 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 21:20:14,175 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 21:20:14,175 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 21:20:14,176 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 21:20:14,176 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 21:20:14,176 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 21:20:14,176 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 21:20:14,176 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 21:20:14,177 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 21:20:14,177 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 21:20:14,177 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 21:20:14,177 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 21:20:14,177 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 21:20:14,177 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 21:20:14,178 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 21:20:14,178 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 21:20:14,178 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 21:20:14,178 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 21:20:14,178 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 21:20:14,179 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 21:20:14,179 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 21:20:14,179 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 21:20:14,179 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 21:20:14,179 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 21:20:14,180 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-12-07 21:20:14,180 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 21:20:14,180 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 21:20:14,180 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 21:20:14,180 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 21:20:14,180 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_c7415de1-6752-485e-b282-dac27b9c9c41/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 15531371c32798be6bd0f72c21bf4d37b6362d8d [2019-12-07 21:20:14,347 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 21:20:14,355 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 21:20:14,357 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 21:20:14,358 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 21:20:14,358 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 21:20:14,359 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c7415de1-6752-485e-b282-dac27b9c9c41/bin/utaipan/../../sv-benchmarks/c/array-cav19/array_min_and_copy_shift_sum_add.c [2019-12-07 21:20:14,396 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c7415de1-6752-485e-b282-dac27b9c9c41/bin/utaipan/data/acd086b78/528a8c8e349948189d55d252e422469c/FLAGc9776d584 [2019-12-07 21:20:14,843 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 21:20:14,843 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c7415de1-6752-485e-b282-dac27b9c9c41/sv-benchmarks/c/array-cav19/array_min_and_copy_shift_sum_add.c [2019-12-07 21:20:14,847 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c7415de1-6752-485e-b282-dac27b9c9c41/bin/utaipan/data/acd086b78/528a8c8e349948189d55d252e422469c/FLAGc9776d584 [2019-12-07 21:20:14,856 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c7415de1-6752-485e-b282-dac27b9c9c41/bin/utaipan/data/acd086b78/528a8c8e349948189d55d252e422469c [2019-12-07 21:20:14,858 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 21:20:14,858 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 21:20:14,859 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 21:20:14,859 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 21:20:14,861 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 21:20:14,862 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 09:20:14" (1/1) ... [2019-12-07 21:20:14,864 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@692431c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:20:14, skipping insertion in model container [2019-12-07 21:20:14,864 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 09:20:14" (1/1) ... [2019-12-07 21:20:14,868 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 21:20:14,880 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 21:20:14,985 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 21:20:14,988 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 21:20:15,005 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 21:20:15,018 INFO L208 MainTranslator]: Completed translation [2019-12-07 21:20:15,018 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:20:15 WrapperNode [2019-12-07 21:20:15,019 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 21:20:15,019 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 21:20:15,019 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 21:20:15,019 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 21:20:15,054 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:20:15" (1/1) ... [2019-12-07 21:20:15,062 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:20:15" (1/1) ... [2019-12-07 21:20:15,079 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 21:20:15,080 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 21:20:15,080 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 21:20:15,080 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 21:20:15,086 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:20:15" (1/1) ... [2019-12-07 21:20:15,087 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:20:15" (1/1) ... [2019-12-07 21:20:15,089 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:20:15" (1/1) ... [2019-12-07 21:20:15,089 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:20:15" (1/1) ... [2019-12-07 21:20:15,094 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:20:15" (1/1) ... [2019-12-07 21:20:15,096 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:20:15" (1/1) ... [2019-12-07 21:20:15,098 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:20:15" (1/1) ... [2019-12-07 21:20:15,099 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 21:20:15,099 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 21:20:15,100 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 21:20:15,100 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 21:20:15,100 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:20:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c7415de1-6752-485e-b282-dac27b9c9c41/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 21:20:15,138 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-12-07 21:20:15,138 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 21:20:15,138 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 21:20:15,138 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 21:20:15,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 21:20:15,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-12-07 21:20:15,313 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 21:20:15,313 INFO L287 CfgBuilder]: Removed 9 assume(true) statements. [2019-12-07 21:20:15,314 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:20:15 BoogieIcfgContainer [2019-12-07 21:20:15,314 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 21:20:15,315 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 21:20:15,315 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 21:20:15,317 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 21:20:15,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 09:20:14" (1/3) ... [2019-12-07 21:20:15,318 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18cb551b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 09:20:15, skipping insertion in model container [2019-12-07 21:20:15,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:20:15" (2/3) ... [2019-12-07 21:20:15,319 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18cb551b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 09:20:15, skipping insertion in model container [2019-12-07 21:20:15,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:20:15" (3/3) ... [2019-12-07 21:20:15,320 INFO L109 eAbstractionObserver]: Analyzing ICFG array_min_and_copy_shift_sum_add.c [2019-12-07 21:20:15,327 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 21:20:15,331 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 21:20:15,338 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 21:20:15,352 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 21:20:15,353 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 21:20:15,353 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 21:20:15,353 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 21:20:15,353 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 21:20:15,353 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 21:20:15,353 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 21:20:15,353 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 21:20:15,363 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-12-07 21:20:15,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 21:20:15,367 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:20:15,368 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:20:15,368 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:20:15,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:20:15,372 INFO L82 PathProgramCache]: Analyzing trace with hash 34651785, now seen corresponding path program 1 times [2019-12-07 21:20:15,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 21:20:15,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [51007631] [2019-12-07 21:20:15,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c7415de1-6752-485e-b282-dac27b9c9c41/bin/utaipan/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-12-07 21:20:15,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:20:15,423 INFO L264 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 21:20:15,426 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:20:15,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:20:15,454 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:20:15,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:20:15,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [51007631] [2019-12-07 21:20:15,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:20:15,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 21:20:15,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353410974] [2019-12-07 21:20:15,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 21:20:15,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 21:20:15,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 21:20:15,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 21:20:15,486 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 6 states. [2019-12-07 21:20:15,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:20:15,530 INFO L93 Difference]: Finished difference Result 42 states and 56 transitions. [2019-12-07 21:20:15,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 21:20:15,532 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-12-07 21:20:15,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:20:15,540 INFO L225 Difference]: With dead ends: 42 [2019-12-07 21:20:15,540 INFO L226 Difference]: Without dead ends: 18 [2019-12-07 21:20:15,543 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 21:20:15,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-12-07 21:20:15,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-12-07 21:20:15,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-12-07 21:20:15,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2019-12-07 21:20:15,572 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2019-12-07 21:20:15,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:20:15,572 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2019-12-07 21:20:15,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 21:20:15,572 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2019-12-07 21:20:15,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 21:20:15,573 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:20:15,573 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:20:15,773 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 21:20:15,774 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:20:15,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:20:15,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1006139381, now seen corresponding path program 1 times [2019-12-07 21:20:15,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 21:20:15,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1354550025] [2019-12-07 21:20:15,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c7415de1-6752-485e-b282-dac27b9c9c41/bin/utaipan/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-12-07 21:20:15,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:20:15,865 INFO L264 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 21:20:15,866 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:20:15,910 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:20:15,910 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:20:15,942 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:20:15,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1354550025] [2019-12-07 21:20:15,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:20:15,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-12-07 21:20:15,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485151591] [2019-12-07 21:20:15,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 21:20:15,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 21:20:15,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 21:20:15,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 21:20:15,945 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand 8 states. [2019-12-07 21:20:16,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:20:16,090 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2019-12-07 21:20:16,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 21:20:16,090 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-12-07 21:20:16,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:20:16,091 INFO L225 Difference]: With dead ends: 40 [2019-12-07 21:20:16,091 INFO L226 Difference]: Without dead ends: 24 [2019-12-07 21:20:16,092 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-12-07 21:20:16,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-12-07 21:20:16,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2019-12-07 21:20:16,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-12-07 21:20:16,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2019-12-07 21:20:16,096 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 12 [2019-12-07 21:20:16,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:20:16,096 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-12-07 21:20:16,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 21:20:16,096 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2019-12-07 21:20:16,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 21:20:16,097 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:20:16,097 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-12-07 21:20:16,297 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 21:20:16,298 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:20:16,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:20:16,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1174438055, now seen corresponding path program 1 times [2019-12-07 21:20:16,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 21:20:16,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [865463848] [2019-12-07 21:20:16,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c7415de1-6752-485e-b282-dac27b9c9c41/bin/utaipan/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-12-07 21:20:16,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:20:16,362 INFO L264 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 18 conjunts are in the unsatisfiable core [2019-12-07 21:20:16,364 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:20:16,612 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:20:16,612 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 43 [2019-12-07 21:20:16,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:20:16,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:20:16,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:20:16,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:20:16,620 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 21:20:16,668 INFO L614 ElimStorePlain]: treesize reduction 15, result has 69.4 percent of original size [2019-12-07 21:20:16,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:20:16,671 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 21:20:16,671 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:34 [2019-12-07 21:20:16,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:20:16,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:20:16,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:20:16,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:20:16,866 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:20:16,866 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 40 treesize of output 24 [2019-12-07 21:20:16,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:20:16,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:20:16,869 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 21:20:16,882 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:20:16,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:20:16,884 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-12-07 21:20:16,885 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:33 [2019-12-07 21:20:16,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:20:16,952 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:20:16,952 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:20:17,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:20:17,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:20:17,504 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:20:17,504 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 30 [2019-12-07 21:20:17,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:20:17,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:20:17,507 INFO L534 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 21:20:17,538 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:20:17,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:20:17,539 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 21:20:17,539 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:30 [2019-12-07 21:20:17,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:20:23,722 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:20:23,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [865463848] [2019-12-07 21:20:23,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1290153255] [2019-12-07 21:20:23,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c7415de1-6752-485e-b282-dac27b9c9c41/bin/utaipan/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 21:20:23,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:20:23,796 INFO L264 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 18 conjunts are in the unsatisfiable core [2019-12-07 21:20:23,798 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:20:23,817 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:20:23,818 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 43 [2019-12-07 21:20:23,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:20:23,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:20:23,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:20:23,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:20:23,822 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 21:20:23,866 INFO L614 ElimStorePlain]: treesize reduction 15, result has 69.4 percent of original size [2019-12-07 21:20:23,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:20:23,868 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 21:20:23,868 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:34 [2019-12-07 21:20:23,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:20:23,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:20:23,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:20:23,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:20:23,978 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:20:23,978 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 40 treesize of output 24 [2019-12-07 21:20:23,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:20:23,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:20:23,980 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 21:20:23,995 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:20:23,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:20:23,996 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-12-07 21:20:23,997 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:33 [2019-12-07 21:20:24,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:20:24,033 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:20:24,033 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:20:24,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:20:24,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:20:24,103 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:20:24,103 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 30 [2019-12-07 21:20:24,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:20:24,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:20:24,105 INFO L534 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 21:20:24,133 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:20:24,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:20:24,134 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 21:20:24,135 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:30 [2019-12-07 21:20:24,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:20:30,358 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:20:30,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743198322] [2019-12-07 21:20:30,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c7415de1-6752-485e-b282-dac27b9c9c41/bin/utaipan/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-12-07 21:20:30,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:20:30,412 INFO L264 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 19 conjunts are in the unsatisfiable core [2019-12-07 21:20:30,413 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:20:30,437 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:20:30,438 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 43 [2019-12-07 21:20:30,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:20:30,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:20:30,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:20:30,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:20:30,441 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 21:20:30,483 INFO L614 ElimStorePlain]: treesize reduction 15, result has 69.4 percent of original size [2019-12-07 21:20:30,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:20:30,484 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 21:20:30,484 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:34 [2019-12-07 21:20:30,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:20:30,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:20:30,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:20:30,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:20:30,603 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:20:30,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 40 treesize of output 24 [2019-12-07 21:20:30,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:20:30,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:20:30,605 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 21:20:30,619 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:20:30,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:20:30,621 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-12-07 21:20:30,621 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:25 [2019-12-07 21:20:30,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:20:30,648 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:20:30,648 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:20:30,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:20:30,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:20:30,728 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:20:30,728 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 30 [2019-12-07 21:20:30,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:20:30,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:20:30,730 INFO L534 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 21:20:30,754 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:20:30,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:20:30,755 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 21:20:30,756 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:30 [2019-12-07 21:20:30,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:20:37,000 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:20:37,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 21:20:37,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12, 12, 12, 12] total 22 [2019-12-07 21:20:37,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327659418] [2019-12-07 21:20:37,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-07 21:20:37,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 21:20:37,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-07 21:20:37,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=359, Unknown=3, NotChecked=0, Total=462 [2019-12-07 21:20:37,003 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand 22 states. [2019-12-07 21:20:39,751 WARN L192 SmtUtils]: Spent 2.13 s on a formula simplification that was a NOOP. DAG size: 44 [2019-12-07 21:20:46,176 WARN L192 SmtUtils]: Spent 6.17 s on a formula simplification that was a NOOP. DAG size: 58 [2019-12-07 21:21:36,930 WARN L192 SmtUtils]: Spent 2.22 s on a formula simplification that was a NOOP. DAG size: 56 [2019-12-07 21:21:43,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:21:43,333 INFO L93 Difference]: Finished difference Result 71 states and 90 transitions. [2019-12-07 21:21:43,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-07 21:21:43,333 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 19 [2019-12-07 21:21:43,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:21:43,335 INFO L225 Difference]: With dead ends: 71 [2019-12-07 21:21:43,335 INFO L226 Difference]: Without dead ends: 65 [2019-12-07 21:21:43,336 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 75 SyntacticMatches, 14 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 549 ImplicationChecksByTransitivity, 56.8s TimeCoverageRelationStatistics Valid=319, Invalid=1148, Unknown=15, NotChecked=0, Total=1482 [2019-12-07 21:21:43,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-12-07 21:21:43,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 37. [2019-12-07 21:21:43,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-12-07 21:21:43,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2019-12-07 21:21:43,341 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 19 [2019-12-07 21:21:43,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:21:43,342 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2019-12-07 21:21:43,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-07 21:21:43,342 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2019-12-07 21:21:43,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 21:21:43,342 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:21:43,342 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-12-07 21:21:43,944 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3,5 cvc4 --incremental --print-success --lang smt --rewrite-divk,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:21:43,946 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:21:43,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:21:43,947 INFO L82 PathProgramCache]: Analyzing trace with hash 2109411991, now seen corresponding path program 1 times [2019-12-07 21:21:43,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 21:21:43,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [241778342] [2019-12-07 21:21:43,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c7415de1-6752-485e-b282-dac27b9c9c41/bin/utaipan/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-12-07 21:21:43,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:21:43,997 INFO L264 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 20 conjunts are in the unsatisfiable core [2019-12-07 21:21:43,998 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:21:44,255 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:21:44,256 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 44 [2019-12-07 21:21:44,256 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:21:44,338 INFO L614 ElimStorePlain]: treesize reduction 22, result has 70.3 percent of original size [2019-12-07 21:21:44,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:44,339 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 21:21:44,339 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:52 [2019-12-07 21:21:44,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:44,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:44,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:44,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:44,699 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 31 treesize of output 19 [2019-12-07 21:21:44,700 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:21:44,713 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:21:44,713 INFO L534 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-12-07 21:21:44,714 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:19 [2019-12-07 21:21:44,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:44,784 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:21:44,784 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:21:45,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:45,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:45,486 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:21:45,486 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 49 treesize of output 33 [2019-12-07 21:21:45,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:45,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:45,487 INFO L534 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 21:21:45,522 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:21:45,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:45,523 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 21:21:45,524 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:33 [2019-12-07 21:21:45,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:45,657 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:21:45,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [241778342] [2019-12-07 21:21:45,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [942755398] [2019-12-07 21:21:45,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c7415de1-6752-485e-b282-dac27b9c9c41/bin/utaipan/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-12-07 21:21:45,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:21:45,732 INFO L264 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 20 conjunts are in the unsatisfiable core [2019-12-07 21:21:45,733 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:21:45,763 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:21:45,764 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 44 [2019-12-07 21:21:45,764 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:21:45,840 INFO L614 ElimStorePlain]: treesize reduction 22, result has 70.3 percent of original size [2019-12-07 21:21:45,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:45,841 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 21:21:45,841 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:52 [2019-12-07 21:21:45,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:45,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:45,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:46,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:46,012 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 31 treesize of output 19 [2019-12-07 21:21:46,012 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:21:46,024 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:21:46,024 INFO L534 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-12-07 21:21:46,024 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:19 [2019-12-07 21:21:46,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:46,033 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:21:46,034 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:21:46,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:46,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:46,158 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:21:46,158 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 49 treesize of output 33 [2019-12-07 21:21:46,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:46,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:46,159 INFO L534 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 21:21:46,192 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:21:46,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:46,193 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 21:21:46,193 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:33 [2019-12-07 21:21:46,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:46,588 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:21:46,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2093896431] [2019-12-07 21:21:46,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c7415de1-6752-485e-b282-dac27b9c9c41/bin/utaipan/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-12-07 21:21:46,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:21:46,640 INFO L264 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 20 conjunts are in the unsatisfiable core [2019-12-07 21:21:46,641 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:21:46,671 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:21:46,671 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 44 [2019-12-07 21:21:46,672 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:21:46,738 INFO L614 ElimStorePlain]: treesize reduction 22, result has 70.3 percent of original size [2019-12-07 21:21:46,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:46,739 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 21:21:46,739 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:52 [2019-12-07 21:21:46,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:46,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:46,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:46,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:46,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 31 treesize of output 19 [2019-12-07 21:21:46,919 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:21:46,932 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:21:46,933 INFO L534 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-12-07 21:21:46,933 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:19 [2019-12-07 21:21:46,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:46,943 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:21:46,943 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:21:47,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:47,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:47,070 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:21:47,070 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 49 treesize of output 33 [2019-12-07 21:21:47,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:47,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:47,072 INFO L534 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 21:21:47,102 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:21:47,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:47,104 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 21:21:47,104 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:33 [2019-12-07 21:21:47,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:47,678 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:21:47,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 21:21:47,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12, 12, 12, 12] total 22 [2019-12-07 21:21:47,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653213425] [2019-12-07 21:21:47,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-07 21:21:47,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 21:21:47,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-07 21:21:47,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2019-12-07 21:21:47,679 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand 22 states. [2019-12-07 21:21:48,388 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-12-07 21:21:50,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:21:50,300 INFO L93 Difference]: Finished difference Result 112 states and 146 transitions. [2019-12-07 21:21:50,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-07 21:21:50,300 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 19 [2019-12-07 21:21:50,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:21:50,301 INFO L225 Difference]: With dead ends: 112 [2019-12-07 21:21:50,301 INFO L226 Difference]: Without dead ends: 106 [2019-12-07 21:21:50,302 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 76 SyntacticMatches, 12 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=220, Invalid=902, Unknown=0, NotChecked=0, Total=1122 [2019-12-07 21:21:50,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-12-07 21:21:50,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 35. [2019-12-07 21:21:50,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-12-07 21:21:50,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2019-12-07 21:21:50,308 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 45 transitions. Word has length 19 [2019-12-07 21:21:50,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:21:50,308 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 45 transitions. [2019-12-07 21:21:50,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-07 21:21:50,308 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2019-12-07 21:21:50,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 21:21:50,309 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:21:50,309 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:21:50,910 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,7 mathsat -unsat_core_generation=3,8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 21:21:50,912 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:21:50,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:21:50,913 INFO L82 PathProgramCache]: Analyzing trace with hash 994661595, now seen corresponding path program 2 times [2019-12-07 21:21:50,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 21:21:50,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2044006422] [2019-12-07 21:21:50,914 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c7415de1-6752-485e-b282-dac27b9c9c41/bin/utaipan/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-12-07 21:21:50,962 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 21:21:50,962 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 21:21:50,965 INFO L264 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 21:21:50,966 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:21:51,044 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 21:21:51,044 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:21:51,255 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 21:21:51,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2044006422] [2019-12-07 21:21:51,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [5569469] [2019-12-07 21:21:51,255 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c7415de1-6752-485e-b282-dac27b9c9c41/bin/utaipan/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 21:21:51,324 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 21:21:51,324 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 21:21:51,326 INFO L264 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 21:21:51,326 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:21:51,329 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 21:21:51,329 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:21:51,526 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 21:21:51,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1072974908] [2019-12-07 21:21:51,526 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c7415de1-6752-485e-b282-dac27b9c9c41/bin/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:21:51,557 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 21:21:51,557 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 21:21:51,559 INFO L264 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 21:21:51,560 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:21:51,562 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 21:21:51,563 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:21:51,565 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 21:21:51,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 21:21:51,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 8, 8, 8, 8] total 22 [2019-12-07 21:21:51,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795340951] [2019-12-07 21:21:51,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-07 21:21:51,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 21:21:51,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-07 21:21:51,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2019-12-07 21:21:51,566 INFO L87 Difference]: Start difference. First operand 35 states and 45 transitions. Second operand 22 states. [2019-12-07 21:21:52,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:21:52,740 INFO L93 Difference]: Finished difference Result 119 states and 152 transitions. [2019-12-07 21:21:52,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-07 21:21:52,741 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2019-12-07 21:21:52,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:21:52,742 INFO L225 Difference]: With dead ends: 119 [2019-12-07 21:21:52,742 INFO L226 Difference]: Without dead ends: 97 [2019-12-07 21:21:52,743 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=317, Invalid=943, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 21:21:52,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-12-07 21:21:52,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 80. [2019-12-07 21:21:52,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-12-07 21:21:52,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 106 transitions. [2019-12-07 21:21:52,751 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 106 transitions. Word has length 21 [2019-12-07 21:21:52,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:21:52,751 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 106 transitions. [2019-12-07 21:21:52,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-07 21:21:52,751 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 106 transitions. [2019-12-07 21:21:52,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 21:21:52,752 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:21:52,752 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:21:53,353 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,10 mathsat -unsat_core_generation=3,11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 21:21:53,356 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:21:53,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:21:53,357 INFO L82 PathProgramCache]: Analyzing trace with hash 663173197, now seen corresponding path program 3 times [2019-12-07 21:21:53,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 21:21:53,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1648747516] [2019-12-07 21:21:53,358 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c7415de1-6752-485e-b282-dac27b9c9c41/bin/utaipan/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2019-12-07 21:21:53,424 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-07 21:21:53,424 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 21:21:53,427 INFO L264 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 27 conjunts are in the unsatisfiable core [2019-12-07 21:21:53,429 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:21:53,912 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:21:53,912 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 63 treesize of output 101 [2019-12-07 21:21:53,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:53,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:53,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:53,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:53,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:53,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:53,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:53,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:53,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:53,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:53,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:53,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:53,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:53,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:53,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:53,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:53,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:53,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:53,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:53,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:53,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:53,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:53,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:53,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:53,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:53,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:53,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:53,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:53,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:53,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:53,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:53,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:21:53,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:53,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:53,928 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 21:21:54,064 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 32 [2019-12-07 21:21:54,064 INFO L614 ElimStorePlain]: treesize reduction 77, result has 46.2 percent of original size [2019-12-07 21:21:54,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:54,065 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 21:21:54,065 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:69, output treesize:87 [2019-12-07 21:21:54,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:54,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:54,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:54,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:54,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:54,653 INFO L430 ElimStorePlain]: Different costs {2=[|#memory_int|], 5=[v_prenex_5]} [2019-12-07 21:21:54,663 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:21:54,664 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:21:54,664 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 1 case distinctions, treesize of input 57 treesize of output 21 [2019-12-07 21:21:54,664 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 21:21:54,863 WARN L192 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 37 [2019-12-07 21:21:54,863 INFO L614 ElimStorePlain]: treesize reduction 6, result has 94.5 percent of original size [2019-12-07 21:21:54,895 INFO L343 Elim1Store]: treesize reduction 14, result has 57.6 percent of original size [2019-12-07 21:21:54,895 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 46 [2019-12-07 21:21:54,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:54,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:54,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:54,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:54,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:54,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:54,898 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 21:21:55,080 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2019-12-07 21:21:55,080 INFO L614 ElimStorePlain]: treesize reduction 8, result has 88.4 percent of original size [2019-12-07 21:21:55,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:55,083 INFO L534 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2019-12-07 21:21:55,083 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:148, output treesize:62 [2019-12-07 21:21:55,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:21:55,217 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:21:55,217 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:22:00,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:22:02,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:22:02,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:22:02,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:22:02,963 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:22:02,963 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 66 [2019-12-07 21:22:02,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:22:02,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:22:02,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:22:02,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:22:02,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:22:02,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:22:02,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:22:02,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:22:02,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:22:02,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:22:02,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:22:02,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:22:02,970 INFO L534 ElimStorePlain]: Start of recursive call 2: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-07 21:22:03,065 INFO L614 ElimStorePlain]: treesize reduction 9, result has 86.4 percent of original size [2019-12-07 21:22:03,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:22:03,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:22:03,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:22:03,067 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-12-07 21:22:03,067 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:78, output treesize:57 [2019-12-07 21:22:03,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:22:03,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:22:03,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:22:03,638 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:22:03,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1648747516] [2019-12-07 21:22:03,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1972499906] [2019-12-07 21:22:03,639 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c7415de1-6752-485e-b282-dac27b9c9c41/bin/utaipan/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 21:22:03,723 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-07 21:22:03,723 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 21:22:03,725 INFO L264 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 21:22:03,726 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:22:04,321 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 21:22:04,321 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:22:05,091 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 21:22:05,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503301102] [2019-12-07 21:22:05,092 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c7415de1-6752-485e-b282-dac27b9c9c41/bin/utaipan/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-12-07 21:22:05,131 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-07 21:22:05,131 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 21:22:05,134 INFO L264 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 21:22:05,134 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:22:05,217 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 21:22:05,217 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:22:05,219 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 21:22:05,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 21:22:05,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 8, 8, 8, 8] total 41 [2019-12-07 21:22:05,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455885652] [2019-12-07 21:22:05,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-12-07 21:22:05,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 21:22:05,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-12-07 21:22:05,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=1434, Unknown=3, NotChecked=0, Total=1640 [2019-12-07 21:22:05,221 INFO L87 Difference]: Start difference. First operand 80 states and 106 transitions. Second operand 41 states. [2019-12-07 21:22:10,435 WARN L192 SmtUtils]: Spent 4.21 s on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-12-07 21:22:11,502 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-12-07 21:22:12,256 WARN L192 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 61 [2019-12-07 21:22:15,200 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-12-07 21:22:16,077 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-12-07 21:22:33,303 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-12-07 21:22:34,331 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-12-07 21:22:35,395 WARN L192 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-12-07 21:23:09,145 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-12-07 21:23:10,135 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-12-07 21:23:11,118 WARN L192 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 59 [2019-12-07 21:23:11,644 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 38 [2019-12-07 21:23:12,425 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-12-07 21:23:13,022 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-12-07 21:23:14,062 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-12-07 21:23:15,302 WARN L192 SmtUtils]: Spent 635.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 72 [2019-12-07 21:23:22,001 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-12-07 21:23:36,449 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-12-07 21:23:37,296 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-12-07 21:23:37,661 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-12-07 21:23:38,073 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-12-07 21:23:47,522 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-12-07 21:24:10,141 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-12-07 21:24:11,166 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-12-07 21:24:14,894 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-12-07 21:24:15,499 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-12-07 21:24:15,903 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 37 [2019-12-07 21:24:16,807 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-12-07 21:24:17,507 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-12-07 21:24:18,519 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-12-07 21:24:21,615 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-12-07 21:24:22,368 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-12-07 21:24:27,088 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-12-07 21:24:28,442 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-12-07 21:24:29,470 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-12-07 21:24:30,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:24:30,216 INFO L93 Difference]: Finished difference Result 337 states and 446 transitions. [2019-12-07 21:24:30,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-12-07 21:24:30,216 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 24 [2019-12-07 21:24:30,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:24:30,218 INFO L225 Difference]: With dead ends: 337 [2019-12-07 21:24:30,218 INFO L226 Difference]: Without dead ends: 329 [2019-12-07 21:24:30,224 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 100 SyntacticMatches, 6 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7058 ImplicationChecksByTransitivity, 50.2s TimeCoverageRelationStatistics Valid=3001, Invalid=17017, Unknown=4, NotChecked=0, Total=20022 [2019-12-07 21:24:30,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2019-12-07 21:24:30,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 50. [2019-12-07 21:24:30,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-12-07 21:24:30,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 63 transitions. [2019-12-07 21:24:30,236 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 63 transitions. Word has length 24 [2019-12-07 21:24:30,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:24:30,236 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 63 transitions. [2019-12-07 21:24:30,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-12-07 21:24:30,236 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 63 transitions. [2019-12-07 21:24:30,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 21:24:30,237 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:24:30,237 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:24:30,839 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3,14 cvc4 --incremental --print-success --lang smt --rewrite-divk,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 21:24:30,840 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:24:30,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:24:30,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1101330287, now seen corresponding path program 4 times [2019-12-07 21:24:30,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 21:24:30,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1267010012] [2019-12-07 21:24:30,842 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c7415de1-6752-485e-b282-dac27b9c9c41/bin/utaipan/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2019-12-07 21:24:30,977 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 21:24:30,977 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 21:24:30,982 WARN L262 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 33 conjunts are in the unsatisfiable core [2019-12-07 21:24:30,983 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:24:30,995 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 21:24:30,995 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:24:31,003 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:24:31,004 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 21:24:31,004 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2019-12-07 21:24:31,554 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 21:24:31,555 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:24:31,556 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 47 [2019-12-07 21:24:31,556 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:24:31,640 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:24:31,640 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 21:24:31,640 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:81, output treesize:94 [2019-12-07 21:24:31,938 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 21:24:31,939 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 0 case distinctions, treesize of input 85 treesize of output 58 [2019-12-07 21:24:31,940 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 21:24:31,973 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:24:31,974 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 21:24:31,974 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:95, output treesize:108 [2019-12-07 21:24:32,364 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 48 [2019-12-07 21:24:32,364 INFO L534 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 21:24:32,399 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:24:32,400 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 21:24:32,400 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:116, output treesize:46 [2019-12-07 21:24:32,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:24:32,654 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:24:32,655 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 21:24:36,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:24:36,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:24:40,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:24:40,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:24:40,875 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 21:24:40,875 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 231 treesize of output 201 [2019-12-07 21:24:40,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:24:40,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:24:40,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:24:40,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:24:40,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 21:24:40,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:24:40,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 21:24:40,880 INFO L430 ElimStorePlain]: Different costs {4=[v_arrayElimCell_48], 6=[v_arrayElimCell_49]} [2019-12-07 21:24:40,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1267010012] [2019-12-07 21:24:40,885 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@10a9ed4c [2019-12-07 21:24:40,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1326156798] [2019-12-07 21:24:40,885 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c7415de1-6752-485e-b282-dac27b9c9c41/bin/utaipan/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 21:24:41,001 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 21:24:41,001 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 21:24:41,003 WARN L262 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 33 conjunts are in the unsatisfiable core [2019-12-07 21:24:41,004 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:24:41,004 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@10a9ed4c [2019-12-07 21:24:41,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1386325304] [2019-12-07 21:24:41,004 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c7415de1-6752-485e-b282-dac27b9c9c41/bin/utaipan/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-12-07 21:24:41,121 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 21:24:41,121 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 21:24:41,124 WARN L262 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 34 conjunts are in the unsatisfiable core [2019-12-07 21:24:41,125 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 21:24:41,128 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@10a9ed4c [2019-12-07 21:24:41,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:24:41,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2019-12-07 21:24:41,128 ERROR L206 FreeRefinementEngine]: Strategy WALRUS failed to provide any proof altough trace is infeasible [2019-12-07 21:24:41,128 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 21:24:41,732 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3,18 z3 -smt2 -in SMTLIB2_COMPLIANT=true,17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 21:24:41,749 WARN L229 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2019-12-07 21:24:41,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 09:24:41 BoogieIcfgContainer [2019-12-07 21:24:41,749 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 21:24:41,749 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 21:24:41,749 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 21:24:41,749 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 21:24:41,750 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:20:15" (3/4) ... [2019-12-07 21:24:41,752 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 21:24:41,752 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 21:24:41,752 INFO L168 Benchmark]: Toolchain (without parser) took 266894.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 170.9 MB). Free memory was 953.7 MB in the beginning and 885.1 MB in the end (delta: 68.6 MB). Peak memory consumption was 239.5 MB. Max. memory is 11.5 GB. [2019-12-07 21:24:41,753 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 21:24:41,753 INFO L168 Benchmark]: CACSL2BoogieTranslator took 159.71 ms. Allocated memory is still 1.0 GB. Free memory was 953.7 MB in the beginning and 941.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2019-12-07 21:24:41,753 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 941.6 MB in the beginning and 1.1 GB in the end (delta: -181.3 MB). Peak memory consumption was 10.0 MB. Max. memory is 11.5 GB. [2019-12-07 21:24:41,753 INFO L168 Benchmark]: Boogie Preprocessor took 19.63 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 21:24:41,753 INFO L168 Benchmark]: RCFGBuilder took 214.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-12-07 21:24:41,754 INFO L168 Benchmark]: TraceAbstraction took 266434.03 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 37.2 MB). Free memory was 1.1 GB in the beginning and 885.1 MB in the end (delta: 219.7 MB). Peak memory consumption was 256.9 MB. Max. memory is 11.5 GB. [2019-12-07 21:24:41,754 INFO L168 Benchmark]: Witness Printer took 2.53 ms. Allocated memory is still 1.2 GB. Free memory is still 885.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 21:24:41,755 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 159.71 ms. Allocated memory is still 1.0 GB. Free memory was 953.7 MB in the beginning and 941.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 60.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 941.6 MB in the beginning and 1.1 GB in the end (delta: -181.3 MB). Peak memory consumption was 10.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.63 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 214.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 266434.03 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 37.2 MB). Free memory was 1.1 GB in the beginning and 885.1 MB in the end (delta: 219.7 MB). Peak memory consumption was 256.9 MB. Max. memory is 11.5 GB. * Witness Printer took 2.53 ms. Allocated memory is still 1.2 GB. Free memory is still 885.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 3]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L7] int i; [L8] int j=__VERIFIER_nondet_int(); [L10] int k = 0; [L11] int N=__VERIFIER_nondet_int(); [L13] int a[N+1]; [L14] int b[N]; [L16] i=0 [L16] COND TRUE i -10000 [L17] EXPR a[i] [L17] a[i] < 10000 && a[i] > -10000 [L18] EXPR a[i] [L18] COND TRUE j > a[i] [L19] EXPR a[i] [L19] j = a[i] [L16] i++ [L16] COND TRUE i -10000 [L17] EXPR a[i] [L17] a[i] < 10000 && a[i] > -10000 [L18] EXPR a[i] [L18] COND TRUE j > a[i] [L19] EXPR a[i] [L19] j = a[i] [L16] i++ [L16] COND FALSE !(i