./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/forester-heap/sll-reverse_simple.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_c0830e47-82c5-4c3f-8842-b43b5d7b88c9/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c0830e47-82c5-4c3f-8842-b43b5d7b88c9/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c0830e47-82c5-4c3f-8842-b43b5d7b88c9/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c0830e47-82c5-4c3f-8842-b43b5d7b88c9/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/forester-heap/sll-reverse_simple.i -s /tmp/vcloud-vcloud-master/worker/working_dir_c0830e47-82c5-4c3f-8842-b43b5d7b88c9/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c0830e47-82c5-4c3f-8842-b43b5d7b88c9/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 acdd122f5068e78adf2c5d9843dc58624176c7bc ......................................................................................................................................................................................................................................................................................................................................................................................................................... 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_c0830e47-82c5-4c3f-8842-b43b5d7b88c9/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c0830e47-82c5-4c3f-8842-b43b5d7b88c9/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c0830e47-82c5-4c3f-8842-b43b5d7b88c9/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c0830e47-82c5-4c3f-8842-b43b5d7b88c9/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/forester-heap/sll-reverse_simple.i -s /tmp/vcloud-vcloud-master/worker/working_dir_c0830e47-82c5-4c3f-8842-b43b5d7b88c9/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c0830e47-82c5-4c3f-8842-b43b5d7b88c9/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 acdd122f5068e78adf2c5d9843dc58624176c7bc ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:25:12,694 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:25:12,695 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:25:12,709 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:25:12,709 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:25:12,710 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:25:12,711 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:25:12,714 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:25:12,715 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:25:12,716 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:25:12,716 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:25:12,717 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:25:12,717 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:25:12,718 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:25:12,719 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:25:12,719 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:25:12,727 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:25:12,727 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:25:12,728 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:25:12,730 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:25:12,731 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:25:12,731 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:25:12,735 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:25:12,736 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:25:12,741 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:25:12,741 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:25:12,741 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:25:12,742 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:25:12,742 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:25:12,743 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:25:12,743 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:25:12,744 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:25:12,744 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:25:12,745 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:25:12,746 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:25:12,746 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:25:12,746 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:25:12,746 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:25:12,747 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:25:12,747 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:25:12,750 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:25:12,751 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c0830e47-82c5-4c3f-8842-b43b5d7b88c9/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-10-22 11:25:12,764 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:25:12,765 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:25:12,765 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:25:12,765 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:25:12,766 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:25:12,766 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:25:12,766 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:25:12,766 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:25:12,766 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:25:12,766 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:25:12,766 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:25:12,767 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:25:12,767 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:25:12,767 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:25:12,767 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:25:12,768 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:25:12,776 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:25:12,777 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:25:12,777 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:25:12,777 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:25:12,777 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:25:12,777 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:25:12,777 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:25:12,777 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:25:12,778 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:25:12,778 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:25:12,778 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:25:12,778 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:25:12,778 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:25:12,778 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:25:12,778 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:25:12,778 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:25:12,779 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:25:12,779 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:25:12,779 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:25:12,779 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_c0830e47-82c5-4c3f-8842-b43b5d7b88c9/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 -> acdd122f5068e78adf2c5d9843dc58624176c7bc [2019-10-22 11:25:12,812 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:25:12,823 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:25:12,826 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:25:12,827 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:25:12,827 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:25:12,828 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c0830e47-82c5-4c3f-8842-b43b5d7b88c9/bin/utaipan/../../sv-benchmarks/c/forester-heap/sll-reverse_simple.i [2019-10-22 11:25:12,889 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c0830e47-82c5-4c3f-8842-b43b5d7b88c9/bin/utaipan/data/43dafce9d/68456c0bca244944b39299f9486e9d9e/FLAGdc84656f8 [2019-10-22 11:25:13,327 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:25:13,329 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c0830e47-82c5-4c3f-8842-b43b5d7b88c9/sv-benchmarks/c/forester-heap/sll-reverse_simple.i [2019-10-22 11:25:13,339 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c0830e47-82c5-4c3f-8842-b43b5d7b88c9/bin/utaipan/data/43dafce9d/68456c0bca244944b39299f9486e9d9e/FLAGdc84656f8 [2019-10-22 11:25:13,679 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c0830e47-82c5-4c3f-8842-b43b5d7b88c9/bin/utaipan/data/43dafce9d/68456c0bca244944b39299f9486e9d9e [2019-10-22 11:25:13,681 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:25:13,683 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:25:13,684 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:25:13,684 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:25:13,688 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:25:13,689 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:25:13" (1/1) ... [2019-10-22 11:25:13,691 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@350c055c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:13, skipping insertion in model container [2019-10-22 11:25:13,691 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:25:13" (1/1) ... [2019-10-22 11:25:13,698 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:25:13,738 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:25:14,044 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:25:14,054 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:25:14,118 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:25:14,151 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:25:14,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:14 WrapperNode [2019-10-22 11:25:14,152 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:25:14,153 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:25:14,153 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:25:14,153 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:25:14,160 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:25:14" (1/1) ... [2019-10-22 11:25:14,175 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:25:14" (1/1) ... [2019-10-22 11:25:14,195 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:25:14,196 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:25:14,197 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:25:14,197 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:25:14,206 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:14" (1/1) ... [2019-10-22 11:25:14,206 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:14" (1/1) ... [2019-10-22 11:25:14,209 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:14" (1/1) ... [2019-10-22 11:25:14,210 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:14" (1/1) ... [2019-10-22 11:25:14,217 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:14" (1/1) ... [2019-10-22 11:25:14,224 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:14" (1/1) ... [2019-10-22 11:25:14,227 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:14" (1/1) ... [2019-10-22 11:25:14,229 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:25:14,230 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:25:14,230 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:25:14,230 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:25:14,231 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c0830e47-82c5-4c3f-8842-b43b5d7b88c9/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:25:14,284 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 11:25:14,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 11:25:14,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 11:25:14,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 11:25:14,285 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 11:25:14,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 11:25:14,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:25:14,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:25:14,626 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:25:14,627 INFO L284 CfgBuilder]: Removed 15 assume(true) statements. [2019-10-22 11:25:14,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:25:14 BoogieIcfgContainer [2019-10-22 11:25:14,628 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:25:14,629 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:25:14,629 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:25:14,632 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:25:14,632 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:25:13" (1/3) ... [2019-10-22 11:25:14,633 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@668e6d4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:25:14, skipping insertion in model container [2019-10-22 11:25:14,633 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:14" (2/3) ... [2019-10-22 11:25:14,634 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@668e6d4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:25:14, skipping insertion in model container [2019-10-22 11:25:14,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:25:14" (3/3) ... [2019-10-22 11:25:14,635 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-reverse_simple.i [2019-10-22 11:25:14,644 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:25:14,651 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-10-22 11:25:14,660 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-10-22 11:25:14,683 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:25:14,683 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:25:14,683 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:25:14,683 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:25:14,683 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:25:14,683 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:25:14,683 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:25:14,683 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:25:14,694 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2019-10-22 11:25:14,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-10-22 11:25:14,699 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:14,700 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:14,702 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:14,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:14,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1813527409, now seen corresponding path program 1 times [2019-10-22 11:25:14,715 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:14,716 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744414908] [2019-10-22 11:25:14,716 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:14,716 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:14,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:14,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:14,842 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:25:14,842 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744414908] [2019-10-22 11:25:14,843 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:14,843 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:25:14,843 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102054615] [2019-10-22 11:25:14,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-22 11:25:14,848 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:14,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 11:25:14,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 11:25:14,859 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 2 states. [2019-10-22 11:25:14,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:14,876 INFO L93 Difference]: Finished difference Result 70 states and 112 transitions. [2019-10-22 11:25:14,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 11:25:14,877 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 7 [2019-10-22 11:25:14,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:14,887 INFO L225 Difference]: With dead ends: 70 [2019-10-22 11:25:14,888 INFO L226 Difference]: Without dead ends: 31 [2019-10-22 11:25:14,891 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:25:14,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-10-22 11:25:14,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-10-22 11:25:14,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-22 11:25:14,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2019-10-22 11:25:14,919 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 7 [2019-10-22 11:25:14,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:14,920 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2019-10-22 11:25:14,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-22 11:25:14,920 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2019-10-22 11:25:14,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-22 11:25:14,920 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:14,920 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:14,921 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:14,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:14,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1038813004, now seen corresponding path program 1 times [2019-10-22 11:25:14,921 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:14,921 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066220496] [2019-10-22 11:25:14,922 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:14,922 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:14,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:14,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:15,032 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:25:15,032 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066220496] [2019-10-22 11:25:15,032 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:15,032 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:25:15,032 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076307055] [2019-10-22 11:25:15,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:25:15,034 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:15,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:25:15,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:25:15,035 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand 5 states. [2019-10-22 11:25:15,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:15,229 INFO L93 Difference]: Finished difference Result 71 states and 89 transitions. [2019-10-22 11:25:15,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:25:15,230 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-10-22 11:25:15,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:15,230 INFO L225 Difference]: With dead ends: 71 [2019-10-22 11:25:15,230 INFO L226 Difference]: Without dead ends: 45 [2019-10-22 11:25:15,231 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 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:25:15,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-22 11:25:15,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 37. [2019-10-22 11:25:15,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-22 11:25:15,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2019-10-22 11:25:15,239 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 10 [2019-10-22 11:25:15,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:15,239 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2019-10-22 11:25:15,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:25:15,239 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2019-10-22 11:25:15,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-22 11:25:15,240 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:15,240 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:15,240 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:15,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:15,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1038754672, now seen corresponding path program 1 times [2019-10-22 11:25:15,241 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:15,241 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378868187] [2019-10-22 11:25:15,241 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:15,241 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:15,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:15,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:15,311 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:25:15,312 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378868187] [2019-10-22 11:25:15,312 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:15,312 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:25:15,312 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385400198] [2019-10-22 11:25:15,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:25:15,313 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:15,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:25:15,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:25:15,313 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand 4 states. [2019-10-22 11:25:15,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:15,422 INFO L93 Difference]: Finished difference Result 64 states and 78 transitions. [2019-10-22 11:25:15,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:25:15,423 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-10-22 11:25:15,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:15,424 INFO L225 Difference]: With dead ends: 64 [2019-10-22 11:25:15,424 INFO L226 Difference]: Without dead ends: 50 [2019-10-22 11:25:15,425 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:25:15,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-10-22 11:25:15,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 44. [2019-10-22 11:25:15,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-22 11:25:15,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2019-10-22 11:25:15,434 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 54 transitions. Word has length 10 [2019-10-22 11:25:15,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:15,434 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 54 transitions. [2019-10-22 11:25:15,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:25:15,434 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2019-10-22 11:25:15,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-22 11:25:15,435 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:15,435 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:15,435 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:15,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:15,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1414194791, now seen corresponding path program 1 times [2019-10-22 11:25:15,436 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:15,436 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985075270] [2019-10-22 11:25:15,436 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:15,436 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:15,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:15,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:15,542 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 11:25:15,542 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985075270] [2019-10-22 11:25:15,542 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149084471] [2019-10-22 11:25:15,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c0830e47-82c5-4c3f-8842-b43b5d7b88c9/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:25:15,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:15,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-22 11:25:15,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:25:15,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:25:15,688 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2019-10-22 11:25:15,689 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:25:15,692 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 23 treesize of output 19 [2019-10-22 11:25:15,693 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:25:15,704 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:25:15,707 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 12 treesize of output 8 [2019-10-22 11:25:15,708 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-22 11:25:15,710 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 16 treesize of output 8 [2019-10-22 11:25:15,711 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-22 11:25:15,715 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:25:15,715 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-22 11:25:15,715 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:9 [2019-10-22 11:25:15,718 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 11:25:15,718 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:25:15,730 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 11:25:15,730 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [609998073] [2019-10-22 11:25:15,735 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 19 [2019-10-22 11:25:15,780 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-10-22 11:25:15,780 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-22 11:25:16,057 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:25:16,057 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:25:16,061 INFO L168 Benchmark]: Toolchain (without parser) took 2378.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 937.8 MB in the beginning and 993.1 MB in the end (delta: -55.4 MB). Peak memory consumption was 96.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:16,061 INFO L168 Benchmark]: CDTParser took 0.37 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:25:16,062 INFO L168 Benchmark]: CACSL2BoogieTranslator took 468.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 937.8 MB in the beginning and 1.1 GB in the end (delta: -190.3 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:16,062 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.97 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:25:16,063 INFO L168 Benchmark]: Boogie Preprocessor took 33.68 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:25:16,063 INFO L168 Benchmark]: RCFGBuilder took 398.41 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: 34.8 MB). Peak memory consumption was 34.8 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:16,064 INFO L168 Benchmark]: TraceAbstraction took 1430.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 993.1 MB in the end (delta: 100.1 MB). Peak memory consumption was 100.1 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:16,066 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.37 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 468.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 937.8 MB in the beginning and 1.1 GB in the end (delta: -190.3 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 42.97 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.68 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 398.41 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: 34.8 MB). Peak memory consumption was 34.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1430.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 993.1 MB in the end (delta: 100.1 MB). Peak memory consumption was 100.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: inappropriate decl info IMPLEMENTATION de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: inappropriate decl info IMPLEMENTATION: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Boogie2SmtSymbolTable.getBoogieVar(Boogie2SmtSymbolTable.java:222) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-10-22 11:25:18,122 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:25:18,123 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:25:18,131 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:25:18,132 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:25:18,133 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:25:18,136 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:25:18,137 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:25:18,138 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:25:18,139 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:25:18,144 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:25:18,146 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:25:18,150 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:25:18,151 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:25:18,151 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:25:18,152 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:25:18,153 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:25:18,154 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:25:18,155 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:25:18,158 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:25:18,162 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:25:18,166 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:25:18,168 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:25:18,169 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:25:18,176 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:25:18,176 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:25:18,176 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:25:18,177 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:25:18,177 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:25:18,178 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:25:18,178 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:25:18,179 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:25:18,179 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:25:18,181 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:25:18,182 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:25:18,182 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:25:18,182 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:25:18,183 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:25:18,183 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:25:18,183 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:25:18,184 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:25:18,185 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c0830e47-82c5-4c3f-8842-b43b5d7b88c9/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2019-10-22 11:25:18,198 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:25:18,199 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:25:18,200 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:25:18,200 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:25:18,200 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:25:18,200 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:25:18,201 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:25:18,201 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:25:18,201 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:25:18,202 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:25:18,202 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:25:18,202 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:25:18,202 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:25:18,202 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:25:18,202 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:25:18,203 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:25:18,203 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-10-22 11:25:18,203 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-10-22 11:25:18,203 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:25:18,203 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:25:18,203 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 11:25:18,203 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:25:18,204 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:25:18,204 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:25:18,205 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:25:18,205 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:25:18,205 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:25:18,205 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:25:18,205 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:25:18,205 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:25:18,206 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-10-22 11:25:18,206 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-10-22 11:25:18,206 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:25:18,206 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:25:18,206 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_c0830e47-82c5-4c3f-8842-b43b5d7b88c9/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 -> acdd122f5068e78adf2c5d9843dc58624176c7bc [2019-10-22 11:25:18,245 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:25:18,258 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:25:18,261 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:25:18,262 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:25:18,263 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:25:18,263 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c0830e47-82c5-4c3f-8842-b43b5d7b88c9/bin/utaipan/../../sv-benchmarks/c/forester-heap/sll-reverse_simple.i [2019-10-22 11:25:18,311 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c0830e47-82c5-4c3f-8842-b43b5d7b88c9/bin/utaipan/data/70c4fe9c2/562acf14e5c6403c98ed4e92618257b8/FLAGe5cdb3fc0 [2019-10-22 11:25:18,730 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:25:18,732 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c0830e47-82c5-4c3f-8842-b43b5d7b88c9/sv-benchmarks/c/forester-heap/sll-reverse_simple.i [2019-10-22 11:25:18,745 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c0830e47-82c5-4c3f-8842-b43b5d7b88c9/bin/utaipan/data/70c4fe9c2/562acf14e5c6403c98ed4e92618257b8/FLAGe5cdb3fc0 [2019-10-22 11:25:19,050 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c0830e47-82c5-4c3f-8842-b43b5d7b88c9/bin/utaipan/data/70c4fe9c2/562acf14e5c6403c98ed4e92618257b8 [2019-10-22 11:25:19,053 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:25:19,054 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:25:19,055 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:25:19,055 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:25:19,058 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:25:19,059 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:25:19" (1/1) ... [2019-10-22 11:25:19,062 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31a10188 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:19, skipping insertion in model container [2019-10-22 11:25:19,062 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:25:19" (1/1) ... [2019-10-22 11:25:19,069 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:25:19,107 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:25:19,376 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:25:19,454 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:25:19,518 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:25:19,561 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:25:19,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:19 WrapperNode [2019-10-22 11:25:19,562 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:25:19,562 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:25:19,562 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:25:19,563 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:25:19,571 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:25:19" (1/1) ... [2019-10-22 11:25:19,589 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:25:19" (1/1) ... [2019-10-22 11:25:19,610 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:25:19,612 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:25:19,615 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:25:19,615 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:25:19,623 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:19" (1/1) ... [2019-10-22 11:25:19,623 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:19" (1/1) ... [2019-10-22 11:25:19,627 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:19" (1/1) ... [2019-10-22 11:25:19,627 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:19" (1/1) ... [2019-10-22 11:25:19,637 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:19" (1/1) ... [2019-10-22 11:25:19,642 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:19" (1/1) ... [2019-10-22 11:25:19,644 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:19" (1/1) ... [2019-10-22 11:25:19,647 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:25:19,647 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:25:19,647 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:25:19,647 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:25:19,648 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c0830e47-82c5-4c3f-8842-b43b5d7b88c9/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:25:19,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-10-22 11:25:19,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 11:25:19,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 11:25:19,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 11:25:19,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 11:25:19,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-10-22 11:25:19,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:25:19,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:25:20,089 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:25:20,090 INFO L284 CfgBuilder]: Removed 15 assume(true) statements. [2019-10-22 11:25:20,091 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:25:20 BoogieIcfgContainer [2019-10-22 11:25:20,091 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:25:20,092 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:25:20,092 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:25:20,094 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:25:20,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:25:19" (1/3) ... [2019-10-22 11:25:20,095 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@399e0258 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:25:20, skipping insertion in model container [2019-10-22 11:25:20,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:19" (2/3) ... [2019-10-22 11:25:20,096 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@399e0258 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:25:20, skipping insertion in model container [2019-10-22 11:25:20,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:25:20" (3/3) ... [2019-10-22 11:25:20,097 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-reverse_simple.i [2019-10-22 11:25:20,105 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:25:20,110 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-10-22 11:25:20,119 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-10-22 11:25:20,137 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:25:20,137 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:25:20,137 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:25:20,137 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:25:20,137 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:25:20,137 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:25:20,138 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:25:20,138 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:25:20,147 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2019-10-22 11:25:20,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-10-22 11:25:20,152 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:20,152 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:20,154 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:20,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:20,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1808873062, now seen corresponding path program 1 times [2019-10-22 11:25:20,164 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:25:20,164 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [349502555] [2019-10-22 11:25:20,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c0830e47-82c5-4c3f-8842-b43b5d7b88c9/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:25:20,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:20,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 1 conjunts are in the unsatisfiable core [2019-10-22 11:25:20,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:25:20,280 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:25:20,281 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:25:20,283 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:25:20,284 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [349502555] [2019-10-22 11:25:20,285 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:20,285 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-10-22 11:25:20,285 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728838458] [2019-10-22 11:25:20,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-22 11:25:20,290 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:25:20,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 11:25:20,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 11:25:20,305 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 2 states. [2019-10-22 11:25:20,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:20,325 INFO L93 Difference]: Finished difference Result 67 states and 107 transitions. [2019-10-22 11:25:20,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 11:25:20,326 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 7 [2019-10-22 11:25:20,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:20,332 INFO L225 Difference]: With dead ends: 67 [2019-10-22 11:25:20,333 INFO L226 Difference]: Without dead ends: 29 [2019-10-22 11:25:20,336 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 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:25:20,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-22 11:25:20,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-10-22 11:25:20,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-22 11:25:20,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2019-10-22 11:25:20,367 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 7 [2019-10-22 11:25:20,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:20,367 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2019-10-22 11:25:20,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-22 11:25:20,368 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2019-10-22 11:25:20,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-10-22 11:25:20,368 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:20,368 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:20,569 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:25:20,569 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:20,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:20,570 INFO L82 PathProgramCache]: Analyzing trace with hash 239687661, now seen corresponding path program 1 times [2019-10-22 11:25:20,570 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:25:20,570 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1860674292] [2019-10-22 11:25:20,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c0830e47-82c5-4c3f-8842-b43b5d7b88c9/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:25:20,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:20,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 11:25:20,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:25:20,676 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:25:20,676 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:25:20,679 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:25:20,680 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1860674292] [2019-10-22 11:25:20,682 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:20,683 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-10-22 11:25:20,683 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843410393] [2019-10-22 11:25:20,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:25:20,684 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:25:20,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:25:20,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:25:20,687 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand 4 states. [2019-10-22 11:25:20,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:20,945 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2019-10-22 11:25:20,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:25:20,945 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-10-22 11:25:20,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:20,946 INFO L225 Difference]: With dead ends: 54 [2019-10-22 11:25:20,946 INFO L226 Difference]: Without dead ends: 40 [2019-10-22 11:25:20,947 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:25:20,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-22 11:25:20,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 34. [2019-10-22 11:25:20,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-22 11:25:20,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2019-10-22 11:25:20,954 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 8 [2019-10-22 11:25:20,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:20,954 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2019-10-22 11:25:20,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:25:20,955 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2019-10-22 11:25:20,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-22 11:25:20,955 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:20,956 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:21,156 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:25:21,157 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:21,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:21,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1200905122, now seen corresponding path program 1 times [2019-10-22 11:25:21,157 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:25:21,158 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [919551239] [2019-10-22 11:25:21,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c0830e47-82c5-4c3f-8842-b43b5d7b88c9/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:25:21,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:21,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-22 11:25:21,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:25:21,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:25:21,323 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 23 treesize of output 19 [2019-10-22 11:25:21,324 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:25:21,328 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 23 treesize of output 15 [2019-10-22 11:25:21,329 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:25:21,348 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:25:21,356 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 16 treesize of output 8 [2019-10-22 11:25:21,357 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-22 11:25:21,361 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 12 treesize of output 8 [2019-10-22 11:25:21,362 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-22 11:25:21,367 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:25:21,368 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-22 11:25:21,368 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:9 [2019-10-22 11:25:21,383 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:25:21,383 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:25:21,413 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:25:21,414 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [919551239] [2019-10-22 11:25:21,414 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784238236] [2019-10-22 11:25:21,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c0830e47-82c5-4c3f-8842-b43b5d7b88c9/bin/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:25:21,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:21,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-22 11:25:21,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:25:21,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:25:21,479 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 23 treesize of output 19 [2019-10-22 11:25:21,479 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:25:21,485 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 23 treesize of output 15 [2019-10-22 11:25:21,486 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:25:21,506 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:25:21,510 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 16 treesize of output 8 [2019-10-22 11:25:21,511 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-22 11:25:21,515 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 12 treesize of output 8 [2019-10-22 11:25:21,515 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-22 11:25:21,520 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:25:21,521 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-22 11:25:21,521 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:9 [2019-10-22 11:25:21,523 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:25:21,524 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:25:21,531 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:25:21,531 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-22 11:25:21,531 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5] total 6 [2019-10-22 11:25:21,531 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753529199] [2019-10-22 11:25:21,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:25:21,532 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:25:21,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:25:21,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:25:21,533 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand 6 states. [2019-10-22 11:25:22,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:22,159 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2019-10-22 11:25:22,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:25:22,161 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-10-22 11:25:22,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:22,162 INFO L225 Difference]: With dead ends: 35 [2019-10-22 11:25:22,162 INFO L226 Difference]: Without dead ends: 31 [2019-10-22 11:25:22,162 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:25:22,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-10-22 11:25:22,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2019-10-22 11:25:22,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-22 11:25:22,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2019-10-22 11:25:22,167 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 13 [2019-10-22 11:25:22,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:22,167 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2019-10-22 11:25:22,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:25:22,168 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2019-10-22 11:25:22,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-22 11:25:22,170 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:22,171 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:22,571 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:25:22,572 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:22,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:22,572 INFO L82 PathProgramCache]: Analyzing trace with hash 825424614, now seen corresponding path program 1 times [2019-10-22 11:25:22,572 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:25:22,573 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [141849241] [2019-10-22 11:25:22,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c0830e47-82c5-4c3f-8842-b43b5d7b88c9/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:25:22,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:22,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-22 11:25:22,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:25:22,726 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:25:22,726 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:25:22,733 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:25:22,733 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:25:22,733 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-22 11:25:22,797 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:25:22,797 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-22 11:25:22,798 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:25:22,827 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:25:22,844 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-10-22 11:25:22,845 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 15 [2019-10-22 11:25:22,845 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:25:22,857 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:25:22,859 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 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:25:22,859 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:56, output treesize:31 [2019-10-22 11:25:22,916 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:25:22,916 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 30 [2019-10-22 11:25:22,917 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:25:22,932 INFO L567 ElimStorePlain]: treesize reduction 12, result has 42.9 percent of original size [2019-10-22 11:25:22,933 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:25:22,934 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:35, output treesize:4 [2019-10-22 11:25:22,947 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:22,947 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:25:22,993 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.base|], 2=[|v_#memory_$Pointer$.base_28|]} [2019-10-22 11:25:23,060 INFO L341 Elim1Store]: treesize reduction 76, result has 33.3 percent of original size [2019-10-22 11:25:23,060 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 38 [2019-10-22 11:25:23,061 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:25:23,090 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:25:23,123 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:25:23,123 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 79 [2019-10-22 11:25:23,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:25:23,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:25:23,126 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-10-22 11:25:23,199 INFO L567 ElimStorePlain]: treesize reduction 21, result has 66.1 percent of original size [2019-10-22 11:25:23,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:25:23,203 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-10-22 11:25:23,203 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:57, output treesize:31 [2019-10-22 11:25:23,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:23,414 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [141849241] [2019-10-22 11:25:23,414 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482517778] [2019-10-22 11:25:23,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c0830e47-82c5-4c3f-8842-b43b5d7b88c9/bin/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:25:23,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:23,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-22 11:25:23,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:25:23,485 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:25:23,485 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:25:23,489 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:25:23,489 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:25:23,489 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-10-22 11:25:23,563 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:25:23,564 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-22 11:25:23,564 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:25:23,577 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:25:23,592 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-10-22 11:25:23,593 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 15 [2019-10-22 11:25:23,593 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:25:23,607 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:25:23,608 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 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:25:23,608 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:53, output treesize:28 [2019-10-22 11:25:23,689 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:25:23,690 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 30 [2019-10-22 11:25:23,691 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:25:23,703 INFO L567 ElimStorePlain]: treesize reduction 12, result has 42.9 percent of original size [2019-10-22 11:25:23,704 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:25:23,704 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:4 [2019-10-22 11:25:23,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:23,705 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:25:23,715 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.base|], 2=[|v_#memory_$Pointer$.base_34|]} [2019-10-22 11:25:23,795 INFO L341 Elim1Store]: treesize reduction 76, result has 33.3 percent of original size [2019-10-22 11:25:23,795 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 38 [2019-10-22 11:25:23,796 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:25:23,822 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:25:23,853 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:25:23,854 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 79 [2019-10-22 11:25:23,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:25:23,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:25:23,856 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2019-10-22 11:25:23,940 INFO L567 ElimStorePlain]: treesize reduction 4, result has 91.1 percent of original size [2019-10-22 11:25:23,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:25:23,942 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-10-22 11:25:23,943 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:57, output treesize:31 [2019-10-22 11:25:24,100 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:24,100 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-22 11:25:24,101 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7] total 15 [2019-10-22 11:25:24,101 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170987586] [2019-10-22 11:25:24,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-22 11:25:24,101 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:25:24,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-22 11:25:24,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-10-22 11:25:24,102 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand 15 states. [2019-10-22 11:25:34,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:34,864 INFO L93 Difference]: Finished difference Result 87 states and 106 transitions. [2019-10-22 11:25:34,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-22 11:25:34,864 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2019-10-22 11:25:34,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:34,866 INFO L225 Difference]: With dead ends: 87 [2019-10-22 11:25:34,866 INFO L226 Difference]: Without dead ends: 77 [2019-10-22 11:25:34,867 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 44 SyntacticMatches, 12 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2019-10-22 11:25:34,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-10-22 11:25:34,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 43. [2019-10-22 11:25:34,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-22 11:25:34,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 55 transitions. [2019-10-22 11:25:34,875 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 55 transitions. Word has length 18 [2019-10-22 11:25:34,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:34,876 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 55 transitions. [2019-10-22 11:25:34,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-22 11:25:34,880 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 55 transitions. [2019-10-22 11:25:34,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-22 11:25:34,882 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:34,882 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:35,282 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:25:35,283 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:35,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:35,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1505482984, now seen corresponding path program 1 times [2019-10-22 11:25:35,283 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:25:35,283 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1871094999] [2019-10-22 11:25:35,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c0830e47-82c5-4c3f-8842-b43b5d7b88c9/bin/utaipan/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:25:35,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:35,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-22 11:25:35,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:25:35,409 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:25:35,410 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2019-10-22 11:25:35,410 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:25:35,424 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:25:35,428 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:25:35,429 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2019-10-22 11:25:35,429 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:25:35,435 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:25:35,436 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:25:35,436 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:18 [2019-10-22 11:25:35,469 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-10-22 11:25:35,469 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:25:35,482 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:25:35,485 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:25:35,498 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:25:35,501 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 18 treesize of output 14 [2019-10-22 11:25:35,508 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-22 11:25:35,509 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-22 11:25:35,510 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:25:35,510 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:25:35,520 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:25:35,524 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:25:35,524 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-22 11:25:35,528 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:25:35,528 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:25:35,529 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:59, output treesize:7 [2019-10-22 11:25:35,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 11:25:35,539 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:25:35,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:25:35,550 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:25:35,558 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:25:35,591 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:25:35,594 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:25:35,597 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-22 11:25:35,603 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:25:35,604 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-10-22 11:25:35,604 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:97, output treesize:25 [2019-10-22 11:25:35,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 11:25:35,643 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1871094999] [2019-10-22 11:25:35,643 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:35,643 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2019-10-22 11:25:35,643 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192531919] [2019-10-22 11:25:35,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 11:25:35,644 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:25:35,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 11:25:35,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:25:35,644 INFO L87 Difference]: Start difference. First operand 43 states and 55 transitions. Second operand 7 states. [2019-10-22 11:25:36,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:36,188 INFO L93 Difference]: Finished difference Result 76 states and 94 transitions. [2019-10-22 11:25:36,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:25:36,189 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-10-22 11:25:36,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:36,189 INFO L225 Difference]: With dead ends: 76 [2019-10-22 11:25:36,189 INFO L226 Difference]: Without dead ends: 63 [2019-10-22 11:25:36,190 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:25:36,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-10-22 11:25:36,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 50. [2019-10-22 11:25:36,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-10-22 11:25:36,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 63 transitions. [2019-10-22 11:25:36,197 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 63 transitions. Word has length 18 [2019-10-22 11:25:36,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:36,197 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 63 transitions. [2019-10-22 11:25:36,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 11:25:36,197 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 63 transitions. [2019-10-22 11:25:36,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-22 11:25:36,198 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:36,198 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:36,398 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:25:36,399 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:36,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:36,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1413183039, now seen corresponding path program 2 times [2019-10-22 11:25:36,399 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:25:36,399 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2025539790] [2019-10-22 11:25:36,400 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c0830e47-82c5-4c3f-8842-b43b5d7b88c9/bin/utaipan/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:25:36,530 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-22 11:25:36,530 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 11:25:36,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 33 conjunts are in the unsatisfiable core [2019-10-22 11:25:36,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:25:36,538 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:25:36,538 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:25:36,542 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:25:36,542 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:25:36,542 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-22 11:25:36,565 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:25:36,565 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:25:36,575 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:25:36,575 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:25:36,575 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2019-10-22 11:25:36,666 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:25:36,667 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-22 11:25:36,667 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:25:36,876 WARN L191 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-10-22 11:25:36,877 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:25:36,879 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_43|], 2=[|v_#memory_int_40|, |v_#memory_int_42|, |v_#memory_int_39|]} [2019-10-22 11:25:36,893 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:25:36,901 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2019-10-22 11:25:36,901 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:25:36,965 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:25:36,968 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:25:37,028 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:25:37,033 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:25:37,037 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 22 [2019-10-22 11:25:37,038 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-22 11:25:37,057 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:25:37,060 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:25:37,061 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2019-10-22 11:25:37,062 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-22 11:25:37,078 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:25:37,079 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:25:37,079 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:106, output treesize:49 [2019-10-22 11:25:37,146 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_39|], 2=[|v_#memory_$Pointer$.base_44|], 4=[|v_#memory_int_43|]} [2019-10-22 11:25:37,153 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 7 treesize of output 3 [2019-10-22 11:25:37,153 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:25:37,195 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:25:37,212 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:25:37,212 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 37 [2019-10-22 11:25:37,213 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:25:37,260 INFO L567 ElimStorePlain]: treesize reduction 12, result has 77.4 percent of original size [2019-10-22 11:25:37,265 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2019-10-22 11:25:37,265 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-22 11:25:37,283 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:25:37,283 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:25:37,284 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:74, output treesize:24 [2019-10-22 11:25:37,327 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_40|, |v_#memory_$Pointer$.base_45|], 6=[|v_#memory_int_44|]} [2019-10-22 11:25:37,336 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-22 11:25:37,336 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:25:37,362 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:25:37,367 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-22 11:25:37,367 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:25:37,386 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:25:37,404 INFO L341 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2019-10-22 11:25:37,404 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 29 [2019-10-22 11:25:37,405 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-22 11:25:37,426 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:25:37,427 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:25:37,427 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:58, output treesize:29 [2019-10-22 11:25:37,487 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.base|, |#memory_$Pointer$.offset|], 2=[|#memory_int|]} [2019-10-22 11:25:37,497 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 39 treesize of output 27 [2019-10-22 11:25:37,497 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:25:37,511 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:25:37,514 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-10-22 11:25:37,515 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:25:37,523 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:25:37,526 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-10-22 11:25:37,526 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-22 11:25:37,531 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:25:37,532 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:25:37,532 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:46, output treesize:5 [2019-10-22 11:25:37,558 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:37,558 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:25:37,670 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:25:37,674 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:25:37,675 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:25:37,675 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:17 [2019-10-22 11:25:37,743 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.offset|], 3=[|v_#memory_int_46|]} [2019-10-22 11:25:37,750 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 29 treesize of output 25 [2019-10-22 11:25:37,750 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:25:37,784 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:25:37,786 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:25:37,792 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:25:37,793 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-22 11:25:37,793 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:43 [2019-10-22 11:25:37,965 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.base|], 2=[|v_#memory_int_40|, |v_#memory_$Pointer$.base_48|], 5=[|v_#memory_int_39|]} [2019-10-22 11:25:38,008 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-22 11:25:38,147 INFO L341 Elim1Store]: treesize reduction 49, result has 43.7 percent of original size [2019-10-22 11:25:38,147 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 38 [2019-10-22 11:25:38,148 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:25:38,360 WARN L191 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-10-22 11:25:38,360 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:25:38,378 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:25:38,623 WARN L191 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-10-22 11:25:38,624 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:25:38,675 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:25:38,675 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 121 treesize of output 150 [2019-10-22 11:25:38,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:25:38,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:25:38,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:25:38,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:25:38,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:25:38,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:25:38,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:25:38,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:25:38,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:25:38,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:25:38,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:25:38,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:25:38,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:25:38,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:25:38,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:25:38,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:25:38,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:25:38,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:25:38,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:25:38,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:25:38,692 INFO L496 ElimStorePlain]: Start of recursive call 4: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-10-22 11:25:39,765 WARN L191 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 106 DAG size of output: 106 [2019-10-22 11:25:39,765 INFO L567 ElimStorePlain]: treesize reduction 9, result has 97.8 percent of original size [2019-10-22 11:25:39,966 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:25:39,967 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: expected NNF at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:236) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive$TermWalker.walk(NonRecursive.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:195) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder.(ArrayOccurrenceAnalysis.java:181) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.(ArrayOccurrenceAnalysis.java:74) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:275) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:335) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.checkFeasibility(TraceAbstractionRefinementEngine.java:244) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-10-22 11:25:39,971 INFO L168 Benchmark]: Toolchain (without parser) took 20916.63 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 223.9 MB). Free memory was 942.9 MB in the beginning and 868.1 MB in the end (delta: 74.9 MB). Peak memory consumption was 298.8 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:39,971 INFO L168 Benchmark]: CDTParser took 0.18 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:25:39,971 INFO L168 Benchmark]: CACSL2BoogieTranslator took 507.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 942.9 MB in the beginning and 1.1 GB in the end (delta: -193.2 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:39,972 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.14 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:25:39,973 INFO L168 Benchmark]: Boogie Preprocessor took 35.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:39,973 INFO L168 Benchmark]: RCFGBuilder took 443.89 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: 32.0 MB). Peak memory consumption was 32.0 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:39,974 INFO L168 Benchmark]: TraceAbstraction took 19877.86 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 69.2 MB). Free memory was 1.1 GB in the beginning and 868.1 MB in the end (delta: 229.4 MB). Peak memory consumption was 298.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:39,975 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 972.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 507.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 942.9 MB in the beginning and 1.1 GB in the end (delta: -193.2 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 49.14 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 35.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 443.89 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: 32.0 MB). Peak memory consumption was 32.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 19877.86 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 69.2 MB). Free memory was 1.1 GB in the beginning and 868.1 MB in the end (delta: 229.4 MB). Peak memory consumption was 298.6 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...