./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/product-lines/minepump_spec2_product33.cil.c --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_f3fcb5a1-8a8e-417b-ac28-d7dcd389bf77/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f3fcb5a1-8a8e-417b-ac28-d7dcd389bf77/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f3fcb5a1-8a8e-417b-ac28-d7dcd389bf77/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f3fcb5a1-8a8e-417b-ac28-d7dcd389bf77/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/product-lines/minepump_spec2_product33.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_f3fcb5a1-8a8e-417b-ac28-d7dcd389bf77/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f3fcb5a1-8a8e-417b-ac28-d7dcd389bf77/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 7aed16b7a73618bd36d72dc3243e4d7bd764fb49 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 11:23:35,325 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:23:35,327 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:23:35,335 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:23:35,335 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:23:35,336 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:23:35,337 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:23:35,339 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:23:35,340 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:23:35,341 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:23:35,342 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:23:35,342 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:23:35,343 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:23:35,344 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:23:35,344 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:23:35,345 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:23:35,346 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:23:35,347 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:23:35,348 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:23:35,349 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:23:35,350 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:23:35,351 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:23:35,352 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:23:35,353 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:23:35,354 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:23:35,355 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:23:35,355 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:23:35,355 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:23:35,356 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:23:35,356 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:23:35,356 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:23:35,357 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:23:35,357 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:23:35,358 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:23:35,359 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:23:35,359 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:23:35,360 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:23:35,360 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:23:35,360 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:23:35,360 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:23:35,361 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:23:35,362 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f3fcb5a1-8a8e-417b-ac28-d7dcd389bf77/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-10-22 11:23:35,371 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:23:35,371 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:23:35,372 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:23:35,372 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:23:35,372 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:23:35,373 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:23:35,373 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:23:35,373 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:23:35,373 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:23:35,373 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:23:35,373 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:23:35,374 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:23:35,374 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:23:35,375 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:23:35,375 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:23:35,375 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:23:35,375 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:23:35,375 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:23:35,375 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:23:35,375 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:23:35,376 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:23:35,376 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:23:35,376 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:23:35,376 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:23:35,376 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:23:35,376 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:23:35,377 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:23:35,377 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:23:35,377 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:23:35,377 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:23:35,377 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:23:35,377 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:23:35,377 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:23:35,378 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:23:35,378 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:23:35,378 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_f3fcb5a1-8a8e-417b-ac28-d7dcd389bf77/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 -> 7aed16b7a73618bd36d72dc3243e4d7bd764fb49 [2019-10-22 11:23:35,402 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:23:35,411 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:23:35,414 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:23:35,415 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:23:35,415 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:23:35,416 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f3fcb5a1-8a8e-417b-ac28-d7dcd389bf77/bin/utaipan/../../sv-benchmarks/c/product-lines/minepump_spec2_product33.cil.c [2019-10-22 11:23:35,465 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f3fcb5a1-8a8e-417b-ac28-d7dcd389bf77/bin/utaipan/data/089839e39/7a94481d421543baa5eae869edcee3bf/FLAG28e331823 [2019-10-22 11:23:35,880 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:23:35,883 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f3fcb5a1-8a8e-417b-ac28-d7dcd389bf77/sv-benchmarks/c/product-lines/minepump_spec2_product33.cil.c [2019-10-22 11:23:35,893 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f3fcb5a1-8a8e-417b-ac28-d7dcd389bf77/bin/utaipan/data/089839e39/7a94481d421543baa5eae869edcee3bf/FLAG28e331823 [2019-10-22 11:23:36,214 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f3fcb5a1-8a8e-417b-ac28-d7dcd389bf77/bin/utaipan/data/089839e39/7a94481d421543baa5eae869edcee3bf [2019-10-22 11:23:36,216 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:23:36,217 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:23:36,218 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:23:36,218 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:23:36,222 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:23:36,223 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:23:36" (1/1) ... [2019-10-22 11:23:36,226 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63946837 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:36, skipping insertion in model container [2019-10-22 11:23:36,226 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:23:36" (1/1) ... [2019-10-22 11:23:36,233 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:23:36,277 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:23:36,630 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:23:36,644 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:23:36,781 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:23:36,822 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:23:36,823 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:36 WrapperNode [2019-10-22 11:23:36,823 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:23:36,824 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:23:36,824 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:23:36,824 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:23:36,832 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:36" (1/1) ... [2019-10-22 11:23:36,850 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:36" (1/1) ... [2019-10-22 11:23:36,891 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:23:36,892 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:23:36,892 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:23:36,892 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:23:36,910 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:36" (1/1) ... [2019-10-22 11:23:36,910 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:36" (1/1) ... [2019-10-22 11:23:36,913 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:36" (1/1) ... [2019-10-22 11:23:36,913 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:36" (1/1) ... [2019-10-22 11:23:36,920 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:36" (1/1) ... [2019-10-22 11:23:36,928 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:36" (1/1) ... [2019-10-22 11:23:36,930 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:36" (1/1) ... [2019-10-22 11:23:36,940 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:23:36,943 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:23:36,943 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:23:36,943 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:23:36,944 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f3fcb5a1-8a8e-417b-ac28-d7dcd389bf77/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:23:36,997 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 11:23:36,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-22 11:23:36,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:23:36,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:23:37,651 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:23:37,651 INFO L284 CfgBuilder]: Removed 98 assume(true) statements. [2019-10-22 11:23:37,652 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:23:37 BoogieIcfgContainer [2019-10-22 11:23:37,652 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:23:37,653 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:23:37,653 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:23:37,656 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:23:37,656 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:23:36" (1/3) ... [2019-10-22 11:23:37,657 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a6e72ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:23:37, skipping insertion in model container [2019-10-22 11:23:37,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:36" (2/3) ... [2019-10-22 11:23:37,657 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a6e72ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:23:37, skipping insertion in model container [2019-10-22 11:23:37,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:23:37" (3/3) ... [2019-10-22 11:23:37,659 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec2_product33.cil.c [2019-10-22 11:23:37,668 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:23:37,674 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-10-22 11:23:37,682 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-10-22 11:23:37,704 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:23:37,705 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:23:37,705 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:23:37,705 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:23:37,705 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:23:37,705 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:23:37,705 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:23:37,705 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:23:37,723 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2019-10-22 11:23:37,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-22 11:23:37,730 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:37,730 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:23:37,732 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:37,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:37,736 INFO L82 PathProgramCache]: Analyzing trace with hash -816697532, now seen corresponding path program 1 times [2019-10-22 11:23:37,742 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:37,743 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433628051] [2019-10-22 11:23:37,743 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:37,743 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:37,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:37,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:37,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:37,920 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433628051] [2019-10-22 11:23:37,921 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:37,921 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:23:37,921 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332737187] [2019-10-22 11:23:37,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-22 11:23:37,926 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:37,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 11:23:37,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 11:23:37,940 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 2 states. [2019-10-22 11:23:37,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:37,969 INFO L93 Difference]: Finished difference Result 157 states and 240 transitions. [2019-10-22 11:23:37,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 11:23:37,970 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2019-10-22 11:23:37,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:37,980 INFO L225 Difference]: With dead ends: 157 [2019-10-22 11:23:37,980 INFO L226 Difference]: Without dead ends: 78 [2019-10-22 11:23:37,983 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 11:23:37,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-10-22 11:23:38,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-10-22 11:23:38,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-10-22 11:23:38,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 112 transitions. [2019-10-22 11:23:38,017 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 112 transitions. Word has length 18 [2019-10-22 11:23:38,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:38,017 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 112 transitions. [2019-10-22 11:23:38,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-22 11:23:38,017 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 112 transitions. [2019-10-22 11:23:38,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-22 11:23:38,018 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:38,018 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:38,019 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:38,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:38,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1035533501, now seen corresponding path program 1 times [2019-10-22 11:23:38,019 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:38,019 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631451394] [2019-10-22 11:23:38,020 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:38,020 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:38,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:38,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:38,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:38,148 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631451394] [2019-10-22 11:23:38,148 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:38,148 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:23:38,149 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333220219] [2019-10-22 11:23:38,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:23:38,150 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:38,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:23:38,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:38,154 INFO L87 Difference]: Start difference. First operand 78 states and 112 transitions. Second operand 3 states. [2019-10-22 11:23:38,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:38,168 INFO L93 Difference]: Finished difference Result 78 states and 112 transitions. [2019-10-22 11:23:38,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:23:38,170 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-22 11:23:38,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:38,171 INFO L225 Difference]: With dead ends: 78 [2019-10-22 11:23:38,171 INFO L226 Difference]: Without dead ends: 36 [2019-10-22 11:23:38,172 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:38,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-10-22 11:23:38,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-10-22 11:23:38,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-22 11:23:38,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 51 transitions. [2019-10-22 11:23:38,177 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 51 transitions. Word has length 19 [2019-10-22 11:23:38,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:38,178 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 51 transitions. [2019-10-22 11:23:38,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:23:38,178 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 51 transitions. [2019-10-22 11:23:38,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-22 11:23:38,181 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:38,181 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:38,181 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:38,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:38,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1153900874, now seen corresponding path program 1 times [2019-10-22 11:23:38,182 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:38,182 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376140177] [2019-10-22 11:23:38,182 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:38,182 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:38,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:38,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:38,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:38,334 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376140177] [2019-10-22 11:23:38,334 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:38,335 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:23:38,335 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688231913] [2019-10-22 11:23:38,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:23:38,335 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:38,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:23:38,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:23:38,336 INFO L87 Difference]: Start difference. First operand 36 states and 51 transitions. Second operand 6 states. [2019-10-22 11:23:38,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:38,421 INFO L93 Difference]: Finished difference Result 65 states and 95 transitions. [2019-10-22 11:23:38,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:23:38,421 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-10-22 11:23:38,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:38,422 INFO L225 Difference]: With dead ends: 65 [2019-10-22 11:23:38,434 INFO L226 Difference]: Without dead ends: 36 [2019-10-22 11:23:38,435 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:23:38,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-10-22 11:23:38,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-10-22 11:23:38,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-22 11:23:38,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 50 transitions. [2019-10-22 11:23:38,439 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 50 transitions. Word has length 24 [2019-10-22 11:23:38,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:38,440 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 50 transitions. [2019-10-22 11:23:38,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:23:38,440 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 50 transitions. [2019-10-22 11:23:38,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-22 11:23:38,441 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:38,441 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:38,441 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:38,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:38,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1264883623, now seen corresponding path program 1 times [2019-10-22 11:23:38,441 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:38,442 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026049682] [2019-10-22 11:23:38,442 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:38,442 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:38,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:38,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:38,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:38,519 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026049682] [2019-10-22 11:23:38,519 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:38,519 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:23:38,519 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611955503] [2019-10-22 11:23:38,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:23:38,520 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:38,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:23:38,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:38,520 INFO L87 Difference]: Start difference. First operand 36 states and 50 transitions. Second operand 3 states. [2019-10-22 11:23:38,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:38,558 INFO L93 Difference]: Finished difference Result 87 states and 125 transitions. [2019-10-22 11:23:38,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:23:38,558 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-22 11:23:38,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:38,559 INFO L225 Difference]: With dead ends: 87 [2019-10-22 11:23:38,559 INFO L226 Difference]: Without dead ends: 58 [2019-10-22 11:23:38,560 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:38,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-10-22 11:23:38,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2019-10-22 11:23:38,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-10-22 11:23:38,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 79 transitions. [2019-10-22 11:23:38,573 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 79 transitions. Word has length 25 [2019-10-22 11:23:38,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:38,574 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 79 transitions. [2019-10-22 11:23:38,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:23:38,574 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 79 transitions. [2019-10-22 11:23:38,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-22 11:23:38,575 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:38,575 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:38,575 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:38,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:38,575 INFO L82 PathProgramCache]: Analyzing trace with hash -703728504, now seen corresponding path program 1 times [2019-10-22 11:23:38,576 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:38,576 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107917313] [2019-10-22 11:23:38,576 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:38,576 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:38,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:38,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:38,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:38,654 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107917313] [2019-10-22 11:23:38,654 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:38,654 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:23:38,654 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700269030] [2019-10-22 11:23:38,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:23:38,655 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:38,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:23:38,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:23:38,656 INFO L87 Difference]: Start difference. First operand 56 states and 79 transitions. Second operand 5 states. [2019-10-22 11:23:38,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:38,728 INFO L93 Difference]: Finished difference Result 145 states and 205 transitions. [2019-10-22 11:23:38,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:23:38,732 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-10-22 11:23:38,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:38,733 INFO L225 Difference]: With dead ends: 145 [2019-10-22 11:23:38,733 INFO L226 Difference]: Without dead ends: 96 [2019-10-22 11:23:38,733 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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:23:38,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-10-22 11:23:38,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 59. [2019-10-22 11:23:38,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-10-22 11:23:38,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 82 transitions. [2019-10-22 11:23:38,747 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 82 transitions. Word has length 31 [2019-10-22 11:23:38,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:38,747 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 82 transitions. [2019-10-22 11:23:38,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:23:38,747 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 82 transitions. [2019-10-22 11:23:38,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-22 11:23:38,748 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:38,748 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:38,748 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:38,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:38,748 INFO L82 PathProgramCache]: Analyzing trace with hash 229735205, now seen corresponding path program 1 times [2019-10-22 11:23:38,749 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:38,749 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448968799] [2019-10-22 11:23:38,749 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:38,749 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:38,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:38,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:38,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:38,841 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448968799] [2019-10-22 11:23:38,841 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:38,841 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:23:38,841 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244808265] [2019-10-22 11:23:38,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:23:38,842 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:38,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:23:38,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:23:38,845 INFO L87 Difference]: Start difference. First operand 59 states and 82 transitions. Second operand 5 states. [2019-10-22 11:23:38,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:38,953 INFO L93 Difference]: Finished difference Result 207 states and 293 transitions. [2019-10-22 11:23:38,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 11:23:38,953 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-10-22 11:23:38,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:38,955 INFO L225 Difference]: With dead ends: 207 [2019-10-22 11:23:38,955 INFO L226 Difference]: Without dead ends: 155 [2019-10-22 11:23:38,955 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:23:38,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-10-22 11:23:38,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 58. [2019-10-22 11:23:38,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-10-22 11:23:38,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 79 transitions. [2019-10-22 11:23:38,971 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 79 transitions. Word has length 31 [2019-10-22 11:23:38,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:38,972 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 79 transitions. [2019-10-22 11:23:38,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:23:38,972 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 79 transitions. [2019-10-22 11:23:38,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-22 11:23:38,973 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:38,973 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:38,973 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:38,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:38,973 INFO L82 PathProgramCache]: Analyzing trace with hash -2663926, now seen corresponding path program 1 times [2019-10-22 11:23:38,973 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:38,974 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679857447] [2019-10-22 11:23:38,974 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:38,974 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:38,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:38,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:39,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:39,044 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679857447] [2019-10-22 11:23:39,044 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:39,044 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:23:39,044 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334070869] [2019-10-22 11:23:39,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:23:39,045 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:39,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:23:39,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:23:39,046 INFO L87 Difference]: Start difference. First operand 58 states and 79 transitions. Second operand 4 states. [2019-10-22 11:23:39,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:39,084 INFO L93 Difference]: Finished difference Result 133 states and 183 transitions. [2019-10-22 11:23:39,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:23:39,085 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-10-22 11:23:39,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:39,085 INFO L225 Difference]: With dead ends: 133 [2019-10-22 11:23:39,085 INFO L226 Difference]: Without dead ends: 82 [2019-10-22 11:23:39,086 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:23:39,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-10-22 11:23:39,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 60. [2019-10-22 11:23:39,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-10-22 11:23:39,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 81 transitions. [2019-10-22 11:23:39,104 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 81 transitions. Word has length 31 [2019-10-22 11:23:39,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:39,104 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 81 transitions. [2019-10-22 11:23:39,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:23:39,105 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 81 transitions. [2019-10-22 11:23:39,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-22 11:23:39,105 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:39,105 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:39,106 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:39,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:39,106 INFO L82 PathProgramCache]: Analyzing trace with hash -589469940, now seen corresponding path program 1 times [2019-10-22 11:23:39,106 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:39,106 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711667146] [2019-10-22 11:23:39,106 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:39,107 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:39,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:39,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:39,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:39,145 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711667146] [2019-10-22 11:23:39,146 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:39,146 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:23:39,146 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032055016] [2019-10-22 11:23:39,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:23:39,147 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:39,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:23:39,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:39,147 INFO L87 Difference]: Start difference. First operand 60 states and 81 transitions. Second operand 3 states. [2019-10-22 11:23:39,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:39,166 INFO L93 Difference]: Finished difference Result 138 states and 188 transitions. [2019-10-22 11:23:39,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:23:39,166 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-22 11:23:39,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:39,167 INFO L225 Difference]: With dead ends: 138 [2019-10-22 11:23:39,167 INFO L226 Difference]: Without dead ends: 85 [2019-10-22 11:23:39,168 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:39,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-10-22 11:23:39,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-10-22 11:23:39,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-10-22 11:23:39,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 112 transitions. [2019-10-22 11:23:39,178 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 112 transitions. Word has length 31 [2019-10-22 11:23:39,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:39,178 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 112 transitions. [2019-10-22 11:23:39,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:23:39,178 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 112 transitions. [2019-10-22 11:23:39,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-22 11:23:39,183 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:39,183 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:39,185 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:39,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:39,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1606491700, now seen corresponding path program 1 times [2019-10-22 11:23:39,185 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:39,185 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449034101] [2019-10-22 11:23:39,185 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:39,186 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:39,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:39,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:39,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:39,229 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449034101] [2019-10-22 11:23:39,230 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:39,230 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:23:39,230 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790620525] [2019-10-22 11:23:39,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:23:39,231 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:39,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:23:39,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:39,231 INFO L87 Difference]: Start difference. First operand 85 states and 112 transitions. Second operand 3 states. [2019-10-22 11:23:39,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:39,263 INFO L93 Difference]: Finished difference Result 126 states and 168 transitions. [2019-10-22 11:23:39,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:23:39,264 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-22 11:23:39,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:39,265 INFO L225 Difference]: With dead ends: 126 [2019-10-22 11:23:39,265 INFO L226 Difference]: Without dead ends: 124 [2019-10-22 11:23:39,265 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:39,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-10-22 11:23:39,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 114. [2019-10-22 11:23:39,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-10-22 11:23:39,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 155 transitions. [2019-10-22 11:23:39,285 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 155 transitions. Word has length 32 [2019-10-22 11:23:39,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:39,286 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 155 transitions. [2019-10-22 11:23:39,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:23:39,286 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 155 transitions. [2019-10-22 11:23:39,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-22 11:23:39,287 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:39,288 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:39,288 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:39,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:39,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1682990208, now seen corresponding path program 1 times [2019-10-22 11:23:39,288 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:39,289 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859397487] [2019-10-22 11:23:39,289 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:39,289 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:39,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:39,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:39,373 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-22 11:23:39,374 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859397487] [2019-10-22 11:23:39,374 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:39,374 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:23:39,376 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994373283] [2019-10-22 11:23:39,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:23:39,376 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:39,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:23:39,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:23:39,377 INFO L87 Difference]: Start difference. First operand 114 states and 155 transitions. Second operand 5 states. [2019-10-22 11:23:39,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:39,462 INFO L93 Difference]: Finished difference Result 358 states and 492 transitions. [2019-10-22 11:23:39,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:23:39,463 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-10-22 11:23:39,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:39,464 INFO L225 Difference]: With dead ends: 358 [2019-10-22 11:23:39,464 INFO L226 Difference]: Without dead ends: 251 [2019-10-22 11:23:39,464 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:23:39,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-10-22 11:23:39,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 183. [2019-10-22 11:23:39,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-10-22 11:23:39,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 244 transitions. [2019-10-22 11:23:39,486 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 244 transitions. Word has length 50 [2019-10-22 11:23:39,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:39,487 INFO L462 AbstractCegarLoop]: Abstraction has 183 states and 244 transitions. [2019-10-22 11:23:39,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:23:39,487 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 244 transitions. [2019-10-22 11:23:39,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-22 11:23:39,488 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:39,488 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:39,488 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:39,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:39,489 INFO L82 PathProgramCache]: Analyzing trace with hash 967205496, now seen corresponding path program 1 times [2019-10-22 11:23:39,489 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:39,489 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979125175] [2019-10-22 11:23:39,489 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:39,489 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:39,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:39,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:23:39,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:23:39,978 INFO L168 tionRefinementEngine]: Strategy TAIPAN found a feasible trace [2019-10-22 11:23:39,978 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 11:23:40,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:23:40 BoogieIcfgContainer [2019-10-22 11:23:40,068 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:23:40,069 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:23:40,069 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:23:40,069 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:23:40,069 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:23:37" (3/4) ... [2019-10-22 11:23:40,072 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-10-22 11:23:40,186 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_f3fcb5a1-8a8e-417b-ac28-d7dcd389bf77/bin/utaipan/witness.graphml [2019-10-22 11:23:40,186 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:23:40,188 INFO L168 Benchmark]: Toolchain (without parser) took 3970.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 213.9 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -173.0 MB). Peak memory consumption was 41.0 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:40,189 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:23:40,189 INFO L168 Benchmark]: CACSL2BoogieTranslator took 605.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -181.5 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:40,190 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:40,191 INFO L168 Benchmark]: Boogie Preprocessor took 50.82 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:23:40,192 INFO L168 Benchmark]: RCFGBuilder took 709.56 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: 60.5 MB). Peak memory consumption was 60.5 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:40,192 INFO L168 Benchmark]: TraceAbstraction took 2415.33 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 72.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -84.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:23:40,192 INFO L168 Benchmark]: Witness Printer took 117.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:40,193 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 605.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -181.5 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 68.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 50.82 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 709.56 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: 60.5 MB). Peak memory consumption was 60.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2415.33 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 72.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -84.7 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 117.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 284]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L85] int waterLevel = 1; [L86] int methaneLevelCritical = 0; [L179] int cleanupTimeShifts = 4; [L292] int pumpRunning = 0; [L293] int systemActive = 1; [L679] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L876] int methAndRunningLastTime ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L257] int retValue_acc ; [L258] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L69] int retValue_acc ; [L72] retValue_acc = 1 [L73] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L264] tmp = valid_product() [L266] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L881] methAndRunningLastTime = 0 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L446] int splverifierCounter ; [L447] int tmp ; [L448] int tmp___0 ; [L449] int tmp___1 ; [L450] int tmp___2 ; [L453] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L455] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L457] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L463] tmp = __VERIFIER_nondet_int() [L465] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L103] COND TRUE waterLevel < 2 [L104] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L473] tmp___0 = __VERIFIER_nondet_int() [L475] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L115] COND FALSE !(\read(methaneLevelCritical)) [L118] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L483] tmp___2 = __VERIFIER_nondet_int() [L485] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L300] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L307] COND TRUE \read(systemActive) [L329] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L332] COND TRUE ! pumpRunning [L426] int retValue_acc ; [L427] int tmp ; [L428] int tmp___0 ; [L165] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L168] COND FALSE !(waterLevel < 2) [L172] retValue_acc = 0 [L173] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L432] tmp = isHighWaterSensorDry() [L434] COND FALSE !(\read(tmp)) [L437] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L439] retValue_acc = tmp___0 [L440] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L334] tmp = isHighWaterLevel() [L336] COND TRUE \read(tmp) [L357] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L886] int tmp ; [L887] int tmp___0 ; [L124] int retValue_acc ; [L127] retValue_acc = methaneLevelCritical [L128] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L891] tmp = isMethaneLevelCritical() [L893] COND TRUE \read(tmp) [L381] int retValue_acc ; [L384] retValue_acc = pumpRunning [L385] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L895] tmp___0 = isPumpRunning() [L897] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L898] COND FALSE !(\read(methAndRunningLastTime)) [L903] methAndRunningLastTime = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L455] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L457] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L463] tmp = __VERIFIER_nondet_int() [L465] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L473] tmp___0 = __VERIFIER_nondet_int() [L475] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L483] tmp___2 = __VERIFIER_nondet_int() [L485] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L300] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L91] COND TRUE waterLevel > 0 [L92] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L307] COND TRUE \read(systemActive) [L329] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L332] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L886] int tmp ; [L887] int tmp___0 ; [L124] int retValue_acc ; [L127] retValue_acc = methaneLevelCritical [L128] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L891] tmp = isMethaneLevelCritical() [L893] COND TRUE \read(tmp) [L381] int retValue_acc ; [L384] retValue_acc = pumpRunning [L385] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L895] tmp___0 = isPumpRunning() [L897] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L898] COND TRUE \read(methAndRunningLastTime) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L284] __VERIFIER_error() VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 82 locations, 3 error locations. Result: UNSAFE, OverallTime: 2.3s, OverallIterations: 11, TraceHistogramMax: 2, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 659 SDtfs, 686 SDslu, 743 SDs, 0 SdLazy, 102 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=183occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 236 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 343 NumberOfCodeBlocks, 343 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 282 ConstructedInterpolants, 0 QuantifiedInterpolants, 18228 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 17/17 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...