./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/product-lines/minepump_spec2_product41.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_c3c341bd-0dca-4764-95f1-b8d544d698d1/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c3c341bd-0dca-4764-95f1-b8d544d698d1/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c3c341bd-0dca-4764-95f1-b8d544d698d1/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c3c341bd-0dca-4764-95f1-b8d544d698d1/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/product-lines/minepump_spec2_product41.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_c3c341bd-0dca-4764-95f1-b8d544d698d1/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c3c341bd-0dca-4764-95f1-b8d544d698d1/bin/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fa3516ef35b9a868c2359cecbd34fc3153ca14ae ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-678e011 [2019-11-20 10:30:46,431 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 10:30:46,433 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 10:30:46,450 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 10:30:46,451 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 10:30:46,452 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 10:30:46,454 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 10:30:46,464 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 10:30:46,470 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 10:30:46,473 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 10:30:46,474 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 10:30:46,475 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 10:30:46,476 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 10:30:46,477 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 10:30:46,478 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 10:30:46,479 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 10:30:46,480 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 10:30:46,481 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 10:30:46,483 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 10:30:46,485 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 10:30:46,487 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 10:30:46,488 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 10:30:46,489 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 10:30:46,490 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 10:30:46,493 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 10:30:46,493 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 10:30:46,493 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 10:30:46,494 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 10:30:46,495 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 10:30:46,496 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 10:30:46,496 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 10:30:46,497 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 10:30:46,498 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 10:30:46,498 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 10:30:46,499 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 10:30:46,500 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 10:30:46,500 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 10:30:46,501 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 10:30:46,501 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 10:30:46,502 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 10:30:46,502 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 10:30:46,503 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c3c341bd-0dca-4764-95f1-b8d544d698d1/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 10:30:46,533 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 10:30:46,534 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 10:30:46,535 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 10:30:46,535 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 10:30:46,535 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 10:30:46,535 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 10:30:46,536 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 10:30:46,536 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 10:30:46,536 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 10:30:46,536 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 10:30:46,536 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 10:30:46,537 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 10:30:46,537 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 10:30:46,537 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 10:30:46,537 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 10:30:46,537 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 10:30:46,538 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 10:30:46,538 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 10:30:46,538 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 10:30:46,538 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 10:30:46,539 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 10:30:46,539 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 10:30:46,539 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 10:30:46,539 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 10:30:46,540 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 10:30:46,540 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 10:30:46,540 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 10:30:46,540 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 10:30:46,540 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/run_dir_c3c341bd-0dca-4764-95f1-b8d544d698d1/bin/uautomizer 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 -> Automizer 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 -> fa3516ef35b9a868c2359cecbd34fc3153ca14ae [2019-11-20 10:30:46,748 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 10:30:46,758 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 10:30:46,762 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 10:30:46,764 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 10:30:46,764 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 10:30:46,765 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c3c341bd-0dca-4764-95f1-b8d544d698d1/bin/uautomizer/../../sv-benchmarks/c/product-lines/minepump_spec2_product41.cil.c [2019-11-20 10:30:46,846 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c3c341bd-0dca-4764-95f1-b8d544d698d1/bin/uautomizer/data/f0ef506f1/e78f10d32fba4d55b0f5b609206391b2/FLAG2319aa60d [2019-11-20 10:30:47,354 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 10:30:47,355 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c3c341bd-0dca-4764-95f1-b8d544d698d1/sv-benchmarks/c/product-lines/minepump_spec2_product41.cil.c [2019-11-20 10:30:47,369 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c3c341bd-0dca-4764-95f1-b8d544d698d1/bin/uautomizer/data/f0ef506f1/e78f10d32fba4d55b0f5b609206391b2/FLAG2319aa60d [2019-11-20 10:30:47,644 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c3c341bd-0dca-4764-95f1-b8d544d698d1/bin/uautomizer/data/f0ef506f1/e78f10d32fba4d55b0f5b609206391b2 [2019-11-20 10:30:47,651 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 10:30:47,652 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 10:30:47,653 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 10:30:47,654 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 10:30:47,657 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 10:30:47,658 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:30:47" (1/1) ... [2019-11-20 10:30:47,661 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d6d70f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:47, skipping insertion in model container [2019-11-20 10:30:47,662 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:30:47" (1/1) ... [2019-11-20 10:30:47,670 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 10:30:47,733 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 10:30:48,166 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 10:30:48,196 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 10:30:48,284 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 10:30:48,326 INFO L192 MainTranslator]: Completed translation [2019-11-20 10:30:48,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:48 WrapperNode [2019-11-20 10:30:48,327 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 10:30:48,327 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 10:30:48,327 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 10:30:48,328 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 10:30:48,335 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:48" (1/1) ... [2019-11-20 10:30:48,354 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:48" (1/1) ... [2019-11-20 10:30:48,401 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 10:30:48,401 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 10:30:48,401 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 10:30:48,402 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 10:30:48,410 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:48" (1/1) ... [2019-11-20 10:30:48,410 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:48" (1/1) ... [2019-11-20 10:30:48,415 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:48" (1/1) ... [2019-11-20 10:30:48,415 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:48" (1/1) ... [2019-11-20 10:30:48,426 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:48" (1/1) ... [2019-11-20 10:30:48,434 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:48" (1/1) ... [2019-11-20 10:30:48,437 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:48" (1/1) ... [2019-11-20 10:30:48,442 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 10:30:48,442 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 10:30:48,443 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 10:30:48,443 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 10:30:48,444 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c3c341bd-0dca-4764-95f1-b8d544d698d1/bin/uautomizer/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-11-20 10:30:48,515 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 10:30:48,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-20 10:30:48,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 10:30:48,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 10:30:49,381 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 10:30:49,382 INFO L285 CfgBuilder]: Removed 116 assume(true) statements. [2019-11-20 10:30:49,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:30:49 BoogieIcfgContainer [2019-11-20 10:30:49,383 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 10:30:49,384 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 10:30:49,385 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 10:30:49,390 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 10:30:49,391 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 10:30:47" (1/3) ... [2019-11-20 10:30:49,392 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bf96e05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:30:49, skipping insertion in model container [2019-11-20 10:30:49,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:30:48" (2/3) ... [2019-11-20 10:30:49,393 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bf96e05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:30:49, skipping insertion in model container [2019-11-20 10:30:49,393 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:30:49" (3/3) ... [2019-11-20 10:30:49,400 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec2_product41.cil.c [2019-11-20 10:30:49,410 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 10:30:49,420 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-20 10:30:49,432 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-20 10:30:49,469 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 10:30:49,470 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 10:30:49,470 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 10:30:49,470 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 10:30:49,470 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 10:30:49,471 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 10:30:49,471 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 10:30:49,471 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 10:30:49,493 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states. [2019-11-20 10:30:49,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 10:30:49,500 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:30:49,501 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:30:49,502 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:30:49,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:30:49,509 INFO L82 PathProgramCache]: Analyzing trace with hash -466361678, now seen corresponding path program 1 times [2019-11-20 10:30:49,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:30:49,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30757745] [2019-11-20 10:30:49,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:30:49,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:30:49,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:30:49,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30757745] [2019-11-20 10:30:49,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:30:49,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 10:30:49,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345760828] [2019-11-20 10:30:49,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-20 10:30:49,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:30:49,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-20 10:30:49,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 10:30:49,792 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 2 states. [2019-11-20 10:30:49,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:30:49,821 INFO L93 Difference]: Finished difference Result 175 states and 264 transitions. [2019-11-20 10:30:49,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-20 10:30:49,823 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2019-11-20 10:30:49,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:30:49,835 INFO L225 Difference]: With dead ends: 175 [2019-11-20 10:30:49,835 INFO L226 Difference]: Without dead ends: 87 [2019-11-20 10:30:49,839 INFO L630 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-11-20 10:30:49,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-11-20 10:30:49,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-11-20 10:30:49,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-11-20 10:30:49,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 124 transitions. [2019-11-20 10:30:49,890 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 124 transitions. Word has length 18 [2019-11-20 10:30:49,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:30:49,890 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 124 transitions. [2019-11-20 10:30:49,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-20 10:30:49,891 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 124 transitions. [2019-11-20 10:30:49,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-20 10:30:49,892 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:30:49,892 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:30:49,893 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:30:49,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:30:49,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1078824867, now seen corresponding path program 1 times [2019-11-20 10:30:49,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:30:49,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105233608] [2019-11-20 10:30:49,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:30:49,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:30:50,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:30:50,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105233608] [2019-11-20 10:30:50,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:30:50,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 10:30:50,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94155920] [2019-11-20 10:30:50,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:30:50,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:30:50,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:30:50,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:30:50,067 INFO L87 Difference]: Start difference. First operand 87 states and 124 transitions. Second operand 3 states. [2019-11-20 10:30:50,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:30:50,089 INFO L93 Difference]: Finished difference Result 87 states and 124 transitions. [2019-11-20 10:30:50,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:30:50,094 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-20 10:30:50,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:30:50,096 INFO L225 Difference]: With dead ends: 87 [2019-11-20 10:30:50,096 INFO L226 Difference]: Without dead ends: 39 [2019-11-20 10:30:50,097 INFO L630 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-11-20 10:30:50,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-11-20 10:30:50,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-11-20 10:30:50,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-20 10:30:50,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 55 transitions. [2019-11-20 10:30:50,106 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 55 transitions. Word has length 19 [2019-11-20 10:30:50,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:30:50,106 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 55 transitions. [2019-11-20 10:30:50,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:30:50,106 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 55 transitions. [2019-11-20 10:30:50,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-20 10:30:50,107 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:30:50,107 INFO L410 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-11-20 10:30:50,108 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:30:50,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:30:50,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1959799754, now seen corresponding path program 1 times [2019-11-20 10:30:50,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:30:50,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036677809] [2019-11-20 10:30:50,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:30:50,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:30:50,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:30:50,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036677809] [2019-11-20 10:30:50,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:30:50,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 10:30:50,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517734844] [2019-11-20 10:30:50,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 10:30:50,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:30:50,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 10:30:50,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:30:50,297 INFO L87 Difference]: Start difference. First operand 39 states and 55 transitions. Second operand 6 states. [2019-11-20 10:30:50,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:30:50,430 INFO L93 Difference]: Finished difference Result 71 states and 103 transitions. [2019-11-20 10:30:50,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 10:30:50,434 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-11-20 10:30:50,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:30:50,435 INFO L225 Difference]: With dead ends: 71 [2019-11-20 10:30:50,436 INFO L226 Difference]: Without dead ends: 39 [2019-11-20 10:30:50,437 INFO L630 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-11-20 10:30:50,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-11-20 10:30:50,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-11-20 10:30:50,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-20 10:30:50,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 54 transitions. [2019-11-20 10:30:50,451 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 54 transitions. Word has length 24 [2019-11-20 10:30:50,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:30:50,452 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 54 transitions. [2019-11-20 10:30:50,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 10:30:50,457 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2019-11-20 10:30:50,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-20 10:30:50,461 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:30:50,462 INFO L410 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-11-20 10:30:50,462 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:30:50,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:30:50,462 INFO L82 PathProgramCache]: Analyzing trace with hash -2070782503, now seen corresponding path program 1 times [2019-11-20 10:30:50,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:30:50,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384678303] [2019-11-20 10:30:50,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:30:50,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:30:50,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:30:50,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384678303] [2019-11-20 10:30:50,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:30:50,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 10:30:50,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144531243] [2019-11-20 10:30:50,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:30:50,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:30:50,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:30:50,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:30:50,575 INFO L87 Difference]: Start difference. First operand 39 states and 54 transitions. Second operand 3 states. [2019-11-20 10:30:50,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:30:50,610 INFO L93 Difference]: Finished difference Result 93 states and 133 transitions. [2019-11-20 10:30:50,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:30:50,611 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-20 10:30:50,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:30:50,612 INFO L225 Difference]: With dead ends: 93 [2019-11-20 10:30:50,612 INFO L226 Difference]: Without dead ends: 61 [2019-11-20 10:30:50,613 INFO L630 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-11-20 10:30:50,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-20 10:30:50,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2019-11-20 10:30:50,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-20 10:30:50,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 83 transitions. [2019-11-20 10:30:50,624 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 83 transitions. Word has length 25 [2019-11-20 10:30:50,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:30:50,624 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 83 transitions. [2019-11-20 10:30:50,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:30:50,625 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 83 transitions. [2019-11-20 10:30:50,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-20 10:30:50,626 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:30:50,626 INFO L410 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-11-20 10:30:50,627 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:30:50,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:30:50,627 INFO L82 PathProgramCache]: Analyzing trace with hash -576163675, now seen corresponding path program 1 times [2019-11-20 10:30:50,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:30:50,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972011324] [2019-11-20 10:30:50,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:30:50,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:30:50,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:30:50,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972011324] [2019-11-20 10:30:50,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:30:50,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:30:50,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598711127] [2019-11-20 10:30:50,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 10:30:50,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:30:50,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 10:30:50,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:30:50,748 INFO L87 Difference]: Start difference. First operand 59 states and 83 transitions. Second operand 5 states. [2019-11-20 10:30:50,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:30:50,917 INFO L93 Difference]: Finished difference Result 271 states and 394 transitions. [2019-11-20 10:30:50,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 10:30:50,918 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-11-20 10:30:50,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:30:50,921 INFO L225 Difference]: With dead ends: 271 [2019-11-20 10:30:50,921 INFO L226 Difference]: Without dead ends: 219 [2019-11-20 10:30:50,922 INFO L630 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-11-20 10:30:50,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-11-20 10:30:50,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 103. [2019-11-20 10:30:50,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-11-20 10:30:50,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 144 transitions. [2019-11-20 10:30:50,948 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 144 transitions. Word has length 31 [2019-11-20 10:30:50,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:30:50,948 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 144 transitions. [2019-11-20 10:30:50,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 10:30:50,953 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 144 transitions. [2019-11-20 10:30:50,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-20 10:30:50,956 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:30:50,956 INFO L410 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-11-20 10:30:50,957 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:30:50,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:30:50,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1086399261, now seen corresponding path program 1 times [2019-11-20 10:30:50,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:30:50,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669848544] [2019-11-20 10:30:50,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:30:50,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:30:51,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:30:51,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669848544] [2019-11-20 10:30:51,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:30:51,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:30:51,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420838476] [2019-11-20 10:30:51,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 10:30:51,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:30:51,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 10:30:51,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:30:51,071 INFO L87 Difference]: Start difference. First operand 103 states and 144 transitions. Second operand 5 states. [2019-11-20 10:30:51,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:30:51,217 INFO L93 Difference]: Finished difference Result 376 states and 533 transitions. [2019-11-20 10:30:51,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 10:30:51,218 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-11-20 10:30:51,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:30:51,221 INFO L225 Difference]: With dead ends: 376 [2019-11-20 10:30:51,221 INFO L226 Difference]: Without dead ends: 280 [2019-11-20 10:30:51,223 INFO L630 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-11-20 10:30:51,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-11-20 10:30:51,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 102. [2019-11-20 10:30:51,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-20 10:30:51,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 141 transitions. [2019-11-20 10:30:51,244 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 141 transitions. Word has length 32 [2019-11-20 10:30:51,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:30:51,245 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 141 transitions. [2019-11-20 10:30:51,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 10:30:51,246 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 141 transitions. [2019-11-20 10:30:51,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-20 10:30:51,247 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:30:51,248 INFO L410 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, 1, 1, 1] [2019-11-20 10:30:51,248 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:30:51,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:30:51,249 INFO L82 PathProgramCache]: Analyzing trace with hash 477559900, now seen corresponding path program 1 times [2019-11-20 10:30:51,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:30:51,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601709684] [2019-11-20 10:30:51,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:30:51,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:30:51,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:30:51,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601709684] [2019-11-20 10:30:51,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:30:51,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 10:30:51,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124385507] [2019-11-20 10:30:51,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 10:30:51,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:30:51,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 10:30:51,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:30:51,334 INFO L87 Difference]: Start difference. First operand 102 states and 141 transitions. Second operand 5 states. [2019-11-20 10:30:51,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:30:51,403 INFO L93 Difference]: Finished difference Result 273 states and 377 transitions. [2019-11-20 10:30:51,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 10:30:51,404 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-11-20 10:30:51,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:30:51,406 INFO L225 Difference]: With dead ends: 273 [2019-11-20 10:30:51,406 INFO L226 Difference]: Without dead ends: 178 [2019-11-20 10:30:51,407 INFO L630 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-11-20 10:30:51,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-11-20 10:30:51,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 108. [2019-11-20 10:30:51,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-20 10:30:51,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 147 transitions. [2019-11-20 10:30:51,427 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 147 transitions. Word has length 35 [2019-11-20 10:30:51,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:30:51,427 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 147 transitions. [2019-11-20 10:30:51,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 10:30:51,428 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 147 transitions. [2019-11-20 10:30:51,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-20 10:30:51,429 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:30:51,430 INFO L410 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, 1, 1, 1] [2019-11-20 10:30:51,430 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:30:51,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:30:51,430 INFO L82 PathProgramCache]: Analyzing trace with hash -533557350, now seen corresponding path program 1 times [2019-11-20 10:30:51,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:30:51,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088563741] [2019-11-20 10:30:51,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:30:51,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:30:51,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:30:51,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088563741] [2019-11-20 10:30:51,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:30:51,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-20 10:30:51,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055332263] [2019-11-20 10:30:51,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 10:30:51,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:30:51,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 10:30:51,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:30:51,504 INFO L87 Difference]: Start difference. First operand 108 states and 147 transitions. Second operand 6 states. [2019-11-20 10:30:51,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:30:51,618 INFO L93 Difference]: Finished difference Result 291 states and 395 transitions. [2019-11-20 10:30:51,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 10:30:51,618 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2019-11-20 10:30:51,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:30:51,620 INFO L225 Difference]: With dead ends: 291 [2019-11-20 10:30:51,620 INFO L226 Difference]: Without dead ends: 190 [2019-11-20 10:30:51,621 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-20 10:30:51,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-11-20 10:30:51,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 112. [2019-11-20 10:30:51,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-11-20 10:30:51,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 151 transitions. [2019-11-20 10:30:51,663 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 151 transitions. Word has length 35 [2019-11-20 10:30:51,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:30:51,663 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 151 transitions. [2019-11-20 10:30:51,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 10:30:51,664 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 151 transitions. [2019-11-20 10:30:51,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-20 10:30:51,665 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:30:51,666 INFO L410 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, 1, 1, 1] [2019-11-20 10:30:51,666 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:30:51,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:30:51,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1554625704, now seen corresponding path program 1 times [2019-11-20 10:30:51,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:30:51,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953680147] [2019-11-20 10:30:51,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:30:51,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:30:51,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:30:51,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953680147] [2019-11-20 10:30:51,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:30:51,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 10:30:51,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298283633] [2019-11-20 10:30:51,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:30:51,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:30:51,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:30:51,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:30:51,715 INFO L87 Difference]: Start difference. First operand 112 states and 151 transitions. Second operand 3 states. [2019-11-20 10:30:51,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:30:51,747 INFO L93 Difference]: Finished difference Result 265 states and 357 transitions. [2019-11-20 10:30:51,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:30:51,748 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-11-20 10:30:51,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:30:51,749 INFO L225 Difference]: With dead ends: 265 [2019-11-20 10:30:51,749 INFO L226 Difference]: Without dead ends: 160 [2019-11-20 10:30:51,750 INFO L630 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-11-20 10:30:51,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-20 10:30:51,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2019-11-20 10:30:51,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-11-20 10:30:51,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 209 transitions. [2019-11-20 10:30:51,769 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 209 transitions. Word has length 35 [2019-11-20 10:30:51,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:30:51,769 INFO L462 AbstractCegarLoop]: Abstraction has 160 states and 209 transitions. [2019-11-20 10:30:51,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:30:51,770 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 209 transitions. [2019-11-20 10:30:51,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-20 10:30:51,771 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:30:51,771 INFO L410 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, 1, 1, 1, 1] [2019-11-20 10:30:51,771 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:30:51,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:30:51,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1879284200, now seen corresponding path program 1 times [2019-11-20 10:30:51,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:30:51,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291511409] [2019-11-20 10:30:51,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:30:51,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:30:51,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-11-20 10:30:51,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291511409] [2019-11-20 10:30:51,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:30:51,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-20 10:30:51,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158882088] [2019-11-20 10:30:51,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 10:30:51,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:30:51,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 10:30:51,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:30:51,845 INFO L87 Difference]: Start difference. First operand 160 states and 209 transitions. Second operand 6 states. [2019-11-20 10:30:52,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:30:52,088 INFO L93 Difference]: Finished difference Result 485 states and 635 transitions. [2019-11-20 10:30:52,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 10:30:52,088 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2019-11-20 10:30:52,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:30:52,091 INFO L225 Difference]: With dead ends: 485 [2019-11-20 10:30:52,091 INFO L226 Difference]: Without dead ends: 332 [2019-11-20 10:30:52,092 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-11-20 10:30:52,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-11-20 10:30:52,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 160. [2019-11-20 10:30:52,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-11-20 10:30:52,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 205 transitions. [2019-11-20 10:30:52,117 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 205 transitions. Word has length 36 [2019-11-20 10:30:52,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:30:52,118 INFO L462 AbstractCegarLoop]: Abstraction has 160 states and 205 transitions. [2019-11-20 10:30:52,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 10:30:52,119 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 205 transitions. [2019-11-20 10:30:52,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-20 10:30:52,121 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:30:52,122 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2019-11-20 10:30:52,122 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:30:52,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:30:52,123 INFO L82 PathProgramCache]: Analyzing trace with hash 749013372, now seen corresponding path program 1 times [2019-11-20 10:30:52,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:30:52,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890589428] [2019-11-20 10:30:52,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:30:52,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:30:52,177 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:30:52,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890589428] [2019-11-20 10:30:52,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:30:52,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 10:30:52,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933100907] [2019-11-20 10:30:52,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:30:52,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:30:52,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:30:52,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:30:52,180 INFO L87 Difference]: Start difference. First operand 160 states and 205 transitions. Second operand 3 states. [2019-11-20 10:30:52,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:30:52,232 INFO L93 Difference]: Finished difference Result 233 states and 301 transitions. [2019-11-20 10:30:52,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:30:52,233 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-11-20 10:30:52,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:30:52,235 INFO L225 Difference]: With dead ends: 233 [2019-11-20 10:30:52,235 INFO L226 Difference]: Without dead ends: 231 [2019-11-20 10:30:52,235 INFO L630 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-11-20 10:30:52,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2019-11-20 10:30:52,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 180. [2019-11-20 10:30:52,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-11-20 10:30:52,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 235 transitions. [2019-11-20 10:30:52,262 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 235 transitions. Word has length 51 [2019-11-20 10:30:52,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:30:52,263 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 235 transitions. [2019-11-20 10:30:52,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:30:52,263 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 235 transitions. [2019-11-20 10:30:52,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-20 10:30:52,265 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:30:52,265 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-20 10:30:52,265 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:30:52,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:30:52,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1849817445, now seen corresponding path program 1 times [2019-11-20 10:30:52,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:30:52,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35515860] [2019-11-20 10:30:52,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:30:52,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:30:52,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:30:52,528 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 10:30:52,528 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-20 10:30:52,738 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 10:30:52 BoogieIcfgContainer [2019-11-20 10:30:52,739 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 10:30:52,739 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 10:30:52,740 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 10:30:52,740 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 10:30:52,741 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:30:49" (3/4) ... [2019-11-20 10:30:52,743 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-20 10:30:52,944 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_c3c341bd-0dca-4764-95f1-b8d544d698d1/bin/uautomizer/witness.graphml [2019-11-20 10:30:52,944 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 10:30:52,947 INFO L168 Benchmark]: Toolchain (without parser) took 5293.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 950.1 MB in the beginning and 941.6 MB in the end (delta: 8.5 MB). Peak memory consumption was 141.6 MB. Max. memory is 11.5 GB. [2019-11-20 10:30:52,947 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 10:30:52,947 INFO L168 Benchmark]: CACSL2BoogieTranslator took 673.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -165.5 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-11-20 10:30:52,948 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-20 10:30:52,948 INFO L168 Benchmark]: Boogie Preprocessor took 40.87 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-11-20 10:30:52,949 INFO L168 Benchmark]: RCFGBuilder took 941.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 65.3 MB). Peak memory consumption was 65.3 MB. Max. memory is 11.5 GB. [2019-11-20 10:30:52,949 INFO L168 Benchmark]: TraceAbstraction took 3354.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 969.4 MB in the end (delta: 75.6 MB). Peak memory consumption was 75.6 MB. Max. memory is 11.5 GB. [2019-11-20 10:30:52,949 INFO L168 Benchmark]: Witness Printer took 205.12 ms. Allocated memory is still 1.2 GB. Free memory was 969.4 MB in the beginning and 941.6 MB in the end (delta: 27.7 MB). Peak memory consumption was 27.7 MB. Max. memory is 11.5 GB. [2019-11-20 10:30:52,951 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 673.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -165.5 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 73.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.87 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 941.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 65.3 MB). Peak memory consumption was 65.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3354.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 969.4 MB in the end (delta: 75.6 MB). Peak memory consumption was 75.6 MB. Max. memory is 11.5 GB. * Witness Printer took 205.12 ms. Allocated memory is still 1.2 GB. Free memory was 969.4 MB in the beginning and 941.6 MB in the end (delta: 27.7 MB). Peak memory consumption was 27.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 830]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L43] int methAndRunningLastTime ; [L251] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L455] int pumpRunning = 0; [L456] int systemActive = 1; [L628] int waterLevel = 1; [L629] int methaneLevelCritical = 0; [L835] int cleanupTimeShifts = 4; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L909] int retValue_acc ; [L910] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L817] int retValue_acc ; [L820] retValue_acc = 1 [L821] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L916] tmp = valid_product() [L918] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L48] methAndRunningLastTime = 0 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L724] int splverifierCounter ; [L725] int tmp ; [L726] int tmp___0 ; [L727] int tmp___1 ; [L728] int tmp___2 ; [L731] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L733] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L735] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L741] tmp = __VERIFIER_nondet_int() [L743] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L646] COND TRUE waterLevel < 2 [L647] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L751] tmp___0 = __VERIFIER_nondet_int() [L753] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L761] tmp___2 = __VERIFIER_nondet_int() [L763] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L462] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L469] COND TRUE \read(systemActive) [L491] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L494] COND TRUE ! pumpRunning [L606] int retValue_acc ; [L607] int tmp ; [L608] int tmp___0 ; [L708] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L711] COND FALSE !(waterLevel < 2) [L715] retValue_acc = 0 [L716] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L612] tmp = isHighWaterSensorDry() [L614] COND FALSE !(\read(tmp)) [L617] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L619] retValue_acc = tmp___0 [L620] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L496] tmp = isHighWaterLevel() [L498] COND TRUE \read(tmp) [L525] int tmp ; [L550] int retValue_acc ; [L667] int retValue_acc ; [L670] retValue_acc = methaneLevelCritical [L671] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L554] retValue_acc = isMethaneLevelCritical() [L556] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L529] tmp = isMethaneAlarm() [L531] COND FALSE !(\read(tmp)) [L519] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L53] int tmp ; [L54] int tmp___0 ; [L667] int retValue_acc ; [L670] retValue_acc = methaneLevelCritical [L671] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L58] tmp = isMethaneLevelCritical() [L60] COND FALSE !(\read(tmp)) [L76] methAndRunningLastTime = 0 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L733] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L735] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L741] tmp = __VERIFIER_nondet_int() [L743] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L751] tmp___0 = __VERIFIER_nondet_int() [L753] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L658] COND FALSE !(\read(methaneLevelCritical)) [L661] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L761] tmp___2 = __VERIFIER_nondet_int() [L763] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L462] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L634] COND TRUE waterLevel > 0 [L635] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L469] COND TRUE \read(systemActive) [L491] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L494] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L53] int tmp ; [L54] int tmp___0 ; [L667] int retValue_acc ; [L670] retValue_acc = methaneLevelCritical [L671] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L58] tmp = isMethaneLevelCritical() [L60] COND TRUE \read(tmp) [L561] int retValue_acc ; [L564] retValue_acc = pumpRunning [L565] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L62] tmp___0 = isPumpRunning() [L64] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L65] COND FALSE !(\read(methAndRunningLastTime)) [L70] methAndRunningLastTime = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L733] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L735] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L741] tmp = __VERIFIER_nondet_int() [L743] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L751] tmp___0 = __VERIFIER_nondet_int() [L753] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L761] tmp___2 = __VERIFIER_nondet_int() [L763] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L462] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L634] COND TRUE waterLevel > 0 [L635] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L469] COND TRUE \read(systemActive) [L491] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L494] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L53] int tmp ; [L54] int tmp___0 ; [L667] int retValue_acc ; [L670] retValue_acc = methaneLevelCritical [L671] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L58] tmp = isMethaneLevelCritical() [L60] COND TRUE \read(tmp) [L561] int retValue_acc ; [L564] retValue_acc = pumpRunning [L565] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L62] tmp___0 = isPumpRunning() [L64] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L65] COND TRUE \read(methAndRunningLastTime) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L830] __VERIFIER_error() VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 91 locations, 3 error locations. Result: UNSAFE, OverallTime: 3.2s, OverallIterations: 12, TraceHistogramMax: 3, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 833 SDtfs, 1218 SDslu, 1300 SDs, 0 SdLazy, 182 SolverSat, 29 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=180occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 667 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 410 NumberOfCodeBlocks, 410 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 330 ConstructedInterpolants, 0 QuantifiedInterpolants, 20746 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 14/14 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...