./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/forester-heap/dll-token-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_686180ba-9add-4b5b-9a41-d5bc71b696b8/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_686180ba-9add-4b5b-9a41-d5bc71b696b8/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_686180ba-9add-4b5b-9a41-d5bc71b696b8/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_686180ba-9add-4b5b-9a41-d5bc71b696b8/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/forester-heap/dll-token-1.i -s /tmp/vcloud-vcloud-master/worker/working_dir_686180ba-9add-4b5b-9a41-d5bc71b696b8/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_686180ba-9add-4b5b-9a41-d5bc71b696b8/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 8b88a605df784da4b84aa984e355b57373efff76 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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/working_dir_686180ba-9add-4b5b-9a41-d5bc71b696b8/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_686180ba-9add-4b5b-9a41-d5bc71b696b8/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_686180ba-9add-4b5b-9a41-d5bc71b696b8/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_686180ba-9add-4b5b-9a41-d5bc71b696b8/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/forester-heap/dll-token-1.i -s /tmp/vcloud-vcloud-master/worker/working_dir_686180ba-9add-4b5b-9a41-d5bc71b696b8/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_686180ba-9add-4b5b-9a41-d5bc71b696b8/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 8b88a605df784da4b84aa984e355b57373efff76 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: expected NNF --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 11:22:35,035 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:22:35,036 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:22:35,047 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:22:35,047 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:22:35,048 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:22:35,049 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:22:35,050 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:22:35,052 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:22:35,053 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:22:35,054 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:22:35,055 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:22:35,055 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:22:35,058 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:22:35,059 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:22:35,059 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:22:35,060 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:22:35,061 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:22:35,062 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:22:35,072 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:22:35,074 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:22:35,074 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:22:35,075 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:22:35,076 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:22:35,077 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:22:35,078 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:22:35,078 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:22:35,078 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:22:35,079 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:22:35,082 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:22:35,083 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:22:35,083 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:22:35,084 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:22:35,084 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:22:35,085 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:22:35,085 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:22:35,086 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:22:35,086 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:22:35,086 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:22:35,087 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:22:35,087 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:22:35,091 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_686180ba-9add-4b5b-9a41-d5bc71b696b8/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-10-22 11:22:35,107 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:22:35,107 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:22:35,108 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:22:35,108 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:22:35,108 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:22:35,108 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:22:35,109 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:22:35,109 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:22:35,109 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:22:35,109 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:22:35,109 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:22:35,109 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:22:35,110 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:22:35,110 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:22:35,110 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:22:35,111 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:22:35,111 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:22:35,111 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:22:35,111 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:22:35,111 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:22:35,111 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:22:35,112 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:22:35,112 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:22:35,112 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:22:35,112 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:22:35,112 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:22:35,112 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:22:35,113 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:22:35,113 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:22:35,113 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:22:35,113 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:22:35,113 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:22:35,113 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:22:35,114 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:22:35,114 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:22:35,114 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/working_dir_686180ba-9add-4b5b-9a41-d5bc71b696b8/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 -> 8b88a605df784da4b84aa984e355b57373efff76 [2019-10-22 11:22:35,140 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:22:35,150 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:22:35,155 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:22:35,157 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:22:35,157 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:22:35,157 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_686180ba-9add-4b5b-9a41-d5bc71b696b8/bin/utaipan/../../sv-benchmarks/c/forester-heap/dll-token-1.i [2019-10-22 11:22:35,202 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_686180ba-9add-4b5b-9a41-d5bc71b696b8/bin/utaipan/data/6f8f79e59/cc0625fe8dbe400d9699e2f4adfe4975/FLAGad2d6ec00 [2019-10-22 11:22:35,624 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:22:35,625 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_686180ba-9add-4b5b-9a41-d5bc71b696b8/sv-benchmarks/c/forester-heap/dll-token-1.i [2019-10-22 11:22:35,642 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_686180ba-9add-4b5b-9a41-d5bc71b696b8/bin/utaipan/data/6f8f79e59/cc0625fe8dbe400d9699e2f4adfe4975/FLAGad2d6ec00 [2019-10-22 11:22:35,657 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_686180ba-9add-4b5b-9a41-d5bc71b696b8/bin/utaipan/data/6f8f79e59/cc0625fe8dbe400d9699e2f4adfe4975 [2019-10-22 11:22:35,659 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:22:35,660 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:22:35,661 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:22:35,661 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:22:35,664 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:22:35,665 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:22:35" (1/1) ... [2019-10-22 11:22:35,667 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ea50d3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:35, skipping insertion in model container [2019-10-22 11:22:35,668 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:22:35" (1/1) ... [2019-10-22 11:22:35,674 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:22:35,706 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:22:36,034 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:22:36,043 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:22:36,101 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:22:36,139 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:22:36,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:36 WrapperNode [2019-10-22 11:22:36,139 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:22:36,140 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:22:36,140 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:22:36,140 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:22:36,148 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:36" (1/1) ... [2019-10-22 11:22:36,162 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:36" (1/1) ... [2019-10-22 11:22:36,181 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:22:36,181 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:22:36,181 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:22:36,181 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:22:36,188 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:36" (1/1) ... [2019-10-22 11:22:36,188 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:36" (1/1) ... [2019-10-22 11:22:36,191 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:36" (1/1) ... [2019-10-22 11:22:36,191 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:36" (1/1) ... [2019-10-22 11:22:36,199 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:36" (1/1) ... [2019-10-22 11:22:36,209 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:36" (1/1) ... [2019-10-22 11:22:36,216 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:36" (1/1) ... [2019-10-22 11:22:36,218 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:22:36,219 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:22:36,219 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:22:36,219 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:22:36,221 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_686180ba-9add-4b5b-9a41-d5bc71b696b8/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-10-22 11:22:36,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 11:22:36,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 11:22:36,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 11:22:36,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 11:22:36,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 11:22:36,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 11:22:36,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:22:36,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:22:36,599 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:22:36,599 INFO L284 CfgBuilder]: Removed 19 assume(true) statements. [2019-10-22 11:22:36,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:22:36 BoogieIcfgContainer [2019-10-22 11:22:36,600 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:22:36,601 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:22:36,601 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:22:36,609 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:22:36,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:22:35" (1/3) ... [2019-10-22 11:22:36,620 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75c1db9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:22:36, skipping insertion in model container [2019-10-22 11:22:36,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:36" (2/3) ... [2019-10-22 11:22:36,621 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75c1db9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:22:36, skipping insertion in model container [2019-10-22 11:22:36,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:22:36" (3/3) ... [2019-10-22 11:22:36,627 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-token-1.i [2019-10-22 11:22:36,635 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:22:36,642 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-10-22 11:22:36,654 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-10-22 11:22:36,685 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:22:36,685 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:22:36,685 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:22:36,685 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:22:36,685 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:22:36,686 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:22:36,686 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:22:36,686 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:22:36,702 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2019-10-22 11:22:36,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-10-22 11:22:36,710 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:36,711 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-10-22 11:22:36,713 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:36,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:36,718 INFO L82 PathProgramCache]: Analyzing trace with hash 890337990, now seen corresponding path program 1 times [2019-10-22 11:22:36,726 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:36,726 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740137442] [2019-10-22 11:22:36,726 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:36,726 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:36,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:36,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:36,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:36,852 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740137442] [2019-10-22 11:22:36,853 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:36,853 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:22:36,853 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996179367] [2019-10-22 11:22:36,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-22 11:22:36,857 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:36,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 11:22:36,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 11:22:36,872 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 2 states. [2019-10-22 11:22:36,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:36,888 INFO L93 Difference]: Finished difference Result 86 states and 132 transitions. [2019-10-22 11:22:36,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 11:22:36,889 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 6 [2019-10-22 11:22:36,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:36,897 INFO L225 Difference]: With dead ends: 86 [2019-10-22 11:22:36,898 INFO L226 Difference]: Without dead ends: 39 [2019-10-22 11:22:36,900 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 11:22:36,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-22 11:22:36,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-10-22 11:22:36,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-22 11:22:36,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2019-10-22 11:22:36,931 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 6 [2019-10-22 11:22:36,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:36,931 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2019-10-22 11:22:36,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-22 11:22:36,932 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2019-10-22 11:22:36,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-10-22 11:22:36,932 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:36,932 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-10-22 11:22:36,932 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:36,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:36,933 INFO L82 PathProgramCache]: Analyzing trace with hash 889571369, now seen corresponding path program 1 times [2019-10-22 11:22:36,933 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:36,933 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002878812] [2019-10-22 11:22:36,933 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:36,933 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:36,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:36,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:37,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:37,025 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002878812] [2019-10-22 11:22:37,025 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:37,025 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:22:37,025 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515370623] [2019-10-22 11:22:37,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:22:37,027 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:37,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:22:37,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:22:37,028 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 4 states. [2019-10-22 11:22:37,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:37,113 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2019-10-22 11:22:37,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:22:37,114 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-10-22 11:22:37,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:37,114 INFO L225 Difference]: With dead ends: 39 [2019-10-22 11:22:37,114 INFO L226 Difference]: Without dead ends: 37 [2019-10-22 11:22:37,115 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:22:37,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-10-22 11:22:37,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-10-22 11:22:37,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-22 11:22:37,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2019-10-22 11:22:37,120 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 6 [2019-10-22 11:22:37,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:37,120 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2019-10-22 11:22:37,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:22:37,120 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2019-10-22 11:22:37,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-10-22 11:22:37,121 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:37,121 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:37,121 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:37,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:37,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1806865149, now seen corresponding path program 1 times [2019-10-22 11:22:37,122 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:37,122 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515669997] [2019-10-22 11:22:37,122 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:37,122 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:37,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:37,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:37,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:37,183 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515669997] [2019-10-22 11:22:37,184 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:37,184 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:22:37,184 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669214972] [2019-10-22 11:22:37,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:22:37,184 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:37,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:22:37,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:22:37,185 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 4 states. [2019-10-22 11:22:37,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:37,284 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2019-10-22 11:22:37,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:22:37,285 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-10-22 11:22:37,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:37,286 INFO L225 Difference]: With dead ends: 63 [2019-10-22 11:22:37,286 INFO L226 Difference]: Without dead ends: 61 [2019-10-22 11:22:37,286 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:22:37,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-10-22 11:22:37,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 35. [2019-10-22 11:22:37,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-22 11:22:37,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2019-10-22 11:22:37,291 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 7 [2019-10-22 11:22:37,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:37,291 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2019-10-22 11:22:37,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:22:37,294 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2019-10-22 11:22:37,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-22 11:22:37,294 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:37,294 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:37,295 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:37,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:37,295 INFO L82 PathProgramCache]: Analyzing trace with hash -913382283, now seen corresponding path program 1 times [2019-10-22 11:22:37,295 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:37,295 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417492649] [2019-10-22 11:22:37,295 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:37,296 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:37,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:37,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:37,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:37,380 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417492649] [2019-10-22 11:22:37,380 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:37,380 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:22:37,380 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042102994] [2019-10-22 11:22:37,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:22:37,380 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:37,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:22:37,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:22:37,381 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 5 states. [2019-10-22 11:22:37,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:37,462 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2019-10-22 11:22:37,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:22:37,463 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-10-22 11:22:37,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:37,463 INFO L225 Difference]: With dead ends: 35 [2019-10-22 11:22:37,463 INFO L226 Difference]: Without dead ends: 33 [2019-10-22 11:22:37,464 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:22:37,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-22 11:22:37,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-10-22 11:22:37,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-22 11:22:37,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2019-10-22 11:22:37,470 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 12 [2019-10-22 11:22:37,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:37,471 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2019-10-22 11:22:37,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:22:37,471 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2019-10-22 11:22:37,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-22 11:22:37,479 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:37,479 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:37,479 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:37,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:37,480 INFO L82 PathProgramCache]: Analyzing trace with hash -913344547, now seen corresponding path program 1 times [2019-10-22 11:22:37,480 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:37,480 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374922838] [2019-10-22 11:22:37,480 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:37,480 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:37,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:37,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:37,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:37,659 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374922838] [2019-10-22 11:22:37,659 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:37,659 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:22:37,659 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964497949] [2019-10-22 11:22:37,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:22:37,660 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:37,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:22:37,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:22:37,660 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 5 states. [2019-10-22 11:22:37,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:37,815 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2019-10-22 11:22:37,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:22:37,816 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-10-22 11:22:37,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:37,816 INFO L225 Difference]: With dead ends: 68 [2019-10-22 11:22:37,816 INFO L226 Difference]: Without dead ends: 44 [2019-10-22 11:22:37,817 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:22:37,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-10-22 11:22:37,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2019-10-22 11:22:37,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-10-22 11:22:37,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2019-10-22 11:22:37,826 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 12 [2019-10-22 11:22:37,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:37,826 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2019-10-22 11:22:37,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:22:37,826 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2019-10-22 11:22:37,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-22 11:22:37,827 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:37,827 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:37,827 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:37,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:37,828 INFO L82 PathProgramCache]: Analyzing trace with hash -313255267, now seen corresponding path program 1 times [2019-10-22 11:22:37,828 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:37,828 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493485703] [2019-10-22 11:22:37,828 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:37,828 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:37,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:37,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:37,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:37,974 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493485703] [2019-10-22 11:22:37,974 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:37,974 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:22:37,975 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911170581] [2019-10-22 11:22:37,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:22:37,975 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:37,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:22:37,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:22:37,976 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 6 states. [2019-10-22 11:22:38,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:38,148 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2019-10-22 11:22:38,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:22:38,149 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-10-22 11:22:38,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:38,150 INFO L225 Difference]: With dead ends: 50 [2019-10-22 11:22:38,150 INFO L226 Difference]: Without dead ends: 48 [2019-10-22 11:22:38,151 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:22:38,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-10-22 11:22:38,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2019-10-22 11:22:38,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-22 11:22:38,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2019-10-22 11:22:38,155 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 16 [2019-10-22 11:22:38,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:38,155 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2019-10-22 11:22:38,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:22:38,155 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2019-10-22 11:22:38,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-22 11:22:38,156 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:38,156 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:38,156 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:38,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:38,157 INFO L82 PathProgramCache]: Analyzing trace with hash -648614522, now seen corresponding path program 1 times [2019-10-22 11:22:38,157 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:38,157 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495654530] [2019-10-22 11:22:38,158 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:38,158 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:38,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:38,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:38,333 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:38,334 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495654530] [2019-10-22 11:22:38,334 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077488071] [2019-10-22 11:22:38,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_686180ba-9add-4b5b-9a41-d5bc71b696b8/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-10-22 11:22:38,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:38,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 32 conjunts are in the unsatisfiable core [2019-10-22 11:22:38,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:22:38,473 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-22 11:22:38,473 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:38,490 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:38,501 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-10-22 11:22:38,502 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:38,520 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:38,521 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:22:38,521 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:24 [2019-10-22 11:22:38,588 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:38,589 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-22 11:22:38,590 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:38,680 INFO L567 ElimStorePlain]: treesize reduction 14, result has 88.4 percent of original size [2019-10-22 11:22:38,691 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:22:38,726 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:38,731 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:22:38,758 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:38,772 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:22:38,774 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:38,795 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:38,805 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:22:38,821 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:38,822 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 64 [2019-10-22 11:22:38,823 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:38,870 INFO L567 ElimStorePlain]: treesize reduction 18, result has 77.8 percent of original size [2019-10-22 11:22:38,872 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:22:38,872 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:109, output treesize:36 [2019-10-22 11:22:38,929 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:38,929 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-10-22 11:22:38,930 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:38,968 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:38,970 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_19|, |v_#memory_$Pointer$.base_19|, |v_#memory_int_29|, |v_#memory_int_30|], 10=[|v_#memory_int_32|]} [2019-10-22 11:22:38,974 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:22:38,974 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:39,029 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:39,033 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:22:39,033 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:39,062 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:39,064 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:22:39,085 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:39,087 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:22:39,106 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:39,125 INFO L341 Elim1Store]: treesize reduction 48, result has 28.4 percent of original size [2019-10-22 11:22:39,126 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 48 [2019-10-22 11:22:39,128 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:39,152 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:39,153 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-10-22 11:22:39,154 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 10 variables, input treesize:181, output treesize:41 [2019-10-22 11:22:39,214 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 33 treesize of output 13 [2019-10-22 11:22:39,214 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:39,225 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:39,226 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:22:39,226 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:45, output treesize:3 [2019-10-22 11:22:39,229 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:39,229 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:22:39,241 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_19|, |v_#memory_$Pointer$.base_19|, |v_#memory_int_30|], 3=[|v_#memory_int_29|]} [2019-10-22 11:22:39,248 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:39,337 INFO L567 ElimStorePlain]: treesize reduction 11, result has 95.1 percent of original size [2019-10-22 11:22:39,345 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:39,438 INFO L567 ElimStorePlain]: treesize reduction 79, result has 54.6 percent of original size [2019-10-22 11:22:39,443 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:22:39,470 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:39,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:22:39,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:22:39,476 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:22:39,493 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:39,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:22:39,494 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-10-22 11:22:39,495 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:157, output treesize:157 [2019-10-22 11:22:39,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:22:39,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:22:39,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:22:40,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:22:40,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:22:40,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:22:40,229 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.base|, |v_#memory_int_27|], 10=[|v_#memory_int_28|]} [2019-10-22 11:22:40,249 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:40,269 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:40,281 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:40,431 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 57 [2019-10-22 11:22:40,431 INFO L567 ElimStorePlain]: treesize reduction 648, result has 13.6 percent of original size [2019-10-22 11:22:40,436 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:22:40,450 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:40,452 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:22:40,462 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:40,463 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 3 dim-2 vars, End of recursive call: 9 dim-0 vars, and 1 xjuncts. [2019-10-22 11:22:40,463 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 10 variables, input treesize:1096, output treesize:108 [2019-10-22 11:22:40,520 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:40,520 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-22 11:22:40,520 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 11 [2019-10-22 11:22:40,520 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834247578] [2019-10-22 11:22:40,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:22:40,521 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:40,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:22:40,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-10-22 11:22:40,522 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 6 states. [2019-10-22 11:22:46,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:46,354 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2019-10-22 11:22:46,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:22:46,355 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-10-22 11:22:46,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:46,355 INFO L225 Difference]: With dead ends: 58 [2019-10-22 11:22:46,356 INFO L226 Difference]: Without dead ends: 56 [2019-10-22 11:22:46,356 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-10-22 11:22:46,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-10-22 11:22:46,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2019-10-22 11:22:46,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-10-22 11:22:46,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2019-10-22 11:22:46,362 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 16 [2019-10-22 11:22:46,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:46,362 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2019-10-22 11:22:46,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:22:46,363 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2019-10-22 11:22:46,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-22 11:22:46,364 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:46,364 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:46,564 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:22:46,565 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:46,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:46,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1000772550, now seen corresponding path program 1 times [2019-10-22 11:22:46,565 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:46,565 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525954003] [2019-10-22 11:22:46,565 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:46,565 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:46,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:46,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:46,690 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:46,690 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525954003] [2019-10-22 11:22:46,691 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1014460859] [2019-10-22 11:22:46,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_686180ba-9add-4b5b-9a41-d5bc71b696b8/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-10-22 11:22:46,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:46,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 33 conjunts are in the unsatisfiable core [2019-10-22 11:22:46,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:22:46,736 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-22 11:22:46,736 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:46,742 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:46,745 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-10-22 11:22:46,745 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:46,752 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:46,752 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:22:46,753 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:24 [2019-10-22 11:22:46,794 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:46,794 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-22 11:22:46,795 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:46,841 INFO L567 ElimStorePlain]: treesize reduction 14, result has 88.4 percent of original size [2019-10-22 11:22:46,844 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:22:46,845 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:46,864 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:46,866 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:22:46,886 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:46,890 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:22:46,908 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:46,920 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:22:46,931 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:46,932 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 64 [2019-10-22 11:22:46,932 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:46,961 INFO L567 ElimStorePlain]: treesize reduction 18, result has 77.8 percent of original size [2019-10-22 11:22:46,961 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:22:46,962 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:109, output treesize:36 [2019-10-22 11:22:47,002 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:47,002 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-10-22 11:22:47,003 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:47,032 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:47,033 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_24|, |v_#memory_int_39|, |v_#memory_$Pointer$.offset_23|, |v_#memory_int_40|], 10=[|v_#memory_int_42|]} [2019-10-22 11:22:47,036 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:22:47,036 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:47,067 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:47,069 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:22:47,089 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:47,096 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:22:47,096 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:47,113 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:47,115 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:22:47,141 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:47,160 INFO L341 Elim1Store]: treesize reduction 48, result has 28.4 percent of original size [2019-10-22 11:22:47,160 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 48 [2019-10-22 11:22:47,161 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:47,177 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:47,178 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-10-22 11:22:47,178 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 10 variables, input treesize:181, output treesize:41 [2019-10-22 11:22:47,214 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 33 treesize of output 13 [2019-10-22 11:22:47,215 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:47,221 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:47,222 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:22:47,222 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:45, output treesize:3 [2019-10-22 11:22:47,234 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:47,234 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:22:47,239 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_24|, |v_#memory_$Pointer$.offset_23|, |v_#memory_int_40|], 3=[|v_#memory_int_39|]} [2019-10-22 11:22:47,245 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:47,371 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2019-10-22 11:22:47,371 INFO L567 ElimStorePlain]: treesize reduction 70, result has 58.3 percent of original size [2019-10-22 11:22:47,377 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:47,424 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:47,427 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:22:47,480 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:47,681 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:22:47,682 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: java.lang.UnsupportedOperationException: expected NNF at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:307) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.lang.UnsupportedOperationException: expected NNF at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:236) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive$TermWalker.walk(NonRecursive.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:195) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder.(ArrayOccurrenceAnalysis.java:181) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.(ArrayOccurrenceAnalysis.java:74) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:275) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:335) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:299) ... 21 more [2019-10-22 11:22:47,686 INFO L168 Benchmark]: Toolchain (without parser) took 12025.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 177.7 MB). Free memory was 937.8 MB in the beginning and 1.2 GB in the end (delta: -222.8 MB). Peak memory consumption was 211.9 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:47,686 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:22:47,687 INFO L168 Benchmark]: CACSL2BoogieTranslator took 478.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 937.8 MB in the beginning and 1.1 GB in the end (delta: -193.3 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:47,697 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:47,698 INFO L168 Benchmark]: Boogie Preprocessor took 37.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:47,698 INFO L168 Benchmark]: RCFGBuilder took 381.94 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: 27.7 MB). Peak memory consumption was 27.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:47,699 INFO L168 Benchmark]: TraceAbstraction took 11083.86 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 30.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -64.0 MB). Peak memory consumption was 223.5 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:47,701 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.29 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 478.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 937.8 MB in the beginning and 1.1 GB in the end (delta: -193.3 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 381.94 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: 27.7 MB). Peak memory consumption was 27.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11083.86 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 30.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -64.0 MB). Peak memory consumption was 223.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: java.lang.UnsupportedOperationException: expected NNF de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: java.lang.UnsupportedOperationException: expected NNF: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:307) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-10-22 11:22:49,662 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:22:49,663 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:22:49,673 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:22:49,673 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:22:49,674 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:22:49,675 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:22:49,676 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:22:49,678 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:22:49,678 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:22:49,679 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:22:49,680 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:22:49,680 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:22:49,681 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:22:49,682 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:22:49,683 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:22:49,684 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:22:49,684 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:22:49,686 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:22:49,688 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:22:49,689 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:22:49,690 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:22:49,691 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:22:49,692 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:22:49,694 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:22:49,694 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:22:49,694 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:22:49,695 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:22:49,695 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:22:49,696 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:22:49,697 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:22:49,697 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:22:49,698 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:22:49,698 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:22:49,699 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:22:49,700 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:22:49,700 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:22:49,701 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:22:49,701 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:22:49,701 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:22:49,702 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:22:49,703 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_686180ba-9add-4b5b-9a41-d5bc71b696b8/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2019-10-22 11:22:49,715 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:22:49,715 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:22:49,716 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:22:49,716 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:22:49,716 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:22:49,716 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:22:49,717 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:22:49,717 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:22:49,717 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:22:49,718 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:22:49,718 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:22:49,718 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:22:49,718 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:22:49,718 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:22:49,718 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:22:49,718 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:22:49,719 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-10-22 11:22:49,719 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-10-22 11:22:49,719 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:22:49,719 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:22:49,719 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 11:22:49,719 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:22:49,720 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:22:49,720 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:22:49,720 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:22:49,720 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:22:49,720 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:22:49,720 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:22:49,721 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:22:49,721 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:22:49,721 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-10-22 11:22:49,721 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-10-22 11:22:49,721 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:22:49,721 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:22:49,722 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/working_dir_686180ba-9add-4b5b-9a41-d5bc71b696b8/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 -> 8b88a605df784da4b84aa984e355b57373efff76 [2019-10-22 11:22:49,749 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:22:49,759 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:22:49,762 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:22:49,763 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:22:49,764 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:22:49,764 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_686180ba-9add-4b5b-9a41-d5bc71b696b8/bin/utaipan/../../sv-benchmarks/c/forester-heap/dll-token-1.i [2019-10-22 11:22:49,814 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_686180ba-9add-4b5b-9a41-d5bc71b696b8/bin/utaipan/data/975de0228/1ef3d9d8b9734bc88e101fc21783279e/FLAG09d18f38f [2019-10-22 11:22:50,280 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:22:50,280 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_686180ba-9add-4b5b-9a41-d5bc71b696b8/sv-benchmarks/c/forester-heap/dll-token-1.i [2019-10-22 11:22:50,293 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_686180ba-9add-4b5b-9a41-d5bc71b696b8/bin/utaipan/data/975de0228/1ef3d9d8b9734bc88e101fc21783279e/FLAG09d18f38f [2019-10-22 11:22:50,784 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_686180ba-9add-4b5b-9a41-d5bc71b696b8/bin/utaipan/data/975de0228/1ef3d9d8b9734bc88e101fc21783279e [2019-10-22 11:22:50,786 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:22:50,787 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:22:50,788 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:22:50,788 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:22:50,791 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:22:50,792 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:22:50" (1/1) ... [2019-10-22 11:22:50,795 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34d9d7b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:50, skipping insertion in model container [2019-10-22 11:22:50,795 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:22:50" (1/1) ... [2019-10-22 11:22:50,801 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:22:50,839 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:22:51,169 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:22:51,181 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:22:51,219 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:22:51,255 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:22:51,255 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:51 WrapperNode [2019-10-22 11:22:51,255 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:22:51,257 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:22:51,257 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:22:51,257 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:22:51,265 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:51" (1/1) ... [2019-10-22 11:22:51,282 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:51" (1/1) ... [2019-10-22 11:22:51,299 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:22:51,299 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:22:51,300 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:22:51,300 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:22:51,307 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:51" (1/1) ... [2019-10-22 11:22:51,307 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:51" (1/1) ... [2019-10-22 11:22:51,313 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:51" (1/1) ... [2019-10-22 11:22:51,313 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:51" (1/1) ... [2019-10-22 11:22:51,330 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:51" (1/1) ... [2019-10-22 11:22:51,339 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:51" (1/1) ... [2019-10-22 11:22:51,342 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:51" (1/1) ... [2019-10-22 11:22:51,345 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:22:51,346 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:22:51,346 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:22:51,346 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:22:51,347 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_686180ba-9add-4b5b-9a41-d5bc71b696b8/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-10-22 11:22:51,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-10-22 11:22:51,390 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 11:22:51,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 11:22:51,391 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 11:22:51,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 11:22:51,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-10-22 11:22:51,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:22:51,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:22:51,845 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:22:51,846 INFO L284 CfgBuilder]: Removed 19 assume(true) statements. [2019-10-22 11:22:51,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:22:51 BoogieIcfgContainer [2019-10-22 11:22:51,847 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:22:51,848 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:22:51,848 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:22:51,850 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:22:51,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:22:50" (1/3) ... [2019-10-22 11:22:51,852 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f6bc554 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:22:51, skipping insertion in model container [2019-10-22 11:22:51,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:51" (2/3) ... [2019-10-22 11:22:51,852 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f6bc554 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:22:51, skipping insertion in model container [2019-10-22 11:22:51,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:22:51" (3/3) ... [2019-10-22 11:22:51,854 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-token-1.i [2019-10-22 11:22:51,863 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:22:51,870 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-10-22 11:22:51,880 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-10-22 11:22:51,912 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:22:51,912 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:22:51,912 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:22:51,913 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:22:51,913 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:22:51,913 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:22:51,913 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:22:51,913 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:22:51,927 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2019-10-22 11:22:51,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-10-22 11:22:51,932 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:51,932 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-10-22 11:22:51,934 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:51,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:51,938 INFO L82 PathProgramCache]: Analyzing trace with hash 28699849, now seen corresponding path program 1 times [2019-10-22 11:22:51,944 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:22:51,944 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1098015601] [2019-10-22 11:22:51,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_686180ba-9add-4b5b-9a41-d5bc71b696b8/bin/utaipan/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:22:52,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:52,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-22 11:22:52,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:22:52,114 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-22 11:22:52,115 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:52,129 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:52,129 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:22:52,130 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-10-22 11:22:52,179 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:52,179 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 15 [2019-10-22 11:22:52,180 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:52,199 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:52,204 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:22:52,206 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:52,217 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:52,219 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:22:52,219 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:48, output treesize:4 [2019-10-22 11:22:52,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:52,233 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:22:52,251 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:52,264 INFO L567 ElimStorePlain]: treesize reduction 37, result has 2.6 percent of original size [2019-10-22 11:22:52,264 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:22:52,264 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:1 [2019-10-22 11:22:52,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:52,266 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1098015601] [2019-10-22 11:22:52,266 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:52,267 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 3] imperfect sequences [] total 4 [2019-10-22 11:22:52,267 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797317614] [2019-10-22 11:22:52,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:22:52,273 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:22:52,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:22:52,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:22:52,290 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 4 states. [2019-10-22 11:22:52,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:52,876 INFO L93 Difference]: Finished difference Result 82 states and 128 transitions. [2019-10-22 11:22:52,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:22:52,878 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-10-22 11:22:52,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:52,887 INFO L225 Difference]: With dead ends: 82 [2019-10-22 11:22:52,887 INFO L226 Difference]: Without dead ends: 36 [2019-10-22 11:22:52,890 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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-10-22 11:22:52,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-10-22 11:22:52,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-10-22 11:22:52,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-22 11:22:52,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2019-10-22 11:22:52,915 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 5 [2019-10-22 11:22:52,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:52,916 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2019-10-22 11:22:52,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:22:52,917 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2019-10-22 11:22:52,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-10-22 11:22:52,917 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:52,918 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-10-22 11:22:53,118 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:22:53,119 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:53,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:53,119 INFO L82 PathProgramCache]: Analyzing trace with hash 889651804, now seen corresponding path program 1 times [2019-10-22 11:22:53,120 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:22:53,120 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2032853349] [2019-10-22 11:22:53,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_686180ba-9add-4b5b-9a41-d5bc71b696b8/bin/utaipan/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:22:53,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:53,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 11:22:53,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:22:53,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-10-22 11:22:53,219 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:22:53,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:53,222 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2032853349] [2019-10-22 11:22:53,222 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:53,222 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-10-22 11:22:53,222 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089315060] [2019-10-22 11:22:53,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:22:53,227 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:22:53,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:22:53,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:22:53,230 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 4 states. [2019-10-22 11:22:53,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:53,372 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2019-10-22 11:22:53,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:22:53,373 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-10-22 11:22:53,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:53,374 INFO L225 Difference]: With dead ends: 62 [2019-10-22 11:22:53,374 INFO L226 Difference]: Without dead ends: 60 [2019-10-22 11:22:53,375 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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-10-22 11:22:53,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-10-22 11:22:53,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 34. [2019-10-22 11:22:53,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-22 11:22:53,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2019-10-22 11:22:53,381 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 6 [2019-10-22 11:22:53,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:53,381 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2019-10-22 11:22:53,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:22:53,382 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2019-10-22 11:22:53,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-22 11:22:53,382 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:53,382 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:53,583 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:22:53,584 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:53,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:53,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1061836619, now seen corresponding path program 1 times [2019-10-22 11:22:53,584 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:22:53,585 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1338708632] [2019-10-22 11:22:53,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_686180ba-9add-4b5b-9a41-d5bc71b696b8/bin/utaipan/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:22:53,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:53,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 11:22:53,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:22:53,688 INFO L375 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 21 treesize of output 9 [2019-10-22 11:22:53,689 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:53,698 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:53,699 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:22:53,699 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:3 [2019-10-22 11:22:53,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:53,710 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:22:53,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:53,736 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1338708632] [2019-10-22 11:22:53,737 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:53,737 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 6 [2019-10-22 11:22:53,737 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116385182] [2019-10-22 11:22:53,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:22:53,737 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:22:53,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:22:53,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:22:53,738 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 6 states. [2019-10-22 11:22:55,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:55,268 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2019-10-22 11:22:55,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:22:55,269 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2019-10-22 11:22:55,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:55,269 INFO L225 Difference]: With dead ends: 34 [2019-10-22 11:22:55,270 INFO L226 Difference]: Without dead ends: 32 [2019-10-22 11:22:55,270 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:22:55,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-10-22 11:22:55,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-10-22 11:22:55,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-22 11:22:55,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2019-10-22 11:22:55,277 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 11 [2019-10-22 11:22:55,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:55,277 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2019-10-22 11:22:55,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:22:55,277 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2019-10-22 11:22:55,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-22 11:22:55,278 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:55,278 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:55,478 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:22:55,479 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:55,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:55,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1061798883, now seen corresponding path program 1 times [2019-10-22 11:22:55,480 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:22:55,480 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1836061975] [2019-10-22 11:22:55,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_686180ba-9add-4b5b-9a41-d5bc71b696b8/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-10-22 11:22:55,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:55,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-22 11:22:55,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:22:55,588 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-22 11:22:55,588 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:55,599 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:55,600 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:22:55,600 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-22 11:22:55,736 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:55,736 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-22 11:22:55,737 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:55,815 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:55,818 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_31|], 2=[|v_#memory_int_30|, |v_#memory_$Pointer$.offset_22|, |v_#memory_int_29|, |v_#memory_$Pointer$.base_23|]} [2019-10-22 11:22:55,832 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:22:55,855 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2019-10-22 11:22:55,855 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:55,908 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:55,912 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:22:55,954 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:55,962 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:22:55,963 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:55,990 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:56,114 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 37 [2019-10-22 11:22:56,114 INFO L341 Elim1Store]: treesize reduction 94, result has 54.6 percent of original size [2019-10-22 11:22:56,114 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 155 [2019-10-22 11:22:56,115 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:56,165 INFO L567 ElimStorePlain]: treesize reduction 94, result has 40.9 percent of original size [2019-10-22 11:22:56,167 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:22:56,168 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:56,181 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:56,182 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-22 11:22:56,182 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:156, output treesize:26 [2019-10-22 11:22:56,219 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 12 [2019-10-22 11:22:56,220 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:56,225 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:56,226 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:22:56,226 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:30, output treesize:3 [2019-10-22 11:22:56,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:56,234 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:22:56,265 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_int|], 2=[|v_#memory_$Pointer$.offset_22|, |v_#memory_int_29|, |v_#memory_$Pointer$.base_23|], 3=[|v_#memory_int_30|]} [2019-10-22 11:22:56,301 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-22 11:22:56,341 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:56,342 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 10 [2019-10-22 11:22:56,342 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:56,431 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:56,442 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:56,572 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-10-22 11:22:56,573 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:04,762 WARN L191 SmtUtils]: Spent 8.16 s on a formula simplification that was a NOOP. DAG size: 26 [2019-10-22 11:23:04,763 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:04,763 INFO L375 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 31 treesize of output 56 [2019-10-22 11:23:04,764 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-22 11:23:12,987 WARN L191 SmtUtils]: Spent 8.22 s on a formula simplification that was a NOOP. DAG size: 65 [2019-10-22 11:23:12,988 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:13,189 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:23:13,189 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: expected NNF at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:236) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive$TermWalker.walk(NonRecursive.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:195) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder.(ArrayOccurrenceAnalysis.java:181) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.(ArrayOccurrenceAnalysis.java:74) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:275) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:335) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.checkFeasibility(TraceAbstractionRefinementEngine.java:244) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-10-22 11:23:13,194 INFO L168 Benchmark]: Toolchain (without parser) took 22406.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 945.6 MB in the beginning and 879.1 MB in the end (delta: 66.5 MB). Peak memory consumption was 191.8 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:13,194 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:23:13,195 INFO L168 Benchmark]: CACSL2BoogieTranslator took 468.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -155.0 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:13,208 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:13,209 INFO L168 Benchmark]: Boogie Preprocessor took 46.10 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-10-22 11:23:13,210 INFO L168 Benchmark]: RCFGBuilder took 501.11 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: 31.8 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:13,212 INFO L168 Benchmark]: TraceAbstraction took 21344.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 879.1 MB in the end (delta: 183.1 MB). Peak memory consumption was 183.1 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:13,214 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 468.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -155.0 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 42.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 46.10 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 501.11 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: 31.8 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 21344.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 879.1 MB in the end (delta: 183.1 MB). Peak memory consumption was 183.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: expected NNF de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: expected NNF: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:236) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...