./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b7e832ca-8e65-4e8a-ab1a-700c42e70ced/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b7e832ca-8e65-4e8a-ab1a-700c42e70ced/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b7e832ca-8e65-4e8a-ab1a-700c42e70ced/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b7e832ca-8e65-4e8a-ab1a-700c42e70ced/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i -s /tmp/vcloud-vcloud-master/worker/working_dir_b7e832ca-8e65-4e8a-ab1a-700c42e70ced/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b7e832ca-8e65-4e8a-ab1a-700c42e70ced/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 789e632c72b5108c711cbdfccbf18346eae177df ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_b7e832ca-8e65-4e8a-ab1a-700c42e70ced/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b7e832ca-8e65-4e8a-ab1a-700c42e70ced/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b7e832ca-8e65-4e8a-ab1a-700c42e70ced/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b7e832ca-8e65-4e8a-ab1a-700c42e70ced/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i -s /tmp/vcloud-vcloud-master/worker/working_dir_b7e832ca-8e65-4e8a-ab1a-700c42e70ced/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b7e832ca-8e65-4e8a-ab1a-700c42e70ced/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 789e632c72b5108c711cbdfccbf18346eae177df .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: expected NNF --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 11:22:28,954 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:22:28,955 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:22:28,969 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:22:28,970 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:22:28,971 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:22:28,973 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:22:28,975 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:22:28,977 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:22:28,979 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:22:28,980 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:22:28,982 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:22:28,987 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:22:28,989 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:22:28,990 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:22:28,991 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:22:28,992 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:22:28,992 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:22:28,993 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:22:28,997 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:22:28,999 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:22:29,002 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:22:29,003 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:22:29,004 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:22:29,006 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:22:29,006 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:22:29,006 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:22:29,007 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:22:29,007 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:22:29,008 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:22:29,008 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:22:29,008 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:22:29,009 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:22:29,009 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:22:29,013 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:22:29,013 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:22:29,013 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:22:29,014 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:22:29,014 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:22:29,015 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:22:29,018 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:22:29,019 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b7e832ca-8e65-4e8a-ab1a-700c42e70ced/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-10-22 11:22:29,030 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:22:29,039 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:22:29,040 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:22:29,040 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:22:29,040 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:22:29,040 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:22:29,040 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:22:29,041 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:22:29,041 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:22:29,041 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:22:29,041 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:22:29,041 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:22:29,042 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:22:29,044 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:22:29,044 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:22:29,045 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:22:29,045 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:22:29,045 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:22:29,045 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:22:29,045 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:22:29,045 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:22:29,046 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:22:29,046 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:22:29,046 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:22:29,046 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:22:29,046 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:22:29,046 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:22:29,047 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:22:29,047 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:22:29,047 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:22:29,047 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:22:29,047 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:22:29,047 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:22:29,048 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:22:29,048 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:22:29,048 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_b7e832ca-8e65-4e8a-ab1a-700c42e70ced/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 -> 789e632c72b5108c711cbdfccbf18346eae177df [2019-10-22 11:22:29,081 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:22:29,091 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:22:29,094 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:22:29,096 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:22:29,096 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:22:29,097 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b7e832ca-8e65-4e8a-ab1a-700c42e70ced/bin/utaipan/../../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i [2019-10-22 11:22:29,144 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b7e832ca-8e65-4e8a-ab1a-700c42e70ced/bin/utaipan/data/6fff7c9cb/b637def4210e48edb1ca697afa3d7c71/FLAG04a46bbe7 [2019-10-22 11:22:29,581 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:22:29,581 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b7e832ca-8e65-4e8a-ab1a-700c42e70ced/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i [2019-10-22 11:22:29,593 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b7e832ca-8e65-4e8a-ab1a-700c42e70ced/bin/utaipan/data/6fff7c9cb/b637def4210e48edb1ca697afa3d7c71/FLAG04a46bbe7 [2019-10-22 11:22:29,953 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b7e832ca-8e65-4e8a-ab1a-700c42e70ced/bin/utaipan/data/6fff7c9cb/b637def4210e48edb1ca697afa3d7c71 [2019-10-22 11:22:29,956 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:22:29,957 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:22:29,958 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:22:29,958 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:22:29,961 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:22:29,962 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:22:29" (1/1) ... [2019-10-22 11:22:29,965 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c440583 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:29, skipping insertion in model container [2019-10-22 11:22:29,966 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:22:29" (1/1) ... [2019-10-22 11:22:29,973 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:22:30,014 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:22:30,416 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:22:30,428 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:22:30,484 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:22:30,545 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:22:30,546 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:30 WrapperNode [2019-10-22 11:22:30,546 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:22:30,547 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:22:30,547 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:22:30,548 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:22:30,557 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:30" (1/1) ... [2019-10-22 11:22:30,572 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:30" (1/1) ... [2019-10-22 11:22:30,596 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:22:30,597 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:22:30,597 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:22:30,597 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:22:30,607 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:30" (1/1) ... [2019-10-22 11:22:30,608 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:30" (1/1) ... [2019-10-22 11:22:30,611 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:30" (1/1) ... [2019-10-22 11:22:30,612 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:30" (1/1) ... [2019-10-22 11:22:30,621 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:30" (1/1) ... [2019-10-22 11:22:30,636 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:30" (1/1) ... [2019-10-22 11:22:30,638 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:30" (1/1) ... [2019-10-22 11:22:30,640 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:22:30,641 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:22:30,641 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:22:30,641 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:22:30,650 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7e832ca-8e65-4e8a-ab1a-700c42e70ced/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:22:30,708 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 11:22:30,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 11:22:30,709 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 11:22:30,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 11:22:30,709 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 11:22:30,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 11:22:30,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:22:30,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:22:31,096 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:22:31,096 INFO L284 CfgBuilder]: Removed 21 assume(true) statements. [2019-10-22 11:22:31,097 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:22:31 BoogieIcfgContainer [2019-10-22 11:22:31,098 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:22:31,099 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:22:31,102 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:22:31,105 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:22:31,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:22:29" (1/3) ... [2019-10-22 11:22:31,106 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a0d832e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:22:31, skipping insertion in model container [2019-10-22 11:22:31,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:30" (2/3) ... [2019-10-22 11:22:31,107 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a0d832e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:22:31, skipping insertion in model container [2019-10-22 11:22:31,107 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:22:31" (3/3) ... [2019-10-22 11:22:31,108 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-rb-cnstr_1-1.i [2019-10-22 11:22:31,117 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:22:31,123 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2019-10-22 11:22:31,133 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-10-22 11:22:31,152 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:22:31,153 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:22:31,153 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:22:31,153 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:22:31,153 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:22:31,153 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:22:31,153 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:22:31,153 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:22:31,165 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2019-10-22 11:22:31,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-10-22 11:22:31,170 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:31,170 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-10-22 11:22:31,172 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:31,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:31,176 INFO L82 PathProgramCache]: Analyzing trace with hash 891600134, now seen corresponding path program 1 times [2019-10-22 11:22:31,182 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:31,182 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844245944] [2019-10-22 11:22:31,183 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:31,183 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:31,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:31,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:31,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:31,299 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844245944] [2019-10-22 11:22:31,299 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:31,300 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:22:31,300 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368818530] [2019-10-22 11:22:31,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-22 11:22:31,304 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:31,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 11:22:31,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 11:22:31,315 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 2 states. [2019-10-22 11:22:31,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:31,330 INFO L93 Difference]: Finished difference Result 92 states and 150 transitions. [2019-10-22 11:22:31,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 11:22:31,331 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 6 [2019-10-22 11:22:31,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:31,340 INFO L225 Difference]: With dead ends: 92 [2019-10-22 11:22:31,340 INFO L226 Difference]: Without dead ends: 41 [2019-10-22 11:22:31,343 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 11:22:31,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-10-22 11:22:31,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-10-22 11:22:31,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-10-22 11:22:31,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2019-10-22 11:22:31,369 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 6 [2019-10-22 11:22:31,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:31,369 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2019-10-22 11:22:31,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-22 11:22:31,370 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2019-10-22 11:22:31,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-10-22 11:22:31,370 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:31,370 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:31,371 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:31,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:31,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1806905862, now seen corresponding path program 1 times [2019-10-22 11:22:31,371 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:31,371 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314818725] [2019-10-22 11:22:31,371 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:31,372 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:31,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:31,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:31,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:31,444 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314818725] [2019-10-22 11:22:31,444 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:31,444 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:22:31,444 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451158262] [2019-10-22 11:22:31,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:22:31,445 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:31,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:22:31,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:22:31,446 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 4 states. [2019-10-22 11:22:31,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:31,522 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2019-10-22 11:22:31,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:22:31,523 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-10-22 11:22:31,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:31,524 INFO L225 Difference]: With dead ends: 44 [2019-10-22 11:22:31,524 INFO L226 Difference]: Without dead ends: 40 [2019-10-22 11:22:31,524 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:22:31,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-22 11:22:31,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2019-10-22 11:22:31,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-22 11:22:31,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2019-10-22 11:22:31,529 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 7 [2019-10-22 11:22:31,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:31,529 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2019-10-22 11:22:31,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:22:31,530 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2019-10-22 11:22:31,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-10-22 11:22:31,530 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:31,530 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:31,531 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:31,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:31,531 INFO L82 PathProgramCache]: Analyzing trace with hash 179566605, now seen corresponding path program 1 times [2019-10-22 11:22:31,531 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:31,531 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813547452] [2019-10-22 11:22:31,532 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:31,532 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:31,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:31,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:31,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:31,617 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813547452] [2019-10-22 11:22:31,617 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:31,617 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:22:31,617 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190418090] [2019-10-22 11:22:31,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:22:31,617 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:31,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:22:31,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:22:31,618 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 4 states. [2019-10-22 11:22:31,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:31,676 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2019-10-22 11:22:31,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:22:31,677 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-10-22 11:22:31,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:31,677 INFO L225 Difference]: With dead ends: 37 [2019-10-22 11:22:31,677 INFO L226 Difference]: Without dead ends: 35 [2019-10-22 11:22:31,682 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:22:31,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-10-22 11:22:31,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-10-22 11:22:31,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-22 11:22:31,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2019-10-22 11:22:31,686 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 8 [2019-10-22 11:22:31,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:31,686 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2019-10-22 11:22:31,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:22:31,686 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2019-10-22 11:22:31,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-22 11:22:31,687 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:31,687 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:31,687 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:31,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:31,687 INFO L82 PathProgramCache]: Analyzing trace with hash 711412120, now seen corresponding path program 1 times [2019-10-22 11:22:31,688 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:31,688 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146782692] [2019-10-22 11:22:31,688 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:31,688 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:31,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:31,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:31,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:31,833 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146782692] [2019-10-22 11:22:31,833 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:31,834 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:22:31,834 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023087049] [2019-10-22 11:22:31,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:22:31,834 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:31,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:22:31,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:22:31,835 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 5 states. [2019-10-22 11:22:31,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:31,967 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2019-10-22 11:22:31,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:22:31,968 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-10-22 11:22:31,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:31,969 INFO L225 Difference]: With dead ends: 60 [2019-10-22 11:22:31,969 INFO L226 Difference]: Without dead ends: 58 [2019-10-22 11:22:31,969 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:22:31,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-10-22 11:22:31,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 42. [2019-10-22 11:22:31,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-22 11:22:31,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2019-10-22 11:22:31,980 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 10 [2019-10-22 11:22:31,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:31,980 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2019-10-22 11:22:31,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:22:31,980 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2019-10-22 11:22:31,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-22 11:22:31,981 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:31,981 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:31,981 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:31,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:31,982 INFO L82 PathProgramCache]: Analyzing trace with hash -2056579816, now seen corresponding path program 1 times [2019-10-22 11:22:31,982 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:31,982 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283703618] [2019-10-22 11:22:31,982 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:31,982 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:31,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:32,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:32,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:32,080 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283703618] [2019-10-22 11:22:32,081 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:32,081 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:22:32,081 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073834463] [2019-10-22 11:22:32,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:22:32,087 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:32,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:22:32,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:22:32,087 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 4 states. [2019-10-22 11:22:32,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:32,186 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2019-10-22 11:22:32,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:22:32,187 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-10-22 11:22:32,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:32,188 INFO L225 Difference]: With dead ends: 42 [2019-10-22 11:22:32,188 INFO L226 Difference]: Without dead ends: 40 [2019-10-22 11:22:32,188 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:22:32,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-22 11:22:32,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-10-22 11:22:32,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-10-22 11:22:32,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-10-22 11:22:32,194 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 11 [2019-10-22 11:22:32,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:32,194 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-10-22 11:22:32,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:22:32,194 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-10-22 11:22:32,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-22 11:22:32,195 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:32,195 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:32,196 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:32,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:32,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1285114177, now seen corresponding path program 1 times [2019-10-22 11:22:32,196 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:32,196 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783081448] [2019-10-22 11:22:32,197 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:32,197 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:32,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:32,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:32,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:32,309 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783081448] [2019-10-22 11:22:32,309 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:32,309 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:22:32,309 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956471388] [2019-10-22 11:22:32,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:22:32,310 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:22:32,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:22:32,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:22:32,310 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 5 states. [2019-10-22 11:22:32,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:32,408 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2019-10-22 11:22:32,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:22:32,409 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-10-22 11:22:32,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:32,410 INFO L225 Difference]: With dead ends: 55 [2019-10-22 11:22:32,410 INFO L226 Difference]: Without dead ends: 43 [2019-10-22 11:22:32,410 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:22:32,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-22 11:22:32,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2019-10-22 11:22:32,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-22 11:22:32,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2019-10-22 11:22:32,415 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 14 [2019-10-22 11:22:32,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:32,415 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2019-10-22 11:22:32,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:22:32,416 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2019-10-22 11:22:32,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-22 11:22:32,416 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:32,416 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:32,417 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:32,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:32,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1621160418, now seen corresponding path program 1 times [2019-10-22 11:22:32,417 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:22:32,418 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922458124] [2019-10-22 11:22:32,418 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:32,418 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:22:32,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:22:32,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:32,469 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:32,469 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922458124] [2019-10-22 11:22:32,470 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [137638605] [2019-10-22 11:22:32,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7e832ca-8e65-4e8a-ab1a-700c42e70ced/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:22:32,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:32,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-22 11:22:32,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:22:32,604 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:22:32,605 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:22:32,607 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:22:32,619 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2019-10-22 11:22:32,620 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:32,631 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:32,637 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:22:32,638 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:22:32,639 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:22:32,641 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2019-10-22 11:22:32,641 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:32,654 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:32,655 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:22:32,655 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:36 [2019-10-22 11:22:32,721 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:22:32,722 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:32,732 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:32,736 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:32,737 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 1 case distinctions, treesize of input 22 treesize of output 10 [2019-10-22 11:22:32,737 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:32,743 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:32,743 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:22:32,744 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:7 [2019-10-22 11:22:32,748 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:32,748 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:22:32,762 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:32,762 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [840615851] [2019-10-22 11:22:32,769 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 18 [2019-10-22 11:22:32,814 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-10-22 11:22:32,815 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-22 11:22:33,112 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:22:33,113 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:22:33,117 INFO L168 Benchmark]: Toolchain (without parser) took 3160.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 944.5 MB in the beginning and 920.6 MB in the end (delta: 24.0 MB). Peak memory consumption was 162.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:33,117 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:22:33,118 INFO L168 Benchmark]: CACSL2BoogieTranslator took 589.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -177.0 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:33,118 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.29 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: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:33,119 INFO L168 Benchmark]: Boogie Preprocessor took 43.85 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:22:33,119 INFO L168 Benchmark]: RCFGBuilder took 456.95 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: 36.8 MB). Peak memory consumption was 36.8 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:33,120 INFO L168 Benchmark]: TraceAbstraction took 2017.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 920.6 MB in the end (delta: 155.3 MB). Peak memory consumption was 155.3 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:33,122 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 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 589.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -177.0 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 49.29 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: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.85 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 456.95 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: 36.8 MB). Peak memory consumption was 36.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2017.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 920.6 MB in the end (delta: 155.3 MB). Peak memory consumption was 155.3 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:22:35,511 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:22:35,512 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:22:35,523 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:22:35,523 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:22:35,524 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:22:35,525 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:22:35,527 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:22:35,528 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:22:35,529 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:22:35,530 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:22:35,531 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:22:35,531 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:22:35,532 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:22:35,533 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:22:35,534 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:22:35,535 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:22:35,536 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:22:35,537 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:22:35,539 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:22:35,540 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:22:35,541 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:22:35,542 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:22:35,543 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:22:35,545 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:22:35,546 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:22:35,546 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:22:35,547 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:22:35,547 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:22:35,548 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:22:35,548 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:22:35,549 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:22:35,550 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:22:35,550 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:22:35,551 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:22:35,551 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:22:35,552 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:22:35,552 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:22:35,552 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:22:35,553 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:22:35,554 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:22:35,555 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b7e832ca-8e65-4e8a-ab1a-700c42e70ced/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2019-10-22 11:22:35,567 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:22:35,567 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:22:35,568 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:22:35,568 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:22:35,568 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:22:35,568 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:22:35,569 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:22:35,569 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:22:35,569 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:22:35,569 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:22:35,570 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:22:35,570 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:22:35,570 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:22:35,570 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:22:35,570 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:22:35,570 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:22:35,571 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-10-22 11:22:35,571 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-10-22 11:22:35,571 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:22:35,571 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:22:35,571 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 11:22:35,571 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:22:35,572 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:22:35,572 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:22:35,572 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:22:35,572 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:22:35,572 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:22:35,573 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:22:35,573 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:22:35,573 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:22:35,573 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-10-22 11:22:35,573 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-10-22 11:22:35,573 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:22:35,573 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:22:35,574 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_b7e832ca-8e65-4e8a-ab1a-700c42e70ced/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 -> 789e632c72b5108c711cbdfccbf18346eae177df [2019-10-22 11:22:35,611 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:22:35,630 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:22:35,635 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:22:35,637 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:22:35,637 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:22:35,638 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b7e832ca-8e65-4e8a-ab1a-700c42e70ced/bin/utaipan/../../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i [2019-10-22 11:22:35,693 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b7e832ca-8e65-4e8a-ab1a-700c42e70ced/bin/utaipan/data/ee218b0f1/f7b29f88df1345f2ab5651428515ab92/FLAG80bab5072 [2019-10-22 11:22:36,152 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:22:36,153 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b7e832ca-8e65-4e8a-ab1a-700c42e70ced/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i [2019-10-22 11:22:36,164 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b7e832ca-8e65-4e8a-ab1a-700c42e70ced/bin/utaipan/data/ee218b0f1/f7b29f88df1345f2ab5651428515ab92/FLAG80bab5072 [2019-10-22 11:22:36,468 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b7e832ca-8e65-4e8a-ab1a-700c42e70ced/bin/utaipan/data/ee218b0f1/f7b29f88df1345f2ab5651428515ab92 [2019-10-22 11:22:36,471 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:22:36,472 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:22:36,473 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:22:36,473 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:22:36,477 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:22:36,477 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:22:36" (1/1) ... [2019-10-22 11:22:36,482 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d782960 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:36, skipping insertion in model container [2019-10-22 11:22:36,483 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:22:36" (1/1) ... [2019-10-22 11:22:36,491 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:22:36,538 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:22:36,909 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:22:37,009 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:22:37,088 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:22:37,139 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:22:37,140 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:37 WrapperNode [2019-10-22 11:22:37,140 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:22:37,141 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:22:37,141 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:22:37,141 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:22:37,152 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:37" (1/1) ... [2019-10-22 11:22:37,178 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:37" (1/1) ... [2019-10-22 11:22:37,207 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:22:37,207 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:22:37,207 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:22:37,207 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:22:37,217 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:37" (1/1) ... [2019-10-22 11:22:37,218 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:37" (1/1) ... [2019-10-22 11:22:37,222 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:37" (1/1) ... [2019-10-22 11:22:37,223 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:37" (1/1) ... [2019-10-22 11:22:37,235 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:37" (1/1) ... [2019-10-22 11:22:37,242 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:37" (1/1) ... [2019-10-22 11:22:37,245 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:37" (1/1) ... [2019-10-22 11:22:37,249 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:22:37,249 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:22:37,249 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:22:37,249 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:22:37,251 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7e832ca-8e65-4e8a-ab1a-700c42e70ced/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:22:37,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-10-22 11:22:37,315 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 11:22:37,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 11:22:37,315 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 11:22:37,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 11:22:37,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-10-22 11:22:37,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:22:37,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:22:37,917 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:22:37,918 INFO L284 CfgBuilder]: Removed 21 assume(true) statements. [2019-10-22 11:22:37,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:22:37 BoogieIcfgContainer [2019-10-22 11:22:37,919 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:22:37,920 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:22:37,921 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:22:37,924 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:22:37,925 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:22:36" (1/3) ... [2019-10-22 11:22:37,926 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6873fc21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:22:37, skipping insertion in model container [2019-10-22 11:22:37,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:22:37" (2/3) ... [2019-10-22 11:22:37,926 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6873fc21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:22:37, skipping insertion in model container [2019-10-22 11:22:37,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:22:37" (3/3) ... [2019-10-22 11:22:37,928 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-rb-cnstr_1-1.i [2019-10-22 11:22:37,939 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:22:37,947 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2019-10-22 11:22:37,957 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-10-22 11:22:37,984 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:22:37,984 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:22:37,984 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:22:37,985 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:22:37,985 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:22:37,985 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:22:37,985 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:22:37,985 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:22:37,998 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2019-10-22 11:22:38,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-10-22 11:22:38,005 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:38,006 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-10-22 11:22:38,008 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:38,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:38,014 INFO L82 PathProgramCache]: Analyzing trace with hash 891569350, now seen corresponding path program 1 times [2019-10-22 11:22:38,023 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:22:38,024 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2064011218] [2019-10-22 11:22:38,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7e832ca-8e65-4e8a-ab1a-700c42e70ced/bin/utaipan/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:22:38,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:38,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 1 conjunts are in the unsatisfiable core [2019-10-22 11:22:38,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:22:38,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:38,145 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:22:38,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:38,150 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2064011218] [2019-10-22 11:22:38,150 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:38,151 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-10-22 11:22:38,151 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016790873] [2019-10-22 11:22:38,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-22 11:22:38,156 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:22:38,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 11:22:38,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 11:22:38,175 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 2 states. [2019-10-22 11:22:38,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:38,199 INFO L93 Difference]: Finished difference Result 90 states and 148 transitions. [2019-10-22 11:22:38,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 11:22:38,201 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 6 [2019-10-22 11:22:38,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:38,213 INFO L225 Difference]: With dead ends: 90 [2019-10-22 11:22:38,213 INFO L226 Difference]: Without dead ends: 40 [2019-10-22 11:22:38,217 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 11:22:38,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-22 11:22:38,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-10-22 11:22:38,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-10-22 11:22:38,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2019-10-22 11:22:38,259 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 6 [2019-10-22 11:22:38,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:38,260 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2019-10-22 11:22:38,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-22 11:22:38,260 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2019-10-22 11:22:38,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-10-22 11:22:38,261 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:38,261 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-10-22 11:22:38,462 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:22:38,463 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:38,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:38,463 INFO L82 PathProgramCache]: Analyzing trace with hash 889692517, now seen corresponding path program 1 times [2019-10-22 11:22:38,464 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:22:38,464 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [488669570] [2019-10-22 11:22:38,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7e832ca-8e65-4e8a-ab1a-700c42e70ced/bin/utaipan/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:22:38,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:38,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 11:22:38,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:22:38,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:38,567 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:22:38,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:38,570 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [488669570] [2019-10-22 11:22:38,570 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:38,570 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-10-22 11:22:38,571 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606174862] [2019-10-22 11:22:38,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:22:38,573 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:22:38,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:22:38,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:22:38,574 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 4 states. [2019-10-22 11:22:38,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:38,939 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2019-10-22 11:22:38,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:22:38,941 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-10-22 11:22:38,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:38,942 INFO L225 Difference]: With dead ends: 43 [2019-10-22 11:22:38,942 INFO L226 Difference]: Without dead ends: 39 [2019-10-22 11:22:38,943 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:22:38,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-22 11:22:38,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2019-10-22 11:22:38,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-22 11:22:38,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2019-10-22 11:22:38,956 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 6 [2019-10-22 11:22:38,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:38,957 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2019-10-22 11:22:38,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:22:38,957 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2019-10-22 11:22:38,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-10-22 11:22:38,958 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:38,958 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:39,160 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:22:39,161 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:39,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:39,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1810723981, now seen corresponding path program 1 times [2019-10-22 11:22:39,162 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:22:39,162 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1648888669] [2019-10-22 11:22:39,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7e832ca-8e65-4e8a-ab1a-700c42e70ced/bin/utaipan/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:22:39,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:39,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 11:22:39,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:22:39,353 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-10-22 11:22:39,354 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:39,358 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:39,359 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:22:39,359 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-10-22 11:22:39,377 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 19 treesize of output 7 [2019-10-22 11:22:39,378 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:39,380 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:39,381 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:22:39,381 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-10-22 11:22:39,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:39,392 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:22:39,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:39,395 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1648888669] [2019-10-22 11:22:39,395 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:39,395 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-10-22 11:22:39,396 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915442620] [2019-10-22 11:22:39,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:22:39,396 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:22:39,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:22:39,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:22:39,397 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand 4 states. [2019-10-22 11:22:39,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:39,948 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2019-10-22 11:22:39,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:22:39,950 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-10-22 11:22:39,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:39,950 INFO L225 Difference]: With dead ends: 36 [2019-10-22 11:22:39,951 INFO L226 Difference]: Without dead ends: 34 [2019-10-22 11:22:39,951 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:22:39,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-22 11:22:39,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-10-22 11:22:39,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-22 11:22:39,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2019-10-22 11:22:39,956 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 7 [2019-10-22 11:22:39,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:39,957 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2019-10-22 11:22:39,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:22:39,957 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2019-10-22 11:22:39,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-10-22 11:22:39,957 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:39,958 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:40,158 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:22:40,159 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:40,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:40,159 INFO L82 PathProgramCache]: Analyzing trace with hash 590587384, now seen corresponding path program 1 times [2019-10-22 11:22:40,159 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:22:40,160 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [971286624] [2019-10-22 11:22:40,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7e832ca-8e65-4e8a-ab1a-700c42e70ced/bin/utaipan/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:22:40,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:40,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-22 11:22:40,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:22:40,248 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-10-22 11:22:40,248 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:40,256 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:40,257 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:22:40,257 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-10-22 11:22:40,300 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:22:40,301 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:40,307 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:40,307 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:22:40,308 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-22 11:22:40,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:40,319 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:22:40,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:22:40,369 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [971286624] [2019-10-22 11:22:40,369 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:40,369 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2019-10-22 11:22:40,369 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609560532] [2019-10-22 11:22:40,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 11:22:40,372 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:22:40,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 11:22:40,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:22:40,373 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 7 states. [2019-10-22 11:22:42,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:42,474 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2019-10-22 11:22:42,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:22:42,479 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-10-22 11:22:42,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:42,480 INFO L225 Difference]: With dead ends: 71 [2019-10-22 11:22:42,480 INFO L226 Difference]: Without dead ends: 69 [2019-10-22 11:22:42,481 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:22:42,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-10-22 11:22:42,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 50. [2019-10-22 11:22:42,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-10-22 11:22:42,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2019-10-22 11:22:42,495 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 9 [2019-10-22 11:22:42,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:42,496 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2019-10-22 11:22:42,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 11:22:42,496 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2019-10-22 11:22:42,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-22 11:22:42,497 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:42,497 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:42,698 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:22:42,698 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:42,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:42,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1507179337, now seen corresponding path program 1 times [2019-10-22 11:22:42,699 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:22:42,699 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1719530722] [2019-10-22 11:22:42,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7e832ca-8e65-4e8a-ab1a-700c42e70ced/bin/utaipan/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:22:42,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:42,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-22 11:22:42,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:22:42,862 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-22 11:22:42,863 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:42,865 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:42,866 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:22:42,866 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-10-22 11:22:42,916 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:42,917 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 41 [2019-10-22 11:22:42,921 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:42,962 INFO L567 ElimStorePlain]: treesize reduction 14, result has 77.4 percent of original size [2019-10-22 11:22:42,968 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:22:42,969 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:42,981 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:42,983 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:22:42,983 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:52, output treesize:17 [2019-10-22 11:22:43,160 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:43,161 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-10-22 11:22:43,162 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:44,152 WARN L191 SmtUtils]: Spent 989.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-10-22 11:22:44,153 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:44,155 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_26|], 10=[|v_#memory_$Pointer$.offset_26|]} [2019-10-22 11:22:44,225 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:22:44,282 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:22:44,288 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:22:44,360 INFO L341 Elim1Store]: treesize reduction 33, result has 55.4 percent of original size [2019-10-22 11:22:44,361 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 55 [2019-10-22 11:22:44,362 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:44,873 WARN L191 SmtUtils]: Spent 510.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-10-22 11:22:44,873 INFO L567 ElimStorePlain]: treesize reduction 16, result has 90.5 percent of original size [2019-10-22 11:22:44,882 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:22:44,893 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:22:45,039 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 31 [2019-10-22 11:22:45,040 INFO L341 Elim1Store]: treesize reduction 89, result has 39.5 percent of original size [2019-10-22 11:22:45,040 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 68 [2019-10-22 11:22:45,041 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:45,187 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-10-22 11:22:45,187 INFO L567 ElimStorePlain]: treesize reduction 33, result has 72.0 percent of original size [2019-10-22 11:22:45,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:22:45,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:45,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:45,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:45,199 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:22:45,200 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:195, output treesize:107 [2019-10-22 11:22:45,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:22:45,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:45,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:45,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:45,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:22:45,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:45,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:45,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:45,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:22:45,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:45,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:45,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:45,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:22:45,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:45,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:45,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:45,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:22:45,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:45,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:45,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:45,402 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:45,402 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 74 [2019-10-22 11:22:45,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:45,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:45,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:45,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:45,409 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:22:45,424 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:45,424 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 37 [2019-10-22 11:22:45,426 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:22:45,434 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:45,435 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 46 [2019-10-22 11:22:45,437 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:22:45,565 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-10-22 11:22:45,565 INFO L567 ElimStorePlain]: treesize reduction 23, result has 83.2 percent of original size [2019-10-22 11:22:45,584 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:22:45,585 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 28 [2019-10-22 11:22:45,586 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-22 11:22:45,786 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:22:45,787 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.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) 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:22:45,791 INFO L168 Benchmark]: Toolchain (without parser) took 9319.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 172.0 MB). Free memory was 940.2 MB in the beginning and 863.4 MB in the end (delta: 76.8 MB). Peak memory consumption was 248.8 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:45,791 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 972.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:22:45,792 INFO L168 Benchmark]: CACSL2BoogieTranslator took 667.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 172.0 MB). Free memory was 940.2 MB in the beginning and 1.2 GB in the end (delta: -211.8 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:45,792 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:45,793 INFO L168 Benchmark]: Boogie Preprocessor took 41.72 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:22:45,793 INFO L168 Benchmark]: RCFGBuilder took 670.58 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: 30.9 MB). Peak memory consumption was 30.9 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:45,793 INFO L168 Benchmark]: TraceAbstraction took 7869.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 863.4 MB in the end (delta: 251.1 MB). Peak memory consumption was 251.1 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:45,797 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 972.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 667.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 172.0 MB). Free memory was 940.2 MB in the beginning and 1.2 GB in the end (delta: -211.8 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 65.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.72 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 670.58 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: 30.9 MB). Peak memory consumption was 30.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7869.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 863.4 MB in the end (delta: 251.1 MB). Peak memory consumption was 251.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: expected NNF de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: expected NNF: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:236) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...