./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 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/minepump_spec2_product41.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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-30f4e4a [2019-11-28 00:21:02,427 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 00:21:02,429 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 00:21:02,447 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 00:21:02,448 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 00:21:02,450 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 00:21:02,452 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 00:21:02,461 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 00:21:02,466 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 00:21:02,471 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 00:21:02,472 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 00:21:02,473 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 00:21:02,474 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 00:21:02,476 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 00:21:02,477 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 00:21:02,479 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 00:21:02,480 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 00:21:02,481 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 00:21:02,484 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 00:21:02,487 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 00:21:02,492 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 00:21:02,496 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 00:21:02,497 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 00:21:02,499 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 00:21:02,503 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 00:21:02,503 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 00:21:02,503 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 00:21:02,505 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 00:21:02,506 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 00:21:02,507 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 00:21:02,507 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 00:21:02,507 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 00:21:02,508 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 00:21:02,509 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 00:21:02,511 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 00:21:02,511 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 00:21:02,512 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 00:21:02,512 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 00:21:02,512 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 00:21:02,513 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 00:21:02,515 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 00:21:02,515 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 00:21:02,541 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 00:21:02,541 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 00:21:02,543 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 00:21:02,543 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 00:21:02,543 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 00:21:02,544 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 00:21:02,544 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 00:21:02,544 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 00:21:02,544 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 00:21:02,545 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 00:21:02,545 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 00:21:02,545 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 00:21:02,546 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 00:21:02,546 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 00:21:02,546 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 00:21:02,546 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 00:21:02,547 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 00:21:02,547 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 00:21:02,547 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 00:21:02,548 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 00:21:02,548 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 00:21:02,548 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:21:02,549 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 00:21:02,549 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 00:21:02,549 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 00:21:02,550 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 00:21:02,550 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 00:21:02,550 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 00:21:02,550 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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-28 00:21:02,842 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 00:21:02,854 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 00:21:02,859 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 00:21:02,860 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 00:21:02,861 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 00:21:02,862 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec2_product41.cil.c [2019-11-28 00:21:02,946 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4187c33fd/b23e9599921f4d6ba0f63ede6af1354d/FLAGc40cef220 [2019-11-28 00:21:03,410 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 00:21:03,411 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product41.cil.c [2019-11-28 00:21:03,425 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4187c33fd/b23e9599921f4d6ba0f63ede6af1354d/FLAGc40cef220 [2019-11-28 00:21:03,768 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4187c33fd/b23e9599921f4d6ba0f63ede6af1354d [2019-11-28 00:21:03,771 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 00:21:03,773 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 00:21:03,774 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 00:21:03,774 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 00:21:03,778 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 00:21:03,779 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:21:03" (1/1) ... [2019-11-28 00:21:03,782 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ce65fc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:21:03, skipping insertion in model container [2019-11-28 00:21:03,782 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:21:03" (1/1) ... [2019-11-28 00:21:03,790 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 00:21:03,836 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 00:21:04,251 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:21:04,268 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 00:21:04,373 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:21:04,413 INFO L208 MainTranslator]: Completed translation [2019-11-28 00:21:04,414 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:21:04 WrapperNode [2019-11-28 00:21:04,414 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 00:21:04,415 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 00:21:04,415 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 00:21:04,415 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 00:21:04,421 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:21:04" (1/1) ... [2019-11-28 00:21:04,440 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:21:04" (1/1) ... [2019-11-28 00:21:04,488 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 00:21:04,488 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 00:21:04,488 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 00:21:04,489 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 00:21:04,499 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:21:04" (1/1) ... [2019-11-28 00:21:04,500 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:21:04" (1/1) ... [2019-11-28 00:21:04,505 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:21:04" (1/1) ... [2019-11-28 00:21:04,505 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:21:04" (1/1) ... [2019-11-28 00:21:04,516 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:21:04" (1/1) ... [2019-11-28 00:21:04,528 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:21:04" (1/1) ... [2019-11-28 00:21:04,534 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:21:04" (1/1) ... [2019-11-28 00:21:04,539 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 00:21:04,539 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 00:21:04,540 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 00:21:04,540 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 00:21:04,546 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:21:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-28 00:21:04,601 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 00:21:04,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-28 00:21:04,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 00:21:04,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 00:21:05,348 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 00:21:05,348 INFO L297 CfgBuilder]: Removed 116 assume(true) statements. [2019-11-28 00:21:05,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:21:05 BoogieIcfgContainer [2019-11-28 00:21:05,350 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 00:21:05,351 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 00:21:05,351 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 00:21:05,354 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 00:21:05,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:21:03" (1/3) ... [2019-11-28 00:21:05,355 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42c4000e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:21:05, skipping insertion in model container [2019-11-28 00:21:05,355 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:21:04" (2/3) ... [2019-11-28 00:21:05,356 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42c4000e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:21:05, skipping insertion in model container [2019-11-28 00:21:05,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:21:05" (3/3) ... [2019-11-28 00:21:05,357 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec2_product41.cil.c [2019-11-28 00:21:05,367 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 00:21:05,374 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-28 00:21:05,387 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-28 00:21:05,413 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 00:21:05,413 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 00:21:05,414 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 00:21:05,414 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 00:21:05,414 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 00:21:05,414 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 00:21:05,415 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 00:21:05,415 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 00:21:05,433 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states. [2019-11-28 00:21:05,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 00:21:05,440 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:21:05,441 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-28 00:21:05,442 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:21:05,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:21:05,447 INFO L82 PathProgramCache]: Analyzing trace with hash -466361678, now seen corresponding path program 1 times [2019-11-28 00:21:05,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:21:05,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857056336] [2019-11-28 00:21:05,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:21:05,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:21:05,762 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-28 00:21:05,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857056336] [2019-11-28 00:21:05,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:21:05,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:21:05,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420064313] [2019-11-28 00:21:05,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 00:21:05,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:21:05,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 00:21:05,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 00:21:05,784 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 2 states. [2019-11-28 00:21:05,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:21:05,823 INFO L93 Difference]: Finished difference Result 175 states and 264 transitions. [2019-11-28 00:21:05,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 00:21:05,824 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2019-11-28 00:21:05,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:21:05,841 INFO L225 Difference]: With dead ends: 175 [2019-11-28 00:21:05,843 INFO L226 Difference]: Without dead ends: 87 [2019-11-28 00:21:05,849 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-28 00:21:05,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-11-28 00:21:05,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-11-28 00:21:05,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-11-28 00:21:05,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 124 transitions. [2019-11-28 00:21:05,894 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 124 transitions. Word has length 18 [2019-11-28 00:21:05,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:21:05,894 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 124 transitions. [2019-11-28 00:21:05,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 00:21:05,895 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 124 transitions. [2019-11-28 00:21:05,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 00:21:05,896 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:21:05,896 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-28 00:21:05,896 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:21:05,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:21:05,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1078824867, now seen corresponding path program 1 times [2019-11-28 00:21:05,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:21:05,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78474075] [2019-11-28 00:21:05,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:21:05,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:21:05,993 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-28 00:21:05,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78474075] [2019-11-28 00:21:05,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:21:05,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:21:05,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85087470] [2019-11-28 00:21:05,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:21:05,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:21:05,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:21:05,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:21:05,996 INFO L87 Difference]: Start difference. First operand 87 states and 124 transitions. Second operand 3 states. [2019-11-28 00:21:06,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:21:06,009 INFO L93 Difference]: Finished difference Result 87 states and 124 transitions. [2019-11-28 00:21:06,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:21:06,010 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-28 00:21:06,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:21:06,011 INFO L225 Difference]: With dead ends: 87 [2019-11-28 00:21:06,011 INFO L226 Difference]: Without dead ends: 39 [2019-11-28 00:21:06,013 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-28 00:21:06,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-11-28 00:21:06,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-11-28 00:21:06,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-28 00:21:06,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 55 transitions. [2019-11-28 00:21:06,019 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 55 transitions. Word has length 19 [2019-11-28 00:21:06,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:21:06,020 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 55 transitions. [2019-11-28 00:21:06,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:21:06,020 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 55 transitions. [2019-11-28 00:21:06,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 00:21:06,021 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:21:06,021 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-28 00:21:06,022 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:21:06,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:21:06,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1959799754, now seen corresponding path program 1 times [2019-11-28 00:21:06,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:21:06,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628811005] [2019-11-28 00:21:06,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:21:06,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:21:06,194 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-28 00:21:06,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628811005] [2019-11-28 00:21:06,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:21:06,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:21:06,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227520086] [2019-11-28 00:21:06,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 00:21:06,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:21:06,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 00:21:06,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 00:21:06,200 INFO L87 Difference]: Start difference. First operand 39 states and 55 transitions. Second operand 6 states. [2019-11-28 00:21:06,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:21:06,335 INFO L93 Difference]: Finished difference Result 71 states and 103 transitions. [2019-11-28 00:21:06,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 00:21:06,337 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-11-28 00:21:06,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:21:06,341 INFO L225 Difference]: With dead ends: 71 [2019-11-28 00:21:06,341 INFO L226 Difference]: Without dead ends: 39 [2019-11-28 00:21:06,342 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-28 00:21:06,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-11-28 00:21:06,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-11-28 00:21:06,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-28 00:21:06,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 54 transitions. [2019-11-28 00:21:06,356 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 54 transitions. Word has length 24 [2019-11-28 00:21:06,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:21:06,357 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 54 transitions. [2019-11-28 00:21:06,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 00:21:06,358 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2019-11-28 00:21:06,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 00:21:06,360 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:21:06,360 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-28 00:21:06,361 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:21:06,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:21:06,362 INFO L82 PathProgramCache]: Analyzing trace with hash -2070782503, now seen corresponding path program 1 times [2019-11-28 00:21:06,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:21:06,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642542493] [2019-11-28 00:21:06,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:21:06,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:21:06,477 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-28 00:21:06,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642542493] [2019-11-28 00:21:06,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:21:06,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:21:06,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465863318] [2019-11-28 00:21:06,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:21:06,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:21:06,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:21:06,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:21:06,481 INFO L87 Difference]: Start difference. First operand 39 states and 54 transitions. Second operand 3 states. [2019-11-28 00:21:06,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:21:06,535 INFO L93 Difference]: Finished difference Result 93 states and 133 transitions. [2019-11-28 00:21:06,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:21:06,536 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-28 00:21:06,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:21:06,537 INFO L225 Difference]: With dead ends: 93 [2019-11-28 00:21:06,537 INFO L226 Difference]: Without dead ends: 61 [2019-11-28 00:21:06,538 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-28 00:21:06,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-28 00:21:06,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2019-11-28 00:21:06,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-28 00:21:06,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 83 transitions. [2019-11-28 00:21:06,547 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 83 transitions. Word has length 25 [2019-11-28 00:21:06,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:21:06,548 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 83 transitions. [2019-11-28 00:21:06,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:21:06,548 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 83 transitions. [2019-11-28 00:21:06,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 00:21:06,549 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:21:06,549 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-28 00:21:06,550 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:21:06,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:21:06,550 INFO L82 PathProgramCache]: Analyzing trace with hash -576163675, now seen corresponding path program 1 times [2019-11-28 00:21:06,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:21:06,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514970416] [2019-11-28 00:21:06,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:21:06,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:21:06,663 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-28 00:21:06,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514970416] [2019-11-28 00:21:06,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:21:06,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:21:06,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966802245] [2019-11-28 00:21:06,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:21:06,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:21:06,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:21:06,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:21:06,666 INFO L87 Difference]: Start difference. First operand 59 states and 83 transitions. Second operand 5 states. [2019-11-28 00:21:06,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:21:06,828 INFO L93 Difference]: Finished difference Result 271 states and 394 transitions. [2019-11-28 00:21:06,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 00:21:06,829 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-11-28 00:21:06,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:21:06,831 INFO L225 Difference]: With dead ends: 271 [2019-11-28 00:21:06,831 INFO L226 Difference]: Without dead ends: 219 [2019-11-28 00:21:06,832 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-28 00:21:06,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-11-28 00:21:06,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 103. [2019-11-28 00:21:06,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-11-28 00:21:06,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 144 transitions. [2019-11-28 00:21:06,867 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 144 transitions. Word has length 31 [2019-11-28 00:21:06,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:21:06,868 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 144 transitions. [2019-11-28 00:21:06,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:21:06,868 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 144 transitions. [2019-11-28 00:21:06,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 00:21:06,869 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:21:06,870 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-28 00:21:06,870 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:21:06,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:21:06,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1086399261, now seen corresponding path program 1 times [2019-11-28 00:21:06,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:21:06,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207907998] [2019-11-28 00:21:06,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:21:06,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:21:06,941 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-28 00:21:06,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207907998] [2019-11-28 00:21:06,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:21:06,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:21:06,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768130226] [2019-11-28 00:21:06,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:21:06,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:21:06,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:21:06,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:21:06,945 INFO L87 Difference]: Start difference. First operand 103 states and 144 transitions. Second operand 5 states. [2019-11-28 00:21:07,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:21:07,074 INFO L93 Difference]: Finished difference Result 376 states and 533 transitions. [2019-11-28 00:21:07,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 00:21:07,075 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-11-28 00:21:07,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:21:07,077 INFO L225 Difference]: With dead ends: 376 [2019-11-28 00:21:07,077 INFO L226 Difference]: Without dead ends: 280 [2019-11-28 00:21:07,078 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-28 00:21:07,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-11-28 00:21:07,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 102. [2019-11-28 00:21:07,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-28 00:21:07,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 141 transitions. [2019-11-28 00:21:07,095 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 141 transitions. Word has length 32 [2019-11-28 00:21:07,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:21:07,095 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 141 transitions. [2019-11-28 00:21:07,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:21:07,096 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 141 transitions. [2019-11-28 00:21:07,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-28 00:21:07,097 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:21:07,097 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-28 00:21:07,098 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:21:07,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:21:07,098 INFO L82 PathProgramCache]: Analyzing trace with hash 477559900, now seen corresponding path program 1 times [2019-11-28 00:21:07,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:21:07,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624445083] [2019-11-28 00:21:07,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:21:07,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:21:07,158 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-28 00:21:07,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624445083] [2019-11-28 00:21:07,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:21:07,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:21:07,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448575690] [2019-11-28 00:21:07,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:21:07,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:21:07,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:21:07,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:21:07,161 INFO L87 Difference]: Start difference. First operand 102 states and 141 transitions. Second operand 5 states. [2019-11-28 00:21:07,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:21:07,215 INFO L93 Difference]: Finished difference Result 273 states and 377 transitions. [2019-11-28 00:21:07,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:21:07,215 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-11-28 00:21:07,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:21:07,217 INFO L225 Difference]: With dead ends: 273 [2019-11-28 00:21:07,217 INFO L226 Difference]: Without dead ends: 178 [2019-11-28 00:21:07,218 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-28 00:21:07,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-11-28 00:21:07,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 108. [2019-11-28 00:21:07,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-28 00:21:07,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 147 transitions. [2019-11-28 00:21:07,233 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 147 transitions. Word has length 35 [2019-11-28 00:21:07,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:21:07,233 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 147 transitions. [2019-11-28 00:21:07,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:21:07,234 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 147 transitions. [2019-11-28 00:21:07,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-28 00:21:07,235 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:21:07,235 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-28 00:21:07,236 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:21:07,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:21:07,236 INFO L82 PathProgramCache]: Analyzing trace with hash -533557350, now seen corresponding path program 1 times [2019-11-28 00:21:07,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:21:07,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326822293] [2019-11-28 00:21:07,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:21:07,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:21:07,307 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-28 00:21:07,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326822293] [2019-11-28 00:21:07,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:21:07,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 00:21:07,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220489745] [2019-11-28 00:21:07,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 00:21:07,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:21:07,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 00:21:07,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 00:21:07,310 INFO L87 Difference]: Start difference. First operand 108 states and 147 transitions. Second operand 6 states. [2019-11-28 00:21:07,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:21:07,412 INFO L93 Difference]: Finished difference Result 291 states and 395 transitions. [2019-11-28 00:21:07,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 00:21:07,412 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2019-11-28 00:21:07,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:21:07,414 INFO L225 Difference]: With dead ends: 291 [2019-11-28 00:21:07,414 INFO L226 Difference]: Without dead ends: 190 [2019-11-28 00:21:07,415 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-28 00:21:07,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-11-28 00:21:07,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 112. [2019-11-28 00:21:07,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-11-28 00:21:07,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 151 transitions. [2019-11-28 00:21:07,427 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 151 transitions. Word has length 35 [2019-11-28 00:21:07,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:21:07,428 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 151 transitions. [2019-11-28 00:21:07,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 00:21:07,428 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 151 transitions. [2019-11-28 00:21:07,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-28 00:21:07,429 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:21:07,429 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-28 00:21:07,429 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:21:07,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:21:07,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1554625704, now seen corresponding path program 1 times [2019-11-28 00:21:07,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:21:07,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667184487] [2019-11-28 00:21:07,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:21:07,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:21:07,469 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-28 00:21:07,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667184487] [2019-11-28 00:21:07,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:21:07,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:21:07,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772781943] [2019-11-28 00:21:07,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:21:07,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:21:07,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:21:07,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:21:07,471 INFO L87 Difference]: Start difference. First operand 112 states and 151 transitions. Second operand 3 states. [2019-11-28 00:21:07,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:21:07,498 INFO L93 Difference]: Finished difference Result 265 states and 357 transitions. [2019-11-28 00:21:07,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:21:07,498 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-11-28 00:21:07,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:21:07,500 INFO L225 Difference]: With dead ends: 265 [2019-11-28 00:21:07,500 INFO L226 Difference]: Without dead ends: 160 [2019-11-28 00:21:07,501 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-28 00:21:07,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-28 00:21:07,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2019-11-28 00:21:07,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-11-28 00:21:07,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 209 transitions. [2019-11-28 00:21:07,520 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 209 transitions. Word has length 35 [2019-11-28 00:21:07,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:21:07,520 INFO L462 AbstractCegarLoop]: Abstraction has 160 states and 209 transitions. [2019-11-28 00:21:07,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:21:07,520 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 209 transitions. [2019-11-28 00:21:07,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-28 00:21:07,522 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:21:07,522 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-28 00:21:07,522 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:21:07,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:21:07,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1879284200, now seen corresponding path program 1 times [2019-11-28 00:21:07,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:21:07,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744371922] [2019-11-28 00:21:07,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:21:07,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:21:07,587 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-28 00:21:07,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744371922] [2019-11-28 00:21:07,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:21:07,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 00:21:07,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315382341] [2019-11-28 00:21:07,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 00:21:07,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:21:07,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 00:21:07,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 00:21:07,590 INFO L87 Difference]: Start difference. First operand 160 states and 209 transitions. Second operand 6 states. [2019-11-28 00:21:07,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:21:07,855 INFO L93 Difference]: Finished difference Result 485 states and 635 transitions. [2019-11-28 00:21:07,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 00:21:07,855 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2019-11-28 00:21:07,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:21:07,857 INFO L225 Difference]: With dead ends: 485 [2019-11-28 00:21:07,858 INFO L226 Difference]: Without dead ends: 332 [2019-11-28 00:21:07,858 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-11-28 00:21:07,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-11-28 00:21:07,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 160. [2019-11-28 00:21:07,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-11-28 00:21:07,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 205 transitions. [2019-11-28 00:21:07,877 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 205 transitions. Word has length 36 [2019-11-28 00:21:07,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:21:07,877 INFO L462 AbstractCegarLoop]: Abstraction has 160 states and 205 transitions. [2019-11-28 00:21:07,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 00:21:07,878 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 205 transitions. [2019-11-28 00:21:07,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-28 00:21:07,878 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:21:07,878 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-28 00:21:07,879 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:21:07,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:21:07,879 INFO L82 PathProgramCache]: Analyzing trace with hash 749013372, now seen corresponding path program 1 times [2019-11-28 00:21:07,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:21:07,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219973597] [2019-11-28 00:21:07,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:21:07,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:21:07,930 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-28 00:21:07,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219973597] [2019-11-28 00:21:07,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:21:07,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:21:07,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832968267] [2019-11-28 00:21:07,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:21:07,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:21:07,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:21:07,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:21:07,932 INFO L87 Difference]: Start difference. First operand 160 states and 205 transitions. Second operand 3 states. [2019-11-28 00:21:07,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:21:07,977 INFO L93 Difference]: Finished difference Result 233 states and 301 transitions. [2019-11-28 00:21:07,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:21:07,978 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-11-28 00:21:07,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:21:07,980 INFO L225 Difference]: With dead ends: 233 [2019-11-28 00:21:07,980 INFO L226 Difference]: Without dead ends: 231 [2019-11-28 00:21:07,980 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-28 00:21:07,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2019-11-28 00:21:07,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 180. [2019-11-28 00:21:07,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-11-28 00:21:07,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 235 transitions. [2019-11-28 00:21:07,999 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 235 transitions. Word has length 51 [2019-11-28 00:21:07,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:21:07,999 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 235 transitions. [2019-11-28 00:21:07,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:21:08,000 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 235 transitions. [2019-11-28 00:21:08,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-28 00:21:08,001 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:21:08,001 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-28 00:21:08,001 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:21:08,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:21:08,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1849817445, now seen corresponding path program 1 times [2019-11-28 00:21:08,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:21:08,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220194852] [2019-11-28 00:21:08,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:21:08,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 00:21:08,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 00:21:08,198 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 00:21:08,199 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 00:21:08,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:21:08 BoogieIcfgContainer [2019-11-28 00:21:08,372 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 00:21:08,373 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 00:21:08,373 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 00:21:08,373 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 00:21:08,374 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:21:05" (3/4) ... [2019-11-28 00:21:08,376 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 00:21:08,524 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 00:21:08,524 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 00:21:08,527 INFO L168 Benchmark]: Toolchain (without parser) took 4753.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 214.4 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -123.8 MB). Peak memory consumption was 90.6 MB. Max. memory is 11.5 GB. [2019-11-28 00:21:08,527 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:21:08,528 INFO L168 Benchmark]: CACSL2BoogieTranslator took 640.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -161.9 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. [2019-11-28 00:21:08,528 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.16 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-28 00:21:08,528 INFO L168 Benchmark]: Boogie Preprocessor took 50.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 00:21:08,529 INFO L168 Benchmark]: RCFGBuilder took 810.37 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: 64.7 MB). Peak memory consumption was 64.7 MB. Max. memory is 11.5 GB. [2019-11-28 00:21:08,529 INFO L168 Benchmark]: TraceAbstraction took 3021.82 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 77.1 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -64.8 MB). Peak memory consumption was 12.3 MB. Max. memory is 11.5 GB. [2019-11-28 00:21:08,529 INFO L168 Benchmark]: Witness Printer took 151.47 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: 31.4 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. [2019-11-28 00:21:08,532 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 640.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -161.9 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 73.16 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 50.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 810.37 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: 64.7 MB). Peak memory consumption was 64.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3021.82 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 77.1 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -64.8 MB). Peak memory consumption was 12.3 MB. Max. memory is 11.5 GB. * Witness Printer took 151.47 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: 31.4 MB). Peak memory consumption was 31.4 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: 2.7s, 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.3s 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.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 667 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.6s 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...