./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec4_product36.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_spec4_product36.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 8094c843e4d897e4501a7b90ca3369f741555e9e ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:22:45,300 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 00:22:45,303 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 00:22:45,315 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 00:22:45,316 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 00:22:45,317 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 00:22:45,319 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 00:22:45,321 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 00:22:45,323 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 00:22:45,324 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 00:22:45,325 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 00:22:45,328 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 00:22:45,329 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 00:22:45,331 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 00:22:45,332 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 00:22:45,333 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 00:22:45,335 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 00:22:45,336 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 00:22:45,341 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 00:22:45,345 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 00:22:45,348 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 00:22:45,353 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 00:22:45,358 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 00:22:45,359 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 00:22:45,363 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 00:22:45,363 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 00:22:45,364 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 00:22:45,365 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 00:22:45,365 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 00:22:45,367 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 00:22:45,368 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 00:22:45,368 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 00:22:45,370 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 00:22:45,371 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 00:22:45,373 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 00:22:45,373 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 00:22:45,374 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 00:22:45,374 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 00:22:45,374 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 00:22:45,377 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 00:22:45,378 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 00:22:45,379 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:22:45,401 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 00:22:45,402 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 00:22:45,403 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 00:22:45,404 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 00:22:45,404 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 00:22:45,404 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 00:22:45,405 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 00:22:45,405 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 00:22:45,405 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 00:22:45,406 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 00:22:45,406 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 00:22:45,406 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 00:22:45,406 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 00:22:45,407 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 00:22:45,407 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 00:22:45,407 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 00:22:45,408 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 00:22:45,408 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 00:22:45,408 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 00:22:45,409 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 00:22:45,409 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 00:22:45,409 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:22:45,409 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 00:22:45,410 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 00:22:45,410 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 00:22:45,410 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 00:22:45,411 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 00:22:45,411 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 00:22:45,411 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 -> 8094c843e4d897e4501a7b90ca3369f741555e9e [2019-11-28 00:22:45,737 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 00:22:45,750 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 00:22:45,753 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 00:22:45,755 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 00:22:45,755 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 00:22:45,756 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec4_product36.cil.c [2019-11-28 00:22:45,812 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d80fd3ac/612fd31b44bb4a1390a276869dd8704f/FLAG6d1c2ac36 [2019-11-28 00:22:46,424 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 00:22:46,424 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product36.cil.c [2019-11-28 00:22:46,451 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d80fd3ac/612fd31b44bb4a1390a276869dd8704f/FLAG6d1c2ac36 [2019-11-28 00:22:46,659 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d80fd3ac/612fd31b44bb4a1390a276869dd8704f [2019-11-28 00:22:46,662 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 00:22:46,664 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 00:22:46,665 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 00:22:46,665 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 00:22:46,668 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 00:22:46,669 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:22:46" (1/1) ... [2019-11-28 00:22:46,671 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b7bf631 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:46, skipping insertion in model container [2019-11-28 00:22:46,672 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:22:46" (1/1) ... [2019-11-28 00:22:46,678 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 00:22:46,743 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 00:22:47,211 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:22:47,223 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 00:22:47,313 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:22:47,354 INFO L208 MainTranslator]: Completed translation [2019-11-28 00:22:47,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:47 WrapperNode [2019-11-28 00:22:47,355 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 00:22:47,356 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 00:22:47,356 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 00:22:47,357 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 00:22:47,365 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:22:47" (1/1) ... [2019-11-28 00:22:47,393 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:22:47" (1/1) ... [2019-11-28 00:22:47,432 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 00:22:47,433 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 00:22:47,433 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 00:22:47,433 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 00:22:47,443 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:47" (1/1) ... [2019-11-28 00:22:47,444 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:47" (1/1) ... [2019-11-28 00:22:47,448 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:47" (1/1) ... [2019-11-28 00:22:47,448 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:47" (1/1) ... [2019-11-28 00:22:47,459 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:47" (1/1) ... [2019-11-28 00:22:47,467 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:47" (1/1) ... [2019-11-28 00:22:47,470 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:47" (1/1) ... [2019-11-28 00:22:47,474 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 00:22:47,475 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 00:22:47,475 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 00:22:47,475 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 00:22:47,476 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:47" (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:22:47,548 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 00:22:47,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-28 00:22:47,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 00:22:47,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 00:22:48,319 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 00:22:48,319 INFO L297 CfgBuilder]: Removed 102 assume(true) statements. [2019-11-28 00:22:48,320 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:22:48 BoogieIcfgContainer [2019-11-28 00:22:48,321 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 00:22:48,322 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 00:22:48,322 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 00:22:48,326 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 00:22:48,326 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:22:46" (1/3) ... [2019-11-28 00:22:48,327 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c488998 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:22:48, skipping insertion in model container [2019-11-28 00:22:48,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:47" (2/3) ... [2019-11-28 00:22:48,328 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c488998 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:22:48, skipping insertion in model container [2019-11-28 00:22:48,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:22:48" (3/3) ... [2019-11-28 00:22:48,330 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec4_product36.cil.c [2019-11-28 00:22:48,341 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 00:22:48,350 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-28 00:22:48,364 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-28 00:22:48,394 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 00:22:48,394 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 00:22:48,395 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 00:22:48,395 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 00:22:48,395 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 00:22:48,396 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 00:22:48,396 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 00:22:48,396 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 00:22:48,417 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states. [2019-11-28 00:22:48,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 00:22:48,425 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:48,427 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:22:48,427 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:48,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:48,435 INFO L82 PathProgramCache]: Analyzing trace with hash -502845476, now seen corresponding path program 1 times [2019-11-28 00:22:48,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:48,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069603654] [2019-11-28 00:22:48,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:48,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:48,756 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:22:48,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069603654] [2019-11-28 00:22:48,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:48,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:22:48,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822065937] [2019-11-28 00:22:48,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 00:22:48,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:48,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 00:22:48,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 00:22:48,778 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 2 states. [2019-11-28 00:22:48,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:48,805 INFO L93 Difference]: Finished difference Result 154 states and 233 transitions. [2019-11-28 00:22:48,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 00:22:48,807 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-11-28 00:22:48,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:48,819 INFO L225 Difference]: With dead ends: 154 [2019-11-28 00:22:48,819 INFO L226 Difference]: Without dead ends: 76 [2019-11-28 00:22:48,823 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:22:48,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-28 00:22:48,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-11-28 00:22:48,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-28 00:22:48,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 108 transitions. [2019-11-28 00:22:48,863 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 108 transitions. Word has length 16 [2019-11-28 00:22:48,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:48,863 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 108 transitions. [2019-11-28 00:22:48,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 00:22:48,864 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 108 transitions. [2019-11-28 00:22:48,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 00:22:48,865 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:48,865 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:22:48,865 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:48,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:48,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1549602373, now seen corresponding path program 1 times [2019-11-28 00:22:48,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:48,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300155648] [2019-11-28 00:22:48,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:48,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:49,013 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:22:49,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300155648] [2019-11-28 00:22:49,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:49,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:22:49,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584249915] [2019-11-28 00:22:49,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:22:49,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:49,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:22:49,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:22:49,020 INFO L87 Difference]: Start difference. First operand 76 states and 108 transitions. Second operand 3 states. [2019-11-28 00:22:49,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:49,046 INFO L93 Difference]: Finished difference Result 76 states and 108 transitions. [2019-11-28 00:22:49,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:22:49,047 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 00:22:49,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:49,049 INFO L225 Difference]: With dead ends: 76 [2019-11-28 00:22:49,051 INFO L226 Difference]: Without dead ends: 36 [2019-11-28 00:22:49,053 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:22:49,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-28 00:22:49,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-11-28 00:22:49,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-28 00:22:49,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 51 transitions. [2019-11-28 00:22:49,069 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 51 transitions. Word has length 17 [2019-11-28 00:22:49,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:49,069 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 51 transitions. [2019-11-28 00:22:49,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:22:49,070 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 51 transitions. [2019-11-28 00:22:49,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 00:22:49,072 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:49,072 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] [2019-11-28 00:22:49,073 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:49,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:49,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1499295122, now seen corresponding path program 1 times [2019-11-28 00:22:49,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:49,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310324077] [2019-11-28 00:22:49,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:49,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:49,177 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:22:49,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310324077] [2019-11-28 00:22:49,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:49,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:22:49,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264932036] [2019-11-28 00:22:49,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:22:49,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:49,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:22:49,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:22:49,180 INFO L87 Difference]: Start difference. First operand 36 states and 51 transitions. Second operand 3 states. [2019-11-28 00:22:49,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:49,221 INFO L93 Difference]: Finished difference Result 96 states and 141 transitions. [2019-11-28 00:22:49,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:22:49,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-28 00:22:49,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:49,223 INFO L225 Difference]: With dead ends: 96 [2019-11-28 00:22:49,224 INFO L226 Difference]: Without dead ends: 66 [2019-11-28 00:22:49,224 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:22:49,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-28 00:22:49,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 62. [2019-11-28 00:22:49,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-28 00:22:49,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 91 transitions. [2019-11-28 00:22:49,234 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 91 transitions. Word has length 22 [2019-11-28 00:22:49,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:49,235 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 91 transitions. [2019-11-28 00:22:49,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:22:49,235 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 91 transitions. [2019-11-28 00:22:49,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 00:22:49,236 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:49,236 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] [2019-11-28 00:22:49,237 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:49,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:49,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1870150441, now seen corresponding path program 1 times [2019-11-28 00:22:49,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:49,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175240195] [2019-11-28 00:22:49,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:49,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:49,326 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:22:49,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175240195] [2019-11-28 00:22:49,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:49,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:22:49,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077179104] [2019-11-28 00:22:49,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:22:49,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:49,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:22:49,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:22:49,329 INFO L87 Difference]: Start difference. First operand 62 states and 91 transitions. Second operand 3 states. [2019-11-28 00:22:49,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:49,388 INFO L93 Difference]: Finished difference Result 159 states and 238 transitions. [2019-11-28 00:22:49,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:22:49,390 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-28 00:22:49,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:49,391 INFO L225 Difference]: With dead ends: 159 [2019-11-28 00:22:49,391 INFO L226 Difference]: Without dead ends: 103 [2019-11-28 00:22:49,395 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:22:49,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-11-28 00:22:49,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2019-11-28 00:22:49,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-11-28 00:22:49,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 147 transitions. [2019-11-28 00:22:49,417 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 147 transitions. Word has length 23 [2019-11-28 00:22:49,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:49,417 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 147 transitions. [2019-11-28 00:22:49,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:22:49,418 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 147 transitions. [2019-11-28 00:22:49,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 00:22:49,420 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:49,420 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:22:49,420 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:49,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:49,421 INFO L82 PathProgramCache]: Analyzing trace with hash 944519591, now seen corresponding path program 1 times [2019-11-28 00:22:49,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:49,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139243965] [2019-11-28 00:22:49,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:49,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:49,555 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:22:49,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139243965] [2019-11-28 00:22:49,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:49,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:22:49,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674798274] [2019-11-28 00:22:49,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:22:49,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:49,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:22:49,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:22:49,557 INFO L87 Difference]: Start difference. First operand 101 states and 147 transitions. Second operand 5 states. [2019-11-28 00:22:49,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:49,697 INFO L93 Difference]: Finished difference Result 369 states and 545 transitions. [2019-11-28 00:22:49,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:22:49,700 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-11-28 00:22:49,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:49,707 INFO L225 Difference]: With dead ends: 369 [2019-11-28 00:22:49,707 INFO L226 Difference]: Without dead ends: 274 [2019-11-28 00:22:49,709 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-28 00:22:49,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-11-28 00:22:49,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 182. [2019-11-28 00:22:49,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-11-28 00:22:49,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 256 transitions. [2019-11-28 00:22:49,755 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 256 transitions. Word has length 25 [2019-11-28 00:22:49,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:49,756 INFO L462 AbstractCegarLoop]: Abstraction has 182 states and 256 transitions. [2019-11-28 00:22:49,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:22:49,756 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 256 transitions. [2019-11-28 00:22:49,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 00:22:49,760 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:49,761 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] [2019-11-28 00:22:49,762 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:49,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:49,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1014789399, now seen corresponding path program 1 times [2019-11-28 00:22:49,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:49,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252002804] [2019-11-28 00:22:49,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:49,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:49,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-28 00:22:49,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252002804] [2019-11-28 00:22:49,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:49,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:22:49,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842646485] [2019-11-28 00:22:49,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:22:49,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:49,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:22:49,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:22:49,845 INFO L87 Difference]: Start difference. First operand 182 states and 256 transitions. Second operand 5 states. [2019-11-28 00:22:49,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:49,984 INFO L93 Difference]: Finished difference Result 368 states and 530 transitions. [2019-11-28 00:22:49,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 00:22:49,985 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-28 00:22:49,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:49,987 INFO L225 Difference]: With dead ends: 368 [2019-11-28 00:22:49,987 INFO L226 Difference]: Without dead ends: 366 [2019-11-28 00:22:49,989 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:22:49,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-11-28 00:22:50,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 182. [2019-11-28 00:22:50,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-11-28 00:22:50,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 254 transitions. [2019-11-28 00:22:50,010 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 254 transitions. Word has length 26 [2019-11-28 00:22:50,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:50,010 INFO L462 AbstractCegarLoop]: Abstraction has 182 states and 254 transitions. [2019-11-28 00:22:50,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:22:50,011 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 254 transitions. [2019-11-28 00:22:50,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 00:22:50,013 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:50,013 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] [2019-11-28 00:22:50,013 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:50,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:50,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1944189962, now seen corresponding path program 1 times [2019-11-28 00:22:50,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:50,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913812596] [2019-11-28 00:22:50,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:50,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:50,077 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:22:50,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913812596] [2019-11-28 00:22:50,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:50,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:22:50,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334986386] [2019-11-28 00:22:50,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:22:50,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:50,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:22:50,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:22:50,081 INFO L87 Difference]: Start difference. First operand 182 states and 254 transitions. Second operand 5 states. [2019-11-28 00:22:50,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:50,156 INFO L93 Difference]: Finished difference Result 505 states and 702 transitions. [2019-11-28 00:22:50,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:22:50,157 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-11-28 00:22:50,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:50,159 INFO L225 Difference]: With dead ends: 505 [2019-11-28 00:22:50,160 INFO L226 Difference]: Without dead ends: 329 [2019-11-28 00:22:50,161 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:22:50,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2019-11-28 00:22:50,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 194. [2019-11-28 00:22:50,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-11-28 00:22:50,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 266 transitions. [2019-11-28 00:22:50,180 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 266 transitions. Word has length 30 [2019-11-28 00:22:50,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:50,181 INFO L462 AbstractCegarLoop]: Abstraction has 194 states and 266 transitions. [2019-11-28 00:22:50,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:22:50,181 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 266 transitions. [2019-11-28 00:22:50,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 00:22:50,183 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:50,183 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] [2019-11-28 00:22:50,183 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:50,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:50,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1551162952, now seen corresponding path program 1 times [2019-11-28 00:22:50,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:50,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176052513] [2019-11-28 00:22:50,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:50,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:50,240 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:22:50,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176052513] [2019-11-28 00:22:50,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:50,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:22:50,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882906543] [2019-11-28 00:22:50,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:22:50,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:50,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:22:50,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:22:50,243 INFO L87 Difference]: Start difference. First operand 194 states and 266 transitions. Second operand 5 states. [2019-11-28 00:22:50,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:50,361 INFO L93 Difference]: Finished difference Result 479 states and 651 transitions. [2019-11-28 00:22:50,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 00:22:50,362 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-11-28 00:22:50,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:50,364 INFO L225 Difference]: With dead ends: 479 [2019-11-28 00:22:50,364 INFO L226 Difference]: Without dead ends: 291 [2019-11-28 00:22:50,365 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 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:22:50,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-11-28 00:22:50,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 159. [2019-11-28 00:22:50,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-11-28 00:22:50,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 214 transitions. [2019-11-28 00:22:50,379 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 214 transitions. Word has length 30 [2019-11-28 00:22:50,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:50,380 INFO L462 AbstractCegarLoop]: Abstraction has 159 states and 214 transitions. [2019-11-28 00:22:50,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:22:50,380 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 214 transitions. [2019-11-28 00:22:50,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 00:22:50,381 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:50,381 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] [2019-11-28 00:22:50,382 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:50,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:50,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1809328390, now seen corresponding path program 1 times [2019-11-28 00:22:50,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:50,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230268051] [2019-11-28 00:22:50,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:50,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:50,432 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:22:50,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230268051] [2019-11-28 00:22:50,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:50,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:22:50,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395778172] [2019-11-28 00:22:50,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:22:50,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:50,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:22:50,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:22:50,435 INFO L87 Difference]: Start difference. First operand 159 states and 214 transitions. Second operand 5 states. [2019-11-28 00:22:50,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:50,586 INFO L93 Difference]: Finished difference Result 420 states and 588 transitions. [2019-11-28 00:22:50,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:22:50,587 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-11-28 00:22:50,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:50,591 INFO L225 Difference]: With dead ends: 420 [2019-11-28 00:22:50,591 INFO L226 Difference]: Without dead ends: 315 [2019-11-28 00:22:50,592 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-28 00:22:50,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-11-28 00:22:50,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 236. [2019-11-28 00:22:50,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-11-28 00:22:50,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 315 transitions. [2019-11-28 00:22:50,625 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 315 transitions. Word has length 30 [2019-11-28 00:22:50,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:50,626 INFO L462 AbstractCegarLoop]: Abstraction has 236 states and 315 transitions. [2019-11-28 00:22:50,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:22:50,626 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 315 transitions. [2019-11-28 00:22:50,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 00:22:50,628 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:50,628 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:22:50,628 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:50,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:50,629 INFO L82 PathProgramCache]: Analyzing trace with hash 61594744, now seen corresponding path program 1 times [2019-11-28 00:22:50,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:50,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249158385] [2019-11-28 00:22:50,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:50,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:50,738 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:22:50,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249158385] [2019-11-28 00:22:50,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [458505156] [2019-11-28 00:22:50,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:22:50,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:50,970 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 00:22:50,983 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:22:51,043 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:22:51,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:22:51,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-11-28 00:22:51,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657189253] [2019-11-28 00:22:51,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 00:22:51,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:51,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 00:22:51,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 00:22:51,049 INFO L87 Difference]: Start difference. First operand 236 states and 315 transitions. Second operand 6 states. [2019-11-28 00:22:51,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:51,290 INFO L93 Difference]: Finished difference Result 699 states and 959 transitions. [2019-11-28 00:22:51,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 00:22:51,291 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2019-11-28 00:22:51,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:51,296 INFO L225 Difference]: With dead ends: 699 [2019-11-28 00:22:51,298 INFO L226 Difference]: Without dead ends: 517 [2019-11-28 00:22:51,299 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-11-28 00:22:51,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2019-11-28 00:22:51,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 321. [2019-11-28 00:22:51,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-11-28 00:22:51,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 433 transitions. [2019-11-28 00:22:51,345 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 433 transitions. Word has length 45 [2019-11-28 00:22:51,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:51,345 INFO L462 AbstractCegarLoop]: Abstraction has 321 states and 433 transitions. [2019-11-28 00:22:51,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 00:22:51,345 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 433 transitions. [2019-11-28 00:22:51,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-28 00:22:51,346 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:51,346 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-28 00:22:51,550 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:22:51,551 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:51,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:51,552 INFO L82 PathProgramCache]: Analyzing trace with hash -594503994, now seen corresponding path program 2 times [2019-11-28 00:22:51,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:51,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876325017] [2019-11-28 00:22:51,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:51,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 00:22:51,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 00:22:51,717 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 00:22:51,717 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 00:22:51,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:22:51 BoogieIcfgContainer [2019-11-28 00:22:51,862 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 00:22:51,863 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 00:22:51,863 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 00:22:51,863 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 00:22:51,863 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:22:48" (3/4) ... [2019-11-28 00:22:51,868 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 00:22:52,026 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 00:22:52,026 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 00:22:52,031 INFO L168 Benchmark]: Toolchain (without parser) took 5364.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 208.1 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -111.8 MB). Peak memory consumption was 96.4 MB. Max. memory is 11.5 GB. [2019-11-28 00:22:52,031 INFO L168 Benchmark]: CDTParser took 0.19 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:22:52,032 INFO L168 Benchmark]: CACSL2BoogieTranslator took 690.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -150.3 MB). Peak memory consumption was 27.4 MB. Max. memory is 11.5 GB. [2019-11-28 00:22:52,032 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.46 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:22:52,032 INFO L168 Benchmark]: Boogie Preprocessor took 41.56 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:22:52,035 INFO L168 Benchmark]: RCFGBuilder took 846.27 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: 58.3 MB). Peak memory consumption was 58.3 MB. Max. memory is 11.5 GB. [2019-11-28 00:22:52,035 INFO L168 Benchmark]: TraceAbstraction took 3540.26 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 82.8 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -50.0 MB). Peak memory consumption was 32.9 MB. Max. memory is 11.5 GB. [2019-11-28 00:22:52,036 INFO L168 Benchmark]: Witness Printer took 163.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. [2019-11-28 00:22:52,038 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.19 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 690.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -150.3 MB). Peak memory consumption was 27.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 76.46 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. * Boogie Preprocessor took 41.56 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 846.27 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: 58.3 MB). Peak memory consumption was 58.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3540.26 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 82.8 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -50.0 MB). Peak memory consumption was 32.9 MB. Max. memory is 11.5 GB. * Witness Printer took 163.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 437]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L123] int pumpRunning = 0; [L124] int systemActive = 1; [L299] int cleanupTimeShifts = 4; [L611] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L809] int waterLevel = 1; [L810] int methaneLevelCritical = 0; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L375] int retValue_acc ; [L376] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L424] int retValue_acc ; [L427] retValue_acc = 1 [L428] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L382] tmp = valid_product() [L384] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L47] int splverifierCounter ; [L48] int tmp ; [L49] int tmp___0 ; [L50] int tmp___1 ; [L51] int tmp___2 ; [L54] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L56] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L58] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L64] tmp = __VERIFIER_nondet_int() [L66] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L827] COND TRUE waterLevel < 2 [L828] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L74] tmp___0 = __VERIFIER_nondet_int() [L76] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L84] tmp___2 = __VERIFIER_nondet_int() [L86] COND TRUE \read(tmp___2) [L294] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L131] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L138] COND TRUE \read(systemActive) [L160] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L163] COND TRUE ! pumpRunning [L257] int retValue_acc ; [L258] int tmp ; [L259] int tmp___0 ; [L889] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L892] COND FALSE !(waterLevel < 2) [L896] retValue_acc = 0 [L897] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L263] tmp = isHighWaterSensorDry() [L265] COND FALSE !(\read(tmp)) [L268] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L270] retValue_acc = tmp___0 [L271] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L165] tmp = isHighWaterLevel() [L167] COND TRUE \read(tmp) [L188] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L904] int tmp ; [L905] int tmp___0 ; [L880] int retValue_acc ; [L883] retValue_acc = waterLevel [L884] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L909] tmp = getWaterLevel() [L911] COND FALSE !(tmp == 0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L56] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L58] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L64] tmp = __VERIFIER_nondet_int() [L66] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L74] tmp___0 = __VERIFIER_nondet_int() [L76] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L84] tmp___2 = __VERIFIER_nondet_int() [L86] COND TRUE \read(tmp___2) [L294] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L131] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L815] COND TRUE waterLevel > 0 [L816] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L138] COND TRUE \read(systemActive) [L160] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L163] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L904] int tmp ; [L905] int tmp___0 ; [L880] int retValue_acc ; [L883] retValue_acc = waterLevel [L884] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L909] tmp = getWaterLevel() [L911] COND FALSE !(tmp == 0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L56] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L58] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L64] tmp = __VERIFIER_nondet_int() [L66] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L74] tmp___0 = __VERIFIER_nondet_int() [L76] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L84] tmp___2 = __VERIFIER_nondet_int() [L86] COND TRUE \read(tmp___2) [L294] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L131] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L815] COND TRUE waterLevel > 0 [L816] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L138] COND TRUE \read(systemActive) [L160] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L163] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L904] int tmp ; [L905] int tmp___0 ; [L880] int retValue_acc ; [L883] retValue_acc = waterLevel [L884] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L909] tmp = getWaterLevel() [L911] COND TRUE tmp == 0 [L212] int retValue_acc ; [L215] retValue_acc = pumpRunning [L216] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L913] tmp___0 = isPumpRunning() [L915] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L437] __VERIFIER_error() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 80 locations, 3 error locations. Result: UNSAFE, OverallTime: 3.3s, OverallIterations: 11, TraceHistogramMax: 3, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 794 SDtfs, 1113 SDslu, 1284 SDs, 0 SdLazy, 203 SolverSat, 45 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 115 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=321occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 824 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 369 NumberOfCodeBlocks, 369 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 298 ConstructedInterpolants, 0 QuantifiedInterpolants, 17038 SizeOfPredicates, 4 NumberOfNonLiveVariables, 379 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 11 InterpolantComputations, 9 PerfectInterpolantSequences, 22/28 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...