./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/heap-data/hash_fun.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_a233a4ba-2fd6-41f4-a31b-f6a2d864f0bd/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a233a4ba-2fd6-41f4-a31b-f6a2d864f0bd/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a233a4ba-2fd6-41f4-a31b-f6a2d864f0bd/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a233a4ba-2fd6-41f4-a31b-f6a2d864f0bd/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/heap-data/hash_fun.i -s /tmp/vcloud-vcloud-master/worker/working_dir_a233a4ba-2fd6-41f4-a31b-f6a2d864f0bd/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a233a4ba-2fd6-41f4-a31b-f6a2d864f0bd/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 d75321dec5b653a9d7c704029015a83253bdd0a6 ................................................................................................................................................................................................................................................................................................................................................................................................ 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_a233a4ba-2fd6-41f4-a31b-f6a2d864f0bd/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a233a4ba-2fd6-41f4-a31b-f6a2d864f0bd/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a233a4ba-2fd6-41f4-a31b-f6a2d864f0bd/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a233a4ba-2fd6-41f4-a31b-f6a2d864f0bd/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/heap-data/hash_fun.i -s /tmp/vcloud-vcloud-master/worker/working_dir_a233a4ba-2fd6-41f4-a31b-f6a2d864f0bd/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a233a4ba-2fd6-41f4-a31b-f6a2d864f0bd/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 d75321dec5b653a9d7c704029015a83253bdd0a6 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:23:02,510 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:23:02,511 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:23:02,519 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:23:02,520 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:23:02,520 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:23:02,521 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:23:02,522 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:23:02,523 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:23:02,524 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:23:02,525 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:23:02,526 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:23:02,526 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:23:02,527 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:23:02,527 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:23:02,528 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:23:02,529 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:23:02,530 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:23:02,531 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:23:02,533 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:23:02,534 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:23:02,535 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:23:02,536 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:23:02,536 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:23:02,538 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:23:02,539 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:23:02,539 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:23:02,540 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:23:02,540 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:23:02,541 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:23:02,541 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:23:02,542 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:23:02,542 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:23:02,543 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:23:02,544 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:23:02,544 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:23:02,545 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:23:02,545 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:23:02,545 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:23:02,546 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:23:02,546 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:23:02,547 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a233a4ba-2fd6-41f4-a31b-f6a2d864f0bd/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-10-22 11:23:02,557 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:23:02,558 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:23:02,558 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:23:02,559 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:23:02,559 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:23:02,559 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:23:02,559 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:23:02,559 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:23:02,559 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:23:02,559 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:23:02,560 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:23:02,560 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:23:02,560 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:23:02,560 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:23:02,561 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:23:02,561 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:23:02,561 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:23:02,561 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:23:02,561 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:23:02,561 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:23:02,561 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:23:02,562 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:23:02,562 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:23:02,562 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:23:02,562 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:23:02,562 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:23:02,562 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:23:02,562 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:23:02,563 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:23:02,563 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:23:02,563 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:23:02,563 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:23:02,564 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:23:02,564 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:23:02,564 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:23:02,564 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_a233a4ba-2fd6-41f4-a31b-f6a2d864f0bd/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 -> d75321dec5b653a9d7c704029015a83253bdd0a6 [2019-10-22 11:23:02,587 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:23:02,597 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:23:02,600 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:23:02,601 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:23:02,602 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:23:02,602 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a233a4ba-2fd6-41f4-a31b-f6a2d864f0bd/bin/utaipan/../../sv-benchmarks/c/heap-data/hash_fun.i [2019-10-22 11:23:02,656 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a233a4ba-2fd6-41f4-a31b-f6a2d864f0bd/bin/utaipan/data/2c4f3b10e/ad44500bb53d4384a0d533338ad63097/FLAG3d22de561 [2019-10-22 11:23:03,083 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:23:03,086 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a233a4ba-2fd6-41f4-a31b-f6a2d864f0bd/sv-benchmarks/c/heap-data/hash_fun.i [2019-10-22 11:23:03,096 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a233a4ba-2fd6-41f4-a31b-f6a2d864f0bd/bin/utaipan/data/2c4f3b10e/ad44500bb53d4384a0d533338ad63097/FLAG3d22de561 [2019-10-22 11:23:03,109 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a233a4ba-2fd6-41f4-a31b-f6a2d864f0bd/bin/utaipan/data/2c4f3b10e/ad44500bb53d4384a0d533338ad63097 [2019-10-22 11:23:03,111 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:23:03,112 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:23:03,113 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:23:03,113 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:23:03,116 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:23:03,117 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:23:03" (1/1) ... [2019-10-22 11:23:03,120 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b9160ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:03, skipping insertion in model container [2019-10-22 11:23:03,120 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:23:03" (1/1) ... [2019-10-22 11:23:03,127 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:23:03,159 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:23:03,516 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:23:03,528 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:23:03,583 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:23:03,639 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:23:03,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:03 WrapperNode [2019-10-22 11:23:03,639 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:23:03,640 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:23:03,640 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:23:03,640 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:23:03,649 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:23:03" (1/1) ... [2019-10-22 11:23:03,663 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:23:03" (1/1) ... [2019-10-22 11:23:03,686 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:23:03,689 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:23:03,689 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:23:03,689 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:23:03,698 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:03" (1/1) ... [2019-10-22 11:23:03,698 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:03" (1/1) ... [2019-10-22 11:23:03,702 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:03" (1/1) ... [2019-10-22 11:23:03,703 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:03" (1/1) ... [2019-10-22 11:23:03,717 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:03" (1/1) ... [2019-10-22 11:23:03,720 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:03" (1/1) ... [2019-10-22 11:23:03,722 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:03" (1/1) ... [2019-10-22 11:23:03,729 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:23:03,730 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:23:03,730 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:23:03,730 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:23:03,731 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a233a4ba-2fd6-41f4-a31b-f6a2d864f0bd/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:23:03,790 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 11:23:03,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 11:23:03,791 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 11:23:03,792 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 11:23:03,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 11:23:03,792 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 11:23:03,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 11:23:03,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-22 11:23:03,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:23:03,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:23:04,042 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:23:04,042 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-22 11:23:04,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:23:04 BoogieIcfgContainer [2019-10-22 11:23:04,044 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:23:04,044 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:23:04,044 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:23:04,064 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:23:04,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:23:03" (1/3) ... [2019-10-22 11:23:04,065 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7191b73e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:23:04, skipping insertion in model container [2019-10-22 11:23:04,065 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:03" (2/3) ... [2019-10-22 11:23:04,065 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7191b73e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:23:04, skipping insertion in model container [2019-10-22 11:23:04,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:23:04" (3/3) ... [2019-10-22 11:23:04,067 INFO L109 eAbstractionObserver]: Analyzing ICFG hash_fun.i [2019-10-22 11:23:04,074 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:23:04,079 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-22 11:23:04,087 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-22 11:23:04,104 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:23:04,104 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:23:04,104 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:23:04,104 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:23:04,104 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:23:04,105 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:23:04,105 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:23:04,105 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:23:04,115 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2019-10-22 11:23:04,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-10-22 11:23:04,120 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:04,121 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:04,122 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:04,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:04,126 INFO L82 PathProgramCache]: Analyzing trace with hash 830401740, now seen corresponding path program 1 times [2019-10-22 11:23:04,132 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:04,133 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146459414] [2019-10-22 11:23:04,133 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:04,133 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:04,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:04,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:04,244 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:23:04,244 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146459414] [2019-10-22 11:23:04,245 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:04,246 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:23:04,246 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374709088] [2019-10-22 11:23:04,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-22 11:23:04,251 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:04,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 11:23:04,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 11:23:04,262 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2019-10-22 11:23:04,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:04,274 INFO L93 Difference]: Finished difference Result 29 states and 39 transitions. [2019-10-22 11:23:04,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 11:23:04,275 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-10-22 11:23:04,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:04,284 INFO L225 Difference]: With dead ends: 29 [2019-10-22 11:23:04,285 INFO L226 Difference]: Without dead ends: 14 [2019-10-22 11:23:04,287 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:23:04,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-10-22 11:23:04,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-10-22 11:23:04,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-10-22 11:23:04,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2019-10-22 11:23:04,313 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 18 transitions. Word has length 8 [2019-10-22 11:23:04,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:04,314 INFO L462 AbstractCegarLoop]: Abstraction has 14 states and 18 transitions. [2019-10-22 11:23:04,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-22 11:23:04,314 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 18 transitions. [2019-10-22 11:23:04,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-10-22 11:23:04,314 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:04,314 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:04,315 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:04,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:04,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1230593312, now seen corresponding path program 1 times [2019-10-22 11:23:04,315 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:04,315 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989160652] [2019-10-22 11:23:04,316 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:04,316 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:04,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:04,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:04,396 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:23:04,397 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989160652] [2019-10-22 11:23:04,397 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:04,397 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:23:04,397 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95751291] [2019-10-22 11:23:04,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:23:04,399 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:04,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:23:04,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:23:04,399 INFO L87 Difference]: Start difference. First operand 14 states and 18 transitions. Second operand 4 states. [2019-10-22 11:23:04,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:04,476 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2019-10-22 11:23:04,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:23:04,476 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-10-22 11:23:04,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:04,477 INFO L225 Difference]: With dead ends: 28 [2019-10-22 11:23:04,477 INFO L226 Difference]: Without dead ends: 19 [2019-10-22 11:23:04,478 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:23:04,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-10-22 11:23:04,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-10-22 11:23:04,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-10-22 11:23:04,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2019-10-22 11:23:04,481 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 9 [2019-10-22 11:23:04,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:04,482 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-10-22 11:23:04,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:23:04,482 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2019-10-22 11:23:04,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-22 11:23:04,482 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:04,483 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:04,483 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:04,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:04,483 INFO L82 PathProgramCache]: Analyzing trace with hash 859009401, now seen corresponding path program 1 times [2019-10-22 11:23:04,484 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:04,485 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975998897] [2019-10-22 11:23:04,485 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:04,485 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:04,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:04,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:04,639 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:23:04,639 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975998897] [2019-10-22 11:23:04,639 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1546487493] [2019-10-22 11:23:04,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a233a4ba-2fd6-41f4-a31b-f6a2d864f0bd/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:23:04,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:04,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-22 11:23:04,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:23:04,780 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 11 treesize of output 7 [2019-10-22 11:23:04,780 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:23:04,803 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:04,812 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 11 treesize of output 7 [2019-10-22 11:23:04,813 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:23:04,831 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:04,837 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:23:04,839 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 0 case distinctions, treesize of input 31 treesize of output 7 [2019-10-22 11:23:04,839 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-22 11:23:04,852 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:04,854 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:23:04,854 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:67, output treesize:30 [2019-10-22 11:23:04,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:04,880 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:23:04,880 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:23:04,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:04,900 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_10|], 2=[|v_#memory_int_11|]} [2019-10-22 11:23:04,905 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-22 11:23:04,931 INFO L341 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2019-10-22 11:23:04,931 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 32 treesize of output 9 [2019-10-22 11:23:04,932 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:23:04,941 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:04,947 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 9 treesize of output 5 [2019-10-22 11:23:04,948 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:23:04,956 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:04,957 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:23:04,957 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:47, output treesize:5 [2019-10-22 11:23:04,974 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:23:04,975 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1604537915] [2019-10-22 11:23:04,984 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 15 [2019-10-22 11:23:05,023 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-10-22 11:23:05,024 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-22 11:23:05,299 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:23:05,300 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: inappropriate decl info IMPLEMENTATION at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Boogie2SmtSymbolTable.getBoogieVar(Boogie2SmtSymbolTable.java:222) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.getBoogieVar(NonrelationalStatementProcessor.java:348) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.handleHavocStatement(NonrelationalStatementProcessor.java:325) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.processStatement(NonrelationalStatementProcessor.java:159) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:138) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:107) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:422) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:413) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:140) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.applyInternally(CompoundDomainPostOperator.java:306) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:131) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormanCachedPostOperation.restoreOriginalStateVariables(PoormanCachedPostOperation.java:322) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.applyPost(PoormansAbstractPostOperator.java:217) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:120) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$17(DisjunctiveAbstractState.java:323) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:519) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:323) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateAbstractPost(FixpointEngine.java:249) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateFixpoint(FixpointEngine.java:134) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.run(FixpointEngine.java:105) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.tool.AbstractInterpreter.runWithoutTimeoutAndResults(AbstractInterpreter.java:149) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarAbsIntRunner.generateFixpoints(CegarAbsIntRunner.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarAbsIntRunner.(CegarAbsIntRunner.java:158) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAbstractInterpretation.getOrConstructRunner(IpTcStrategyModuleAbstractInterpretation.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAbstractInterpretation.construct(IpTcStrategyModuleAbstractInterpretation.java:81) 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) 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) [2019-10-22 11:23:05,304 INFO L168 Benchmark]: Toolchain (without parser) took 2192.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 939.2 MB in the beginning and 995.3 MB in the end (delta: -56.1 MB). Peak memory consumption was 83.8 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:05,305 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:23:05,305 INFO L168 Benchmark]: CACSL2BoogieTranslator took 527.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 939.2 MB in the beginning and 1.1 GB in the end (delta: -175.4 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:05,306 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.37 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:05,306 INFO L168 Benchmark]: Boogie Preprocessor took 40.42 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:05,306 INFO L168 Benchmark]: RCFGBuilder took 314.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: 29.2 MB). Peak memory consumption was 29.2 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:05,307 INFO L168 Benchmark]: TraceAbstraction took 1258.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 995.3 MB in the end (delta: 90.1 MB). Peak memory consumption was 90.1 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:05,309 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 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 527.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 939.2 MB in the beginning and 1.1 GB in the end (delta: -175.4 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 48.37 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.42 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 314.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: 29.2 MB). Peak memory consumption was 29.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1258.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 995.3 MB in the end (delta: 90.1 MB). Peak memory consumption was 90.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: inappropriate decl info IMPLEMENTATION de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: inappropriate decl info IMPLEMENTATION: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Boogie2SmtSymbolTable.getBoogieVar(Boogie2SmtSymbolTable.java:222) 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:23:07,255 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:23:07,256 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:23:07,265 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:23:07,266 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:23:07,266 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:23:07,268 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:23:07,269 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:23:07,270 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:23:07,271 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:23:07,272 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:23:07,273 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:23:07,273 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:23:07,274 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:23:07,274 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:23:07,275 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:23:07,276 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:23:07,277 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:23:07,278 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:23:07,280 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:23:07,281 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:23:07,282 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:23:07,283 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:23:07,284 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:23:07,286 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:23:07,286 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:23:07,286 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:23:07,287 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:23:07,288 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:23:07,288 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:23:07,289 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:23:07,289 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:23:07,290 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:23:07,290 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:23:07,291 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:23:07,291 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:23:07,292 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:23:07,292 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:23:07,292 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:23:07,293 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:23:07,293 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:23:07,294 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a233a4ba-2fd6-41f4-a31b-f6a2d864f0bd/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2019-10-22 11:23:07,305 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:23:07,305 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:23:07,306 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:23:07,306 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:23:07,306 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:23:07,306 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:23:07,307 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:23:07,307 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:23:07,307 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:23:07,308 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:23:07,308 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:23:07,308 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:23:07,308 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:23:07,308 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:23:07,308 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:23:07,309 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:23:07,309 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-10-22 11:23:07,309 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-10-22 11:23:07,309 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:23:07,309 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:23:07,309 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 11:23:07,309 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:23:07,310 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:23:07,310 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:23:07,310 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:23:07,310 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:23:07,310 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:23:07,310 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:23:07,311 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:23:07,311 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:23:07,311 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-10-22 11:23:07,311 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-10-22 11:23:07,311 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:23:07,311 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:23:07,312 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_a233a4ba-2fd6-41f4-a31b-f6a2d864f0bd/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 -> d75321dec5b653a9d7c704029015a83253bdd0a6 [2019-10-22 11:23:07,338 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:23:07,348 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:23:07,350 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:23:07,352 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:23:07,352 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:23:07,353 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a233a4ba-2fd6-41f4-a31b-f6a2d864f0bd/bin/utaipan/../../sv-benchmarks/c/heap-data/hash_fun.i [2019-10-22 11:23:07,399 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a233a4ba-2fd6-41f4-a31b-f6a2d864f0bd/bin/utaipan/data/7b6f07b05/3c7e937f5f3b42cab443470437d48dbf/FLAG3e50c05f8 [2019-10-22 11:23:07,869 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:23:07,870 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a233a4ba-2fd6-41f4-a31b-f6a2d864f0bd/sv-benchmarks/c/heap-data/hash_fun.i [2019-10-22 11:23:07,878 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a233a4ba-2fd6-41f4-a31b-f6a2d864f0bd/bin/utaipan/data/7b6f07b05/3c7e937f5f3b42cab443470437d48dbf/FLAG3e50c05f8 [2019-10-22 11:23:08,371 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a233a4ba-2fd6-41f4-a31b-f6a2d864f0bd/bin/utaipan/data/7b6f07b05/3c7e937f5f3b42cab443470437d48dbf [2019-10-22 11:23:08,374 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:23:08,376 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:23:08,377 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:23:08,377 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:23:08,380 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:23:08,380 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:23:08" (1/1) ... [2019-10-22 11:23:08,383 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ac5b61a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:08, skipping insertion in model container [2019-10-22 11:23:08,383 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:23:08" (1/1) ... [2019-10-22 11:23:08,389 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:23:08,423 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:23:08,830 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:23:08,845 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:23:08,881 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:23:08,931 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:23:08,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:08 WrapperNode [2019-10-22 11:23:08,932 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:23:08,933 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:23:08,933 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:23:08,933 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:23:08,940 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:23:08" (1/1) ... [2019-10-22 11:23:08,961 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:23:08" (1/1) ... [2019-10-22 11:23:08,983 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:23:08,984 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:23:08,984 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:23:08,985 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:23:08,993 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:08" (1/1) ... [2019-10-22 11:23:08,994 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:08" (1/1) ... [2019-10-22 11:23:09,001 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:08" (1/1) ... [2019-10-22 11:23:09,002 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:08" (1/1) ... [2019-10-22 11:23:09,014 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:08" (1/1) ... [2019-10-22 11:23:09,025 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:08" (1/1) ... [2019-10-22 11:23:09,029 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:08" (1/1) ... [2019-10-22 11:23:09,034 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:23:09,034 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:23:09,035 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:23:09,035 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:23:09,036 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a233a4ba-2fd6-41f4-a31b-f6a2d864f0bd/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:23:09,077 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-10-22 11:23:09,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 11:23:09,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 11:23:09,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 11:23:09,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 11:23:09,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 11:23:09,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-10-22 11:23:09,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-22 11:23:09,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:23:09,078 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:23:09,414 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:23:09,414 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-22 11:23:09,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:23:09 BoogieIcfgContainer [2019-10-22 11:23:09,416 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:23:09,416 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:23:09,417 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:23:09,419 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:23:09,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:23:08" (1/3) ... [2019-10-22 11:23:09,420 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35935afb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:23:09, skipping insertion in model container [2019-10-22 11:23:09,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:08" (2/3) ... [2019-10-22 11:23:09,420 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35935afb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:23:09, skipping insertion in model container [2019-10-22 11:23:09,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:23:09" (3/3) ... [2019-10-22 11:23:09,422 INFO L109 eAbstractionObserver]: Analyzing ICFG hash_fun.i [2019-10-22 11:23:09,432 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:23:09,443 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-22 11:23:09,453 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-22 11:23:09,472 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:23:09,473 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:23:09,473 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:23:09,473 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:23:09,473 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:23:09,473 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:23:09,473 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:23:09,473 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:23:09,484 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2019-10-22 11:23:09,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-10-22 11:23:09,489 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:09,490 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:09,492 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:09,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:09,497 INFO L82 PathProgramCache]: Analyzing trace with hash 256864415, now seen corresponding path program 1 times [2019-10-22 11:23:09,509 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:23:09,509 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1464333739] [2019-10-22 11:23:09,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a233a4ba-2fd6-41f4-a31b-f6a2d864f0bd/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:23:09,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:09,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 11:23:09,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:23:09,731 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 15 treesize of output 7 [2019-10-22 11:23:09,732 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:23:09,747 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:09,754 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 15 treesize of output 7 [2019-10-22 11:23:09,755 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:23:09,764 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:09,765 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:23:09,765 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2019-10-22 11:23:09,781 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:23:09,782 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:23:09,792 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:23:09,793 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1464333739] [2019-10-22 11:23:09,794 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:09,794 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-10-22 11:23:09,795 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611914167] [2019-10-22 11:23:09,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:23:09,799 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:23:09,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:23:09,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:23:09,815 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 4 states. [2019-10-22 11:23:09,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:09,980 INFO L93 Difference]: Finished difference Result 35 states and 51 transitions. [2019-10-22 11:23:09,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:23:09,983 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-10-22 11:23:09,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:09,993 INFO L225 Difference]: With dead ends: 35 [2019-10-22 11:23:09,993 INFO L226 Difference]: Without dead ends: 17 [2019-10-22 11:23:09,996 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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:23:10,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-10-22 11:23:10,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-10-22 11:23:10,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-10-22 11:23:10,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2019-10-22 11:23:10,030 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 23 transitions. Word has length 8 [2019-10-22 11:23:10,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:10,030 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-10-22 11:23:10,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:23:10,030 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 23 transitions. [2019-10-22 11:23:10,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-22 11:23:10,031 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:10,031 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:10,232 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:23:10,232 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:10,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:10,233 INFO L82 PathProgramCache]: Analyzing trace with hash 798628165, now seen corresponding path program 1 times [2019-10-22 11:23:10,233 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:23:10,234 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1136220035] [2019-10-22 11:23:10,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a233a4ba-2fd6-41f4-a31b-f6a2d864f0bd/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:23:10,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:10,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-22 11:23:10,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:23:10,385 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:23:10,386 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:23:10,391 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:10,392 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:23:10,392 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-22 11:23:10,470 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:10,470 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:23:10,471 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:23:10,629 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-10-22 11:23:10,630 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:10,653 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 0 case distinctions, treesize of input 31 treesize of output 7 [2019-10-22 11:23:10,654 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:23:10,716 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:10,724 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 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-22 11:23:10,724 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-22 11:23:10,763 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:10,771 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 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-22 11:23:10,771 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-22 11:23:10,807 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:10,809 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:23:10,809 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:81, output treesize:50 [2019-10-22 11:23:10,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:10,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:10,867 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:23:10,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:10,915 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_10|], 2=[|v_#memory_int_11|]} [2019-10-22 11:23:10,940 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-22 11:23:10,961 INFO L341 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2019-10-22 11:23:10,962 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 32 treesize of output 9 [2019-10-22 11:23:10,962 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:23:10,992 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:10,999 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 9 treesize of output 5 [2019-10-22 11:23:11,000 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:23:11,032 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:11,033 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-22 11:23:11,033 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:58, output treesize:22 [2019-10-22 11:23:11,135 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:11,135 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1136220035] [2019-10-22 11:23:11,135 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104537293] [2019-10-22 11:23:11,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a233a4ba-2fd6-41f4-a31b-f6a2d864f0bd/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:23:11,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:11,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-22 11:23:11,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:23:11,227 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:23:11,227 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:23:11,230 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:11,230 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:23:11,230 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-10-22 11:23:11,354 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:11,355 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 12 treesize of output 16 [2019-10-22 11:23:11,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:11,356 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:23:11,528 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-10-22 11:23:11,528 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:11,553 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 0 case distinctions, treesize of input 31 treesize of output 7 [2019-10-22 11:23:11,554 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:23:11,613 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:11,627 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 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-22 11:23:11,627 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-22 11:23:11,662 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:11,673 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 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-22 11:23:11,673 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-22 11:23:11,704 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:11,705 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:23:11,706 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:79, output treesize:47 [2019-10-22 11:23:11,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:11,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:11,771 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:23:11,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:11,781 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_12|], 2=[|v_#memory_int_13|]} [2019-10-22 11:23:11,804 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-22 11:23:11,823 INFO L341 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2019-10-22 11:23:11,824 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 32 treesize of output 9 [2019-10-22 11:23:11,824 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:23:11,854 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:11,864 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 9 treesize of output 5 [2019-10-22 11:23:11,865 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:23:11,887 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:11,888 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-22 11:23:11,889 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:58, output treesize:22 [2019-10-22 11:23:11,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:11,955 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-22 11:23:11,955 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6] total 11 [2019-10-22 11:23:11,955 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412673085] [2019-10-22 11:23:11,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-22 11:23:11,957 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:23:11,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-22 11:23:11,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-10-22 11:23:11,958 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. Second operand 11 states. [2019-10-22 11:23:12,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:12,240 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2019-10-22 11:23:12,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:23:12,240 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 12 [2019-10-22 11:23:12,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:12,241 INFO L225 Difference]: With dead ends: 39 [2019-10-22 11:23:12,241 INFO L226 Difference]: Without dead ends: 24 [2019-10-22 11:23:12,242 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-10-22 11:23:12,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-10-22 11:23:12,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-10-22 11:23:12,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-22 11:23:12,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2019-10-22 11:23:12,247 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 12 [2019-10-22 11:23:12,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:12,247 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2019-10-22 11:23:12,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-22 11:23:12,248 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2019-10-22 11:23:12,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-22 11:23:12,248 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:12,248 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:12,649 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:23:12,649 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:12,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:12,649 INFO L82 PathProgramCache]: Analyzing trace with hash 2106589055, now seen corresponding path program 1 times [2019-10-22 11:23:12,650 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:23:12,650 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2006030753] [2019-10-22 11:23:12,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a233a4ba-2fd6-41f4-a31b-f6a2d864f0bd/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:23:12,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:12,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-22 11:23:12,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:23:12,784 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:23:12,785 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:23:12,797 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:12,797 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:23:12,798 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:23 [2019-10-22 11:23:12,858 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:12,859 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:23:12,860 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:23:12,988 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-10-22 11:23:12,989 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:12,990 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_16|, |v_#memory_$Pointer$.offset_16|], 4=[|v_#memory_$Pointer$.base_17|, |v_#memory_$Pointer$.offset_17|]} [2019-10-22 11:23:12,997 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:23:13,131 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-10-22 11:23:13,131 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:13,137 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:23:13,262 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-10-22 11:23:13,262 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:13,275 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 0 case distinctions, treesize of input 49 treesize of output 25 [2019-10-22 11:23:13,276 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-22 11:23:13,352 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:13,361 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 0 case distinctions, treesize of input 49 treesize of output 25 [2019-10-22 11:23:13,362 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-22 11:23:13,389 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:13,390 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:23:13,390 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:94, output treesize:41 [2019-10-22 11:23:13,420 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:23:13,421 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-22 11:23:13,423 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:13,424 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 69 [2019-10-22 11:23:13,426 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:23:13,475 INFO L567 ElimStorePlain]: treesize reduction 17, result has 81.1 percent of original size [2019-10-22 11:23:13,488 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:13,489 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 63 [2019-10-22 11:23:13,490 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:23:13,504 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:13,505 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:23:13,505 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:44 [2019-10-22 11:23:13,542 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 10 [2019-10-22 11:23:13,542 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:23:13,551 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:13,553 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 10 [2019-10-22 11:23:13,554 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:23:13,559 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:13,559 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:23:13,560 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:55, output treesize:7 [2019-10-22 11:23:13,582 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:13,583 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:23:13,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:13,638 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:23:13,642 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:23:13,697 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:13,703 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:23:13,711 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-22 11:23:13,760 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:13,761 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-10-22 11:23:13,761 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:137, output treesize:105 [2019-10-22 11:23:13,842 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:13,843 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2006030753] [2019-10-22 11:23:13,843 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1605128127] [2019-10-22 11:23:13,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a233a4ba-2fd6-41f4-a31b-f6a2d864f0bd/bin/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:23:13,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:13,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-22 11:23:13,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:23:13,922 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:23:13,923 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:23:13,930 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:13,931 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:23:13,931 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20 [2019-10-22 11:23:13,996 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:13,996 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:23:13,997 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:23:14,103 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-10-22 11:23:14,104 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:14,105 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_21|, |v_#memory_$Pointer$.offset_21|], 4=[|v_#memory_$Pointer$.base_22|, |v_#memory_$Pointer$.offset_22|]} [2019-10-22 11:23:14,108 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:23:14,207 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:14,210 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:23:14,318 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-10-22 11:23:14,318 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:14,328 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 0 case distinctions, treesize of input 49 treesize of output 25 [2019-10-22 11:23:14,328 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-22 11:23:14,384 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:14,389 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 0 case distinctions, treesize of input 49 treesize of output 25 [2019-10-22 11:23:14,389 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-22 11:23:14,405 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:14,406 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:23:14,406 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:91, output treesize:38 [2019-10-22 11:23:14,443 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:14,444 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 70 [2019-10-22 11:23:14,445 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:23:14,466 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:14,508 INFO L341 Elim1Store]: treesize reduction 24, result has 45.5 percent of original size [2019-10-22 11:23:14,508 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 44 [2019-10-22 11:23:14,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:14,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:14,511 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:23:14,533 INFO L567 ElimStorePlain]: treesize reduction 16, result has 69.8 percent of original size [2019-10-22 11:23:14,534 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:23:14,534 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:88, output treesize:37 [2019-10-22 11:23:14,571 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 10 [2019-10-22 11:23:14,571 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:23:14,580 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:14,583 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 22 treesize of output 10 [2019-10-22 11:23:14,583 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:23:14,588 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:14,588 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:23:14,588 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:51, output treesize:7 [2019-10-22 11:23:14,589 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:14,589 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:23:14,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:14,612 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:23:14,619 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:23:14,726 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-10-22 11:23:14,726 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:14,737 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-22 11:23:14,741 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:23:14,807 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:14,808 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-10-22 11:23:14,808 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:137, output treesize:105 [2019-10-22 11:23:14,869 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:14,870 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-22 11:23:14,870 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6] total 12 [2019-10-22 11:23:14,870 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713579568] [2019-10-22 11:23:14,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-22 11:23:14,871 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:23:14,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-22 11:23:14,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-10-22 11:23:14,871 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand 12 states. [2019-10-22 11:23:15,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:15,299 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2019-10-22 11:23:15,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:23:15,301 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2019-10-22 11:23:15,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:15,302 INFO L225 Difference]: With dead ends: 41 [2019-10-22 11:23:15,302 INFO L226 Difference]: Without dead ends: 27 [2019-10-22 11:23:15,302 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-10-22 11:23:15,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-10-22 11:23:15,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-10-22 11:23:15,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-22 11:23:15,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2019-10-22 11:23:15,307 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 17 [2019-10-22 11:23:15,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:15,307 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2019-10-22 11:23:15,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-22 11:23:15,307 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2019-10-22 11:23:15,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-22 11:23:15,308 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:15,308 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:15,713 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:23:15,713 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:15,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:15,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1436438119, now seen corresponding path program 2 times [2019-10-22 11:23:15,714 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:23:15,714 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [524130229] [2019-10-22 11:23:15,715 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a233a4ba-2fd6-41f4-a31b-f6a2d864f0bd/bin/utaipan/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:23:15,890 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-22 11:23:15,890 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 11:23:15,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 47 conjunts are in the unsatisfiable core [2019-10-22 11:23:15,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:23:15,900 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-22 11:23:15,900 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:23:15,908 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:15,908 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:23:15,908 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-10-22 11:23:15,977 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:15,978 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-22 11:23:15,978 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:23:16,390 WARN L191 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-10-22 11:23:16,390 INFO L567 ElimStorePlain]: treesize reduction 14, result has 86.8 percent of original size [2019-10-22 11:23:16,405 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 11 treesize of output 7 [2019-10-22 11:23:16,405 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:23:16,509 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-10-22 11:23:16,509 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:16,521 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 31 treesize of output 7 [2019-10-22 11:23:16,521 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-22 11:23:16,574 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:16,581 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 11 treesize of output 7 [2019-10-22 11:23:16,581 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-22 11:23:16,619 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:16,619 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:23:16,619 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:94, output treesize:73 [2019-10-22 11:23:16,872 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:23:16,872 INFO L235 Elim1Store]: Index analysis took 101 ms [2019-10-22 11:23:16,877 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:16,877 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 22 treesize of output 24 [2019-10-22 11:23:16,878 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:23:17,712 WARN L191 SmtUtils]: Spent 833.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-10-22 11:23:17,712 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:17,714 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_20|, |v_#memory_$Pointer$.base_27|, |v_#memory_$Pointer$.offset_27|, |v_#memory_int_19|], 4=[|v_#memory_$Pointer$.base_28|, |v_#memory_$Pointer$.offset_28|]} [2019-10-22 11:23:17,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 0 case distinctions, treesize of input 48 treesize of output 24 [2019-10-22 11:23:17,822 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:23:18,504 WARN L191 SmtUtils]: Spent 682.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-10-22 11:23:18,505 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:18,522 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:23:19,235 WARN L191 SmtUtils]: Spent 711.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-10-22 11:23:19,235 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:19,247 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:23:20,110 WARN L191 SmtUtils]: Spent 862.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-10-22 11:23:20,110 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:20,148 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:23:20,149 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 31 [2019-10-22 11:23:20,150 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-22 11:23:20,476 WARN L191 SmtUtils]: Spent 326.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-10-22 11:23:20,477 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:20,497 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:23:20,498 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 54 [2019-10-22 11:23:20,499 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-22 11:23:20,683 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-10-22 11:23:20,683 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:20,703 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:23:20,705 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 46 [2019-10-22 11:23:20,706 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-10-22 11:23:20,775 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:20,776 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 6 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:23:20,776 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 10 variables, input treesize:193, output treesize:107 [2019-10-22 11:23:20,836 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_21|], 12=[|v_#memory_$Pointer$.base_29|, |v_#memory_$Pointer$.offset_29|]} [2019-10-22 11:23:20,853 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32 [2019-10-22 11:23:20,854 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:23:20,942 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:20,947 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:23:20,948 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-22 11:23:20,949 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:20,950 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 134 treesize of output 90 [2019-10-22 11:23:20,951 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:23:21,084 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-10-22 11:23:21,085 INFO L567 ElimStorePlain]: treesize reduction 17, result has 86.3 percent of original size [2019-10-22 11:23:21,094 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:23:21,098 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:21,099 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 62 [2019-10-22 11:23:21,099 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-22 11:23:21,154 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:21,155 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-22 11:23:21,155 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:172, output treesize:90 [2019-10-22 11:23:21,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,243 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:21,243 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:23:21,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:21,276 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:23:21,282 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:21,283 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:23:21,283 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:45 [2019-10-22 11:23:21,352 INFO L392 ElimStorePlain]: Different costs {1=[|v_#memory_$Pointer$.base_27|, |v_#memory_$Pointer$.offset_27|], 2=[|v_#memory_int_19|], 3=[|v_#memory_int_23|]} [2019-10-22 11:23:21,364 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:23:21,572 WARN L191 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-10-22 11:23:21,573 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:21,579 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:23:21,711 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-10-22 11:23:21,712 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:21,718 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:23:21,829 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-10-22 11:23:21,829 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:21,831 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-22 11:23:21,895 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:21,896 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-10-22 11:23:21,896 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:146, output treesize:134 [2019-10-22 11:23:26,227 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_18|], 4=[|v_#memory_$Pointer$.offset_26|, |v_#memory_$Pointer$.base_26|], 5=[|v_#memory_int_24|]} [2019-10-22 11:23:26,372 INFO L341 Elim1Store]: treesize reduction 20, result has 47.4 percent of original size [2019-10-22 11:23:26,372 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 1 case distinctions, treesize of input 32 treesize of output 18 [2019-10-22 11:23:26,373 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-10-22 11:23:26,710 WARN L191 SmtUtils]: Spent 337.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-10-22 11:23:26,710 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:26,720 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:23:27,195 WARN L191 SmtUtils]: Spent 473.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 78 [2019-10-22 11:23:27,195 INFO L567 ElimStorePlain]: treesize reduction 3, result has 98.9 percent of original size [2019-10-22 11:23:27,396 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:23:27,396 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:27,400 INFO L168 Benchmark]: Toolchain (without parser) took 19024.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 217.6 MB). Free memory was 947.0 MB in the beginning and 879.5 MB in the end (delta: 67.5 MB). Peak memory consumption was 285.1 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:27,400 INFO L168 Benchmark]: CDTParser took 0.17 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:27,401 INFO L168 Benchmark]: CACSL2BoogieTranslator took 555.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.8 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -193.3 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:27,401 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.53 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:27,401 INFO L168 Benchmark]: Boogie Preprocessor took 49.77 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:27,402 INFO L168 Benchmark]: RCFGBuilder took 381.32 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: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:27,402 INFO L168 Benchmark]: TraceAbstraction took 17982.48 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 59.8 MB). Free memory was 1.1 GB in the beginning and 879.5 MB in the end (delta: 229.7 MB). Peak memory consumption was 289.5 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:27,408 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 555.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.8 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -193.3 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.53 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 49.77 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 381.32 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: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 17982.48 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 59.8 MB). Free memory was 1.1 GB in the beginning and 879.5 MB in the end (delta: 229.7 MB). Peak memory consumption was 289.5 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...