./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec4_product55_true-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: 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 /storage/repos/svcomp/c/product-lines/minepump_spec4_product55_true-unreach-call_false-termination.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 9385f61fe99e17c8ecdfdd2ac56623ca621310c3 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 14:54:30,233 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 14:54:30,235 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 14:54:30,246 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 14:54:30,252 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 14:54:30,254 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 14:54:30,255 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 14:54:30,256 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 14:54:30,258 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 14:54:30,259 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 14:54:30,260 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 14:54:30,260 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 14:54:30,261 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 14:54:30,262 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 14:54:30,263 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 14:54:30,263 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 14:54:30,264 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 14:54:30,268 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 14:54:30,272 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 14:54:30,273 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 14:54:30,274 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 14:54:30,279 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 14:54:30,283 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 14:54:30,284 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 14:54:30,284 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 14:54:30,288 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 14:54:30,289 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 14:54:30,290 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 14:54:30,291 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 14:54:30,295 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 14:54:30,295 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 14:54:30,297 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 14:54:30,297 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 14:54:30,297 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 14:54:30,298 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 14:54:30,299 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 14:54:30,299 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 14:54:30,328 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 14:54:30,329 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 14:54:30,332 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 14:54:30,332 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 14:54:30,332 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 14:54:30,332 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 14:54:30,332 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 14:54:30,333 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 14:54:30,334 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 14:54:30,334 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 14:54:30,334 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 14:54:30,334 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 14:54:30,334 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 14:54:30,334 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 14:54:30,335 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 14:54:30,335 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 14:54:30,335 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 14:54:30,335 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 14:54:30,335 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 14:54:30,336 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 14:54:30,337 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 14:54:30,337 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 14:54:30,337 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 14:54:30,337 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 14:54:30,338 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 14:54:30,338 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 14:54:30,338 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 14:54:30,338 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 14:54:30,338 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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 -> 9385f61fe99e17c8ecdfdd2ac56623ca621310c3 [2019-01-12 14:54:30,392 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 14:54:30,409 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 14:54:30,416 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 14:54:30,417 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 14:54:30,418 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 14:54:30,419 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec4_product55_true-unreach-call_false-termination.cil.c [2019-01-12 14:54:30,474 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/114935d65/73b4b4a82d714831a820aae5bc592078/FLAG80fa28611 [2019-01-12 14:54:30,952 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 14:54:30,953 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec4_product55_true-unreach-call_false-termination.cil.c [2019-01-12 14:54:30,965 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/114935d65/73b4b4a82d714831a820aae5bc592078/FLAG80fa28611 [2019-01-12 14:54:31,252 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/114935d65/73b4b4a82d714831a820aae5bc592078 [2019-01-12 14:54:31,255 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 14:54:31,257 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 14:54:31,258 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 14:54:31,258 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 14:54:31,262 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 14:54:31,263 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:54:31" (1/1) ... [2019-01-12 14:54:31,266 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d680728 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:54:31, skipping insertion in model container [2019-01-12 14:54:31,267 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:54:31" (1/1) ... [2019-01-12 14:54:31,276 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 14:54:31,334 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 14:54:31,663 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:54:31,684 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 14:54:31,871 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:54:31,920 INFO L195 MainTranslator]: Completed translation [2019-01-12 14:54:31,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:54:31 WrapperNode [2019-01-12 14:54:31,921 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 14:54:31,922 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 14:54:31,922 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 14:54:31,922 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 14:54:31,932 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:54:31" (1/1) ... [2019-01-12 14:54:31,952 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:54:31" (1/1) ... [2019-01-12 14:54:32,024 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 14:54:32,024 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 14:54:32,025 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 14:54:32,025 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 14:54:32,036 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:54:31" (1/1) ... [2019-01-12 14:54:32,036 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:54:31" (1/1) ... [2019-01-12 14:54:32,043 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:54:31" (1/1) ... [2019-01-12 14:54:32,044 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:54:31" (1/1) ... [2019-01-12 14:54:32,064 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:54:31" (1/1) ... [2019-01-12 14:54:32,081 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:54:31" (1/1) ... [2019-01-12 14:54:32,090 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:54:31" (1/1) ... [2019-01-12 14:54:32,104 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 14:54:32,104 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 14:54:32,104 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 14:54:32,105 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 14:54:32,105 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:54:31" (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-01-12 14:54:32,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 14:54:32,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-12 14:54:32,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 14:54:32,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 14:54:33,827 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 14:54:33,827 INFO L286 CfgBuilder]: Removed 280 assue(true) statements. [2019-01-12 14:54:33,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:54:33 BoogieIcfgContainer [2019-01-12 14:54:33,828 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 14:54:33,830 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 14:54:33,830 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 14:54:33,833 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 14:54:33,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 02:54:31" (1/3) ... [2019-01-12 14:54:33,834 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37b70a01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:54:33, skipping insertion in model container [2019-01-12 14:54:33,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:54:31" (2/3) ... [2019-01-12 14:54:33,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37b70a01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:54:33, skipping insertion in model container [2019-01-12 14:54:33,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:54:33" (3/3) ... [2019-01-12 14:54:33,837 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec4_product55_true-unreach-call_false-termination.cil.c [2019-01-12 14:54:33,847 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 14:54:33,855 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-12 14:54:33,872 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-12 14:54:33,907 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 14:54:33,908 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 14:54:33,908 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 14:54:33,908 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 14:54:33,908 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 14:54:33,908 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 14:54:33,909 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 14:54:33,909 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 14:54:33,909 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 14:54:33,931 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states. [2019-01-12 14:54:33,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-12 14:54:33,939 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:54:33,940 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:54:33,943 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:54:33,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:54:33,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1084846627, now seen corresponding path program 1 times [2019-01-12 14:54:33,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:54:33,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:54:33,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:33,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:54:33,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:34,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:54:34,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:54:34,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:54:34,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:54:34,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 14:54:34,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 14:54:34,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 14:54:34,213 INFO L87 Difference]: Start difference. First operand 191 states. Second operand 2 states. [2019-01-12 14:54:34,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:54:34,256 INFO L93 Difference]: Finished difference Result 376 states and 575 transitions. [2019-01-12 14:54:34,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 14:54:34,258 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-01-12 14:54:34,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:54:34,272 INFO L225 Difference]: With dead ends: 376 [2019-01-12 14:54:34,272 INFO L226 Difference]: Without dead ends: 187 [2019-01-12 14:54:34,276 INFO L631 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-01-12 14:54:34,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-01-12 14:54:34,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2019-01-12 14:54:34,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-01-12 14:54:34,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 279 transitions. [2019-01-12 14:54:34,326 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 279 transitions. Word has length 16 [2019-01-12 14:54:34,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:54:34,326 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 279 transitions. [2019-01-12 14:54:34,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 14:54:34,326 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 279 transitions. [2019-01-12 14:54:34,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-12 14:54:34,328 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:54:34,328 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:54:34,328 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:54:34,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:54:34,329 INFO L82 PathProgramCache]: Analyzing trace with hash 38089730, now seen corresponding path program 1 times [2019-01-12 14:54:34,329 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:54:34,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:54:34,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:34,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:54:34,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:34,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:54:34,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:54:34,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:54:34,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 14:54:34,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:54:34,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:54:34,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:54:34,457 INFO L87 Difference]: Start difference. First operand 187 states and 279 transitions. Second operand 3 states. [2019-01-12 14:54:34,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:54:34,488 INFO L93 Difference]: Finished difference Result 187 states and 279 transitions. [2019-01-12 14:54:34,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:54:34,489 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-01-12 14:54:34,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:54:34,491 INFO L225 Difference]: With dead ends: 187 [2019-01-12 14:54:34,491 INFO L226 Difference]: Without dead ends: 73 [2019-01-12 14:54:34,493 INFO L631 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-01-12 14:54:34,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-01-12 14:54:34,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-01-12 14:54:34,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-12 14:54:34,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 108 transitions. [2019-01-12 14:54:34,510 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 108 transitions. Word has length 17 [2019-01-12 14:54:34,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:54:34,510 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 108 transitions. [2019-01-12 14:54:34,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:54:34,511 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 108 transitions. [2019-01-12 14:54:34,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-12 14:54:34,512 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:54:34,515 INFO L402 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-01-12 14:54:34,516 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:54:34,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:54:34,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1082167242, now seen corresponding path program 1 times [2019-01-12 14:54:34,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:54:34,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:54:34,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:34,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:54:34,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:34,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:54:34,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:54:34,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:54:34,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:54:34,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 14:54:34,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 14:54:34,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-12 14:54:34,905 INFO L87 Difference]: Start difference. First operand 73 states and 108 transitions. Second operand 6 states. [2019-01-12 14:54:35,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:54:35,142 INFO L93 Difference]: Finished difference Result 230 states and 346 transitions. [2019-01-12 14:54:35,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 14:54:35,144 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-01-12 14:54:35,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:54:35,145 INFO L225 Difference]: With dead ends: 230 [2019-01-12 14:54:35,146 INFO L226 Difference]: Without dead ends: 163 [2019-01-12 14:54:35,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-12 14:54:35,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-01-12 14:54:35,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 92. [2019-01-12 14:54:35,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-01-12 14:54:35,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 137 transitions. [2019-01-12 14:54:35,161 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 137 transitions. Word has length 22 [2019-01-12 14:54:35,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:54:35,161 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 137 transitions. [2019-01-12 14:54:35,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 14:54:35,162 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 137 transitions. [2019-01-12 14:54:35,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-12 14:54:35,163 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:54:35,163 INFO L402 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-01-12 14:54:35,164 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:54:35,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:54:35,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1933185311, now seen corresponding path program 1 times [2019-01-12 14:54:35,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:54:35,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:54:35,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:35,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:54:35,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:35,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:54:35,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:54:35,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:54:35,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:54:35,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:54:35,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:54:35,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:54:35,273 INFO L87 Difference]: Start difference. First operand 92 states and 137 transitions. Second operand 3 states. [2019-01-12 14:54:35,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:54:35,687 INFO L93 Difference]: Finished difference Result 187 states and 280 transitions. [2019-01-12 14:54:35,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:54:35,689 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-01-12 14:54:35,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:54:35,690 INFO L225 Difference]: With dead ends: 187 [2019-01-12 14:54:35,691 INFO L226 Difference]: Without dead ends: 101 [2019-01-12 14:54:35,692 INFO L631 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-01-12 14:54:35,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-12 14:54:35,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2019-01-12 14:54:35,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-01-12 14:54:35,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 141 transitions. [2019-01-12 14:54:35,715 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 141 transitions. Word has length 25 [2019-01-12 14:54:35,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:54:35,716 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 141 transitions. [2019-01-12 14:54:35,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:54:35,717 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 141 transitions. [2019-01-12 14:54:35,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-12 14:54:35,718 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:54:35,718 INFO L402 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-01-12 14:54:35,718 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:54:35,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:54:35,720 INFO L82 PathProgramCache]: Analyzing trace with hash 2034893835, now seen corresponding path program 1 times [2019-01-12 14:54:35,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:54:35,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:54:35,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:35,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:54:35,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:35,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:54:35,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:54:35,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:54:35,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:54:35,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:54:35,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:54:35,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:54:35,893 INFO L87 Difference]: Start difference. First operand 99 states and 141 transitions. Second operand 5 states. [2019-01-12 14:54:36,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:54:36,577 INFO L93 Difference]: Finished difference Result 345 states and 498 transitions. [2019-01-12 14:54:36,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 14:54:36,578 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-01-12 14:54:36,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:54:36,581 INFO L225 Difference]: With dead ends: 345 [2019-01-12 14:54:36,582 INFO L226 Difference]: Without dead ends: 252 [2019-01-12 14:54:36,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-12 14:54:36,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2019-01-12 14:54:36,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 159. [2019-01-12 14:54:36,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-01-12 14:54:36,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 221 transitions. [2019-01-12 14:54:36,628 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 221 transitions. Word has length 25 [2019-01-12 14:54:36,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:54:36,630 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 221 transitions. [2019-01-12 14:54:36,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:54:36,630 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 221 transitions. [2019-01-12 14:54:36,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-12 14:54:36,632 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:54:36,632 INFO L402 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-01-12 14:54:36,632 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:54:36,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:54:36,633 INFO L82 PathProgramCache]: Analyzing trace with hash 75584845, now seen corresponding path program 1 times [2019-01-12 14:54:36,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:54:36,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:54:36,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:36,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:54:36,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:36,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:54:36,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:54:36,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:54:36,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:54:36,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:54:36,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:54:36,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:54:36,882 INFO L87 Difference]: Start difference. First operand 159 states and 221 transitions. Second operand 5 states. [2019-01-12 14:54:37,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:54:37,355 INFO L93 Difference]: Finished difference Result 341 states and 483 transitions. [2019-01-12 14:54:37,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 14:54:37,356 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-01-12 14:54:37,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:54:37,358 INFO L225 Difference]: With dead ends: 341 [2019-01-12 14:54:37,358 INFO L226 Difference]: Without dead ends: 339 [2019-01-12 14:54:37,359 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-12 14:54:37,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2019-01-12 14:54:37,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 159. [2019-01-12 14:54:37,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-01-12 14:54:37,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 219 transitions. [2019-01-12 14:54:37,388 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 219 transitions. Word has length 26 [2019-01-12 14:54:37,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:54:37,389 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 219 transitions. [2019-01-12 14:54:37,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:54:37,389 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 219 transitions. [2019-01-12 14:54:37,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-12 14:54:37,390 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:54:37,392 INFO L402 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-01-12 14:54:37,392 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:54:37,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:54:37,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1282530674, now seen corresponding path program 1 times [2019-01-12 14:54:37,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:54:37,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:54:37,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:37,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:54:37,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:37,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:54:37,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:54:37,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:54:37,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:54:37,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:54:37,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:54:37,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:54:37,630 INFO L87 Difference]: Start difference. First operand 159 states and 219 transitions. Second operand 5 states. [2019-01-12 14:54:38,005 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-12 14:54:38,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:54:38,616 INFO L93 Difference]: Finished difference Result 475 states and 651 transitions. [2019-01-12 14:54:38,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 14:54:38,619 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-01-12 14:54:38,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:54:38,626 INFO L225 Difference]: With dead ends: 475 [2019-01-12 14:54:38,626 INFO L226 Difference]: Without dead ends: 322 [2019-01-12 14:54:38,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-12 14:54:38,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-01-12 14:54:38,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 171. [2019-01-12 14:54:38,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-01-12 14:54:38,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 231 transitions. [2019-01-12 14:54:38,658 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 231 transitions. Word has length 32 [2019-01-12 14:54:38,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:54:38,659 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 231 transitions. [2019-01-12 14:54:38,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:54:38,659 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 231 transitions. [2019-01-12 14:54:38,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-12 14:54:38,665 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:54:38,665 INFO L402 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-01-12 14:54:38,665 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:54:38,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:54:38,666 INFO L82 PathProgramCache]: Analyzing trace with hash 889503664, now seen corresponding path program 1 times [2019-01-12 14:54:38,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:54:38,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:54:38,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:38,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:54:38,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:38,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:54:39,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:54:39,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:54:39,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 14:54:39,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 14:54:39,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 14:54:39,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 14:54:39,068 INFO L87 Difference]: Start difference. First operand 171 states and 231 transitions. Second operand 6 states. [2019-01-12 14:54:39,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:54:39,661 INFO L93 Difference]: Finished difference Result 447 states and 603 transitions. [2019-01-12 14:54:39,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 14:54:39,663 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-01-12 14:54:39,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:54:39,666 INFO L225 Difference]: With dead ends: 447 [2019-01-12 14:54:39,666 INFO L226 Difference]: Without dead ends: 282 [2019-01-12 14:54:39,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-01-12 14:54:39,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-01-12 14:54:39,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 157. [2019-01-12 14:54:39,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-01-12 14:54:39,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 208 transitions. [2019-01-12 14:54:39,695 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 208 transitions. Word has length 32 [2019-01-12 14:54:39,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:54:39,697 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 208 transitions. [2019-01-12 14:54:39,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 14:54:39,697 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 208 transitions. [2019-01-12 14:54:39,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-12 14:54:39,698 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:54:39,698 INFO L402 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-01-12 14:54:39,698 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:54:39,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:54:39,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1147669102, now seen corresponding path program 1 times [2019-01-12 14:54:39,700 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:54:39,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:54:39,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:39,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:54:39,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:39,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:54:39,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:54:39,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:54:39,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:54:39,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:54:39,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:54:39,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:54:39,833 INFO L87 Difference]: Start difference. First operand 157 states and 208 transitions. Second operand 5 states. [2019-01-12 14:54:40,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:54:40,861 INFO L93 Difference]: Finished difference Result 422 states and 571 transitions. [2019-01-12 14:54:40,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 14:54:40,863 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-01-12 14:54:40,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:54:40,866 INFO L225 Difference]: With dead ends: 422 [2019-01-12 14:54:40,866 INFO L226 Difference]: Without dead ends: 314 [2019-01-12 14:54:40,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-12 14:54:40,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-01-12 14:54:40,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 221. [2019-01-12 14:54:40,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-01-12 14:54:40,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 290 transitions. [2019-01-12 14:54:40,912 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 290 transitions. Word has length 32 [2019-01-12 14:54:40,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:54:40,913 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 290 transitions. [2019-01-12 14:54:40,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:54:40,913 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 290 transitions. [2019-01-12 14:54:40,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-12 14:54:40,918 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:54:40,918 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:54:40,919 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:54:40,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:54:40,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1597254592, now seen corresponding path program 1 times [2019-01-12 14:54:40,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:54:40,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:54:40,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:40,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:54:40,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:40,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:54:41,252 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:54:41,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:54:41,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 14:54:41,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 14:54:41,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 14:54:41,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-12 14:54:41,253 INFO L87 Difference]: Start difference. First operand 221 states and 290 transitions. Second operand 6 states. [2019-01-12 14:54:43,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:54:43,008 INFO L93 Difference]: Finished difference Result 1020 states and 1368 transitions. [2019-01-12 14:54:43,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 14:54:43,008 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-01-12 14:54:43,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:54:43,015 INFO L225 Difference]: With dead ends: 1020 [2019-01-12 14:54:43,016 INFO L226 Difference]: Without dead ends: 848 [2019-01-12 14:54:43,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-01-12 14:54:43,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2019-01-12 14:54:43,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 344. [2019-01-12 14:54:43,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-01-12 14:54:43,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 462 transitions. [2019-01-12 14:54:43,085 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 462 transitions. Word has length 57 [2019-01-12 14:54:43,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:54:43,085 INFO L480 AbstractCegarLoop]: Abstraction has 344 states and 462 transitions. [2019-01-12 14:54:43,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 14:54:43,085 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 462 transitions. [2019-01-12 14:54:43,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-12 14:54:43,086 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:54:43,086 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:54:43,089 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:54:43,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:54:43,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1996648126, now seen corresponding path program 1 times [2019-01-12 14:54:43,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:54:43,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:54:43,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:43,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:54:43,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:43,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:54:43,324 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-12 14:54:43,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:54:43,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:54:43,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:54:43,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:54:43,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:54:43,326 INFO L87 Difference]: Start difference. First operand 344 states and 462 transitions. Second operand 5 states. [2019-01-12 14:54:43,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:54:43,530 INFO L93 Difference]: Finished difference Result 752 states and 1013 transitions. [2019-01-12 14:54:43,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 14:54:43,532 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-01-12 14:54:43,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:54:43,533 INFO L225 Difference]: With dead ends: 752 [2019-01-12 14:54:43,533 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 14:54:43,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-12 14:54:43,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 14:54:43,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 14:54:43,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 14:54:43,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 14:54:43,536 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 57 [2019-01-12 14:54:43,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:54:43,537 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 14:54:43,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:54:43,537 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 14:54:43,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 14:54:43,544 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 14:54:43,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:43,813 WARN L181 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 141 [2019-01-12 14:54:43,980 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:44,025 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 108 [2019-01-12 14:54:44,574 WARN L181 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 144 [2019-01-12 14:54:44,896 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:44,914 WARN L181 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 129 [2019-01-12 14:54:44,932 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:44,933 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:44,935 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:45,057 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 123 [2019-01-12 14:54:45,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:45,068 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:45,117 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:45,118 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:45,174 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:45,178 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:45,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:45,408 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 141 [2019-01-12 14:54:45,716 WARN L181 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 144 [2019-01-12 14:54:45,728 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:48,059 WARN L181 SmtUtils]: Spent 2.25 s on a formula simplification. DAG size of input: 139 DAG size of output: 23 [2019-01-12 14:54:48,591 WARN L181 SmtUtils]: Spent 528.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 24 [2019-01-12 14:54:48,948 WARN L181 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 29 [2019-01-12 14:54:49,223 WARN L181 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 24 [2019-01-12 14:54:49,552 WARN L181 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 16 [2019-01-12 14:54:50,207 WARN L181 SmtUtils]: Spent 651.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 23 [2019-01-12 14:54:50,934 WARN L181 SmtUtils]: Spent 556.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 23 [2019-01-12 14:54:51,385 WARN L181 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 25 [2019-01-12 14:54:51,552 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 14 [2019-01-12 14:54:51,717 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 25 [2019-01-12 14:54:51,834 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 24 [2019-01-12 14:54:52,423 WARN L181 SmtUtils]: Spent 584.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 22 [2019-01-12 14:54:53,150 WARN L181 SmtUtils]: Spent 645.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 23 [2019-01-12 14:54:53,393 WARN L181 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 29 [2019-01-12 14:54:53,400 INFO L448 ceAbstractionStarter]: For program point L927(lines 927 931) no Hoare annotation was computed. [2019-01-12 14:54:53,401 INFO L448 ceAbstractionStarter]: For program point L334(lines 334 338) no Hoare annotation was computed. [2019-01-12 14:54:53,401 INFO L448 ceAbstractionStarter]: For program point L334-2(lines 334 338) no Hoare annotation was computed. [2019-01-12 14:54:53,401 INFO L448 ceAbstractionStarter]: For program point L334-3(lines 334 338) no Hoare annotation was computed. [2019-01-12 14:54:53,401 INFO L448 ceAbstractionStarter]: For program point L334-5(lines 334 338) no Hoare annotation was computed. [2019-01-12 14:54:53,401 INFO L444 ceAbstractionStarter]: At program point L136(lines 136 142) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_valid_product_#res| 1)) (.cse1 (= ULTIMATE.start_main_~tmp~7 1)) (.cse2 (= ULTIMATE.start_test_~splverifierCounter~0 0))) (or (and .cse0 (<= 2 ~waterLevel~0) .cse1 (and .cse2 (not (= 0 ~systemActive~0)))) (and (and .cse0 .cse1 (and .cse2 (= ~pumpRunning~0 0))) (<= 1 ~waterLevel~0)))) [2019-01-12 14:54:53,401 INFO L448 ceAbstractionStarter]: For program point L334-6(lines 334 338) no Hoare annotation was computed. [2019-01-12 14:54:53,401 INFO L444 ceAbstractionStarter]: At program point L103(lines 54 104) the Hoare annotation is: false [2019-01-12 14:54:53,402 INFO L444 ceAbstractionStarter]: At program point L136-1(lines 136 142) the Hoare annotation is: false [2019-01-12 14:54:53,402 INFO L448 ceAbstractionStarter]: For program point L334-8(lines 334 338) no Hoare annotation was computed. [2019-01-12 14:54:53,402 INFO L444 ceAbstractionStarter]: At program point L136-2(lines 136 142) the Hoare annotation is: false [2019-01-12 14:54:53,402 INFO L448 ceAbstractionStarter]: For program point L334-9(lines 334 338) no Hoare annotation was computed. [2019-01-12 14:54:53,402 INFO L444 ceAbstractionStarter]: At program point L995(lines 990 998) the Hoare annotation is: (and (= |ULTIMATE.start_valid_product_#res| 1) (= 0 |ULTIMATE.start_isLowWaterSensorDry_#res|) (= ULTIMATE.start_main_~tmp~7 1) (= ULTIMATE.start_test_~splverifierCounter~0 0) (<= 1 ~waterLevel~0) (not (= 0 ~systemActive~0))) [2019-01-12 14:54:53,402 INFO L448 ceAbstractionStarter]: For program point L334-11(lines 334 338) no Hoare annotation was computed. [2019-01-12 14:54:53,402 INFO L444 ceAbstractionStarter]: At program point L995-1(lines 990 998) the Hoare annotation is: false [2019-01-12 14:54:53,402 INFO L448 ceAbstractionStarter]: For program point L334-12(lines 334 338) no Hoare annotation was computed. [2019-01-12 14:54:53,402 INFO L444 ceAbstractionStarter]: At program point L995-2(lines 990 998) the Hoare annotation is: false [2019-01-12 14:54:53,403 INFO L444 ceAbstractionStarter]: At program point L995-3(lines 990 998) the Hoare annotation is: false [2019-01-12 14:54:53,403 INFO L448 ceAbstractionStarter]: For program point L334-14(lines 334 338) no Hoare annotation was computed. [2019-01-12 14:54:53,403 INFO L444 ceAbstractionStarter]: At program point L995-4(lines 990 998) the Hoare annotation is: false [2019-01-12 14:54:53,403 INFO L448 ceAbstractionStarter]: For program point L334-15(lines 334 338) no Hoare annotation was computed. [2019-01-12 14:54:53,403 INFO L444 ceAbstractionStarter]: At program point L995-5(lines 990 998) the Hoare annotation is: false [2019-01-12 14:54:53,403 INFO L448 ceAbstractionStarter]: For program point L334-17(lines 334 338) no Hoare annotation was computed. [2019-01-12 14:54:53,403 INFO L448 ceAbstractionStarter]: For program point L370(lines 370 383) no Hoare annotation was computed. [2019-01-12 14:54:53,403 INFO L444 ceAbstractionStarter]: At program point L370-1(lines 1 998) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_valid_product_#res| 1)) (.cse2 (= ULTIMATE.start_main_~tmp~7 1)) (.cse1 (= ULTIMATE.start_test_~splverifierCounter~0 0))) (or (and .cse0 (and .cse1 (not (= 0 ~systemActive~0))) (<= 2 ~waterLevel~0) .cse2 (<= 2 ULTIMATE.start___utac_acc__Specification4_spec__1_~tmp~6) (<= 2 |ULTIMATE.start_getWaterLevel_#res|)) (and .cse0 .cse2 .cse1 (<= 1 ~waterLevel~0) (= ~pumpRunning~0 0)))) [2019-01-12 14:54:53,403 INFO L448 ceAbstractionStarter]: For program point L370-2(lines 370 383) no Hoare annotation was computed. [2019-01-12 14:54:53,404 INFO L444 ceAbstractionStarter]: At program point L370-3(lines 1 998) the Hoare annotation is: false [2019-01-12 14:54:53,404 INFO L448 ceAbstractionStarter]: For program point L370-4(lines 370 383) no Hoare annotation was computed. [2019-01-12 14:54:53,404 INFO L444 ceAbstractionStarter]: At program point L370-5(lines 1 998) the Hoare annotation is: false [2019-01-12 14:54:53,404 INFO L448 ceAbstractionStarter]: For program point L75(lines 75 81) no Hoare annotation was computed. [2019-01-12 14:54:53,404 INFO L444 ceAbstractionStarter]: At program point L75-1(lines 75 81) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_valid_product_#res| 1)) (.cse2 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse1 (= ULTIMATE.start_main_~tmp~7 1))) (or (and (and .cse0 .cse1 (and .cse2 (= ~pumpRunning~0 0))) (<= 1 ~waterLevel~0)) (and .cse0 (and .cse2 (not (= 0 ~systemActive~0))) (<= 2 ~waterLevel~0) .cse1))) [2019-01-12 14:54:53,404 INFO L444 ceAbstractionStarter]: At program point L340(lines 325 343) the Hoare annotation is: (and (= |ULTIMATE.start_valid_product_#res| 1) (= 0 |ULTIMATE.start_isLowWaterSensorDry_#res|) (= ULTIMATE.start_main_~tmp~7 1) (= ULTIMATE.start_test_~splverifierCounter~0 0) (= 1 ULTIMATE.start_isLowWaterLevel_~tmp___0~2) (= 0 ULTIMATE.start_isLowWaterLevel_~tmp~5) (= 1 |ULTIMATE.start_isLowWaterLevel_#res|) (<= 1 ~waterLevel~0) (not (= 0 ~systemActive~0))) [2019-01-12 14:54:53,404 INFO L444 ceAbstractionStarter]: At program point L340-1(lines 325 343) the Hoare annotation is: false [2019-01-12 14:54:53,404 INFO L444 ceAbstractionStarter]: At program point L340-2(lines 325 343) the Hoare annotation is: false [2019-01-12 14:54:53,405 INFO L444 ceAbstractionStarter]: At program point L340-3(lines 325 343) the Hoare annotation is: false [2019-01-12 14:54:53,405 INFO L444 ceAbstractionStarter]: At program point L340-4(lines 325 343) the Hoare annotation is: false [2019-01-12 14:54:53,405 INFO L444 ceAbstractionStarter]: At program point L340-5(lines 325 343) the Hoare annotation is: false [2019-01-12 14:54:53,405 INFO L448 ceAbstractionStarter]: For program point L374(lines 374 380) no Hoare annotation was computed. [2019-01-12 14:54:53,405 INFO L448 ceAbstractionStarter]: For program point L374-2(lines 374 380) no Hoare annotation was computed. [2019-01-12 14:54:53,405 INFO L448 ceAbstractionStarter]: For program point L374-4(lines 374 380) no Hoare annotation was computed. [2019-01-12 14:54:53,405 INFO L448 ceAbstractionStarter]: For program point L903(lines 903 907) no Hoare annotation was computed. [2019-01-12 14:54:53,405 INFO L448 ceAbstractionStarter]: For program point L903-3(lines 903 907) no Hoare annotation was computed. [2019-01-12 14:54:53,405 INFO L448 ceAbstractionStarter]: For program point L903-6(lines 903 907) no Hoare annotation was computed. [2019-01-12 14:54:53,406 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 430) no Hoare annotation was computed. [2019-01-12 14:54:53,406 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 430) no Hoare annotation was computed. [2019-01-12 14:54:53,406 INFO L444 ceAbstractionStarter]: At program point L972(lines 967 975) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_valid_product_#res| 1)) (.cse2 (= ULTIMATE.start_main_~tmp~7 1)) (.cse1 (= ULTIMATE.start_test_~splverifierCounter~0 0))) (or (and .cse0 (and .cse1 (not (= 0 ~systemActive~0))) (<= 2 ~waterLevel~0) .cse2 (<= 2 |ULTIMATE.start_getWaterLevel_#res|)) (and (and .cse0 .cse2 .cse1 (= ~pumpRunning~0 0)) (<= 1 ~waterLevel~0)))) [2019-01-12 14:54:53,406 INFO L444 ceAbstractionStarter]: At program point L972-1(lines 967 975) the Hoare annotation is: false [2019-01-12 14:54:53,406 INFO L444 ceAbstractionStarter]: At program point L972-2(lines 967 975) the Hoare annotation is: false [2019-01-12 14:54:53,406 INFO L448 ceAbstractionStarter]: For program point L213(lines 213 230) no Hoare annotation was computed. [2019-01-12 14:54:53,407 INFO L448 ceAbstractionStarter]: For program point L213-1(lines 213 230) no Hoare annotation was computed. [2019-01-12 14:54:53,407 INFO L448 ceAbstractionStarter]: For program point L213-2(lines 213 230) no Hoare annotation was computed. [2019-01-12 14:54:53,407 INFO L444 ceAbstractionStarter]: At program point L940(lines 935 943) the Hoare annotation is: (and (= |ULTIMATE.start_valid_product_#res| 1) (= ULTIMATE.start_main_~tmp~7 1) (= ULTIMATE.start_test_~splverifierCounter~0 0) (<= 1 ~waterLevel~0) (not (= 0 ~systemActive~0))) [2019-01-12 14:54:53,407 INFO L444 ceAbstractionStarter]: At program point L940-1(lines 935 943) the Hoare annotation is: false [2019-01-12 14:54:53,407 INFO L444 ceAbstractionStarter]: At program point L940-2(lines 935 943) the Hoare annotation is: false [2019-01-12 14:54:53,407 INFO L444 ceAbstractionStarter]: At program point L413(lines 1 998) the Hoare annotation is: (and (= 1 ~systemActive~0) (= 1 ~waterLevel~0) (= ~pumpRunning~0 0)) [2019-01-12 14:54:53,407 INFO L444 ceAbstractionStarter]: At program point L446-2(lines 446 460) the Hoare annotation is: false [2019-01-12 14:54:53,407 INFO L448 ceAbstractionStarter]: For program point L447(line 447) no Hoare annotation was computed. [2019-01-12 14:54:53,407 INFO L448 ceAbstractionStarter]: For program point L348(lines 348 354) no Hoare annotation was computed. [2019-01-12 14:54:53,408 INFO L444 ceAbstractionStarter]: At program point L348-1(lines 348 354) the Hoare annotation is: (and (= |ULTIMATE.start_valid_product_#res| 1) (= ULTIMATE.start_main_~tmp~7 1) (= ULTIMATE.start_test_~splverifierCounter~0 0) (<= 1 ~waterLevel~0) (= ~pumpRunning~0 0)) [2019-01-12 14:54:53,408 INFO L448 ceAbstractionStarter]: For program point L315(lines 315 319) no Hoare annotation was computed. [2019-01-12 14:54:53,408 INFO L448 ceAbstractionStarter]: For program point L315-2(lines 315 319) no Hoare annotation was computed. [2019-01-12 14:54:53,408 INFO L448 ceAbstractionStarter]: For program point L315-3(lines 315 319) no Hoare annotation was computed. [2019-01-12 14:54:53,408 INFO L448 ceAbstractionStarter]: For program point L315-5(lines 315 319) no Hoare annotation was computed. [2019-01-12 14:54:53,408 INFO L448 ceAbstractionStarter]: For program point L315-6(lines 315 319) no Hoare annotation was computed. [2019-01-12 14:54:53,408 INFO L448 ceAbstractionStarter]: For program point L315-8(lines 315 319) no Hoare annotation was computed. [2019-01-12 14:54:53,408 INFO L448 ceAbstractionStarter]: For program point L315-9(lines 315 319) no Hoare annotation was computed. [2019-01-12 14:54:53,408 INFO L448 ceAbstractionStarter]: For program point L315-11(lines 315 319) no Hoare annotation was computed. [2019-01-12 14:54:53,408 INFO L448 ceAbstractionStarter]: For program point L315-12(lines 315 319) no Hoare annotation was computed. [2019-01-12 14:54:53,408 INFO L448 ceAbstractionStarter]: For program point L315-14(lines 315 319) no Hoare annotation was computed. [2019-01-12 14:54:53,409 INFO L448 ceAbstractionStarter]: For program point L315-15(lines 315 319) no Hoare annotation was computed. [2019-01-12 14:54:53,409 INFO L448 ceAbstractionStarter]: For program point L315-17(lines 315 319) no Hoare annotation was computed. [2019-01-12 14:54:53,409 INFO L448 ceAbstractionStarter]: For program point L315-18(lines 315 319) no Hoare annotation was computed. [2019-01-12 14:54:53,409 INFO L448 ceAbstractionStarter]: For program point L315-20(lines 315 319) no Hoare annotation was computed. [2019-01-12 14:54:53,409 INFO L448 ceAbstractionStarter]: For program point L315-21(lines 315 319) no Hoare annotation was computed. [2019-01-12 14:54:53,409 INFO L448 ceAbstractionStarter]: For program point L315-23(lines 315 319) no Hoare annotation was computed. [2019-01-12 14:54:53,409 INFO L448 ceAbstractionStarter]: For program point L315-24(lines 315 319) no Hoare annotation was computed. [2019-01-12 14:54:53,409 INFO L448 ceAbstractionStarter]: For program point L315-26(lines 315 319) no Hoare annotation was computed. [2019-01-12 14:54:53,409 INFO L448 ceAbstractionStarter]: For program point L315-27(lines 315 319) no Hoare annotation was computed. [2019-01-12 14:54:53,409 INFO L448 ceAbstractionStarter]: For program point L315-29(lines 315 319) no Hoare annotation was computed. [2019-01-12 14:54:53,409 INFO L448 ceAbstractionStarter]: For program point L315-30(lines 315 319) no Hoare annotation was computed. [2019-01-12 14:54:53,410 INFO L448 ceAbstractionStarter]: For program point L315-32(lines 315 319) no Hoare annotation was computed. [2019-01-12 14:54:53,410 INFO L448 ceAbstractionStarter]: For program point L315-33(lines 315 319) no Hoare annotation was computed. [2019-01-12 14:54:53,410 INFO L448 ceAbstractionStarter]: For program point L217(lines 217 225) no Hoare annotation was computed. [2019-01-12 14:54:53,410 INFO L448 ceAbstractionStarter]: For program point L217-1(lines 217 225) no Hoare annotation was computed. [2019-01-12 14:54:53,410 INFO L448 ceAbstractionStarter]: For program point L315-35(lines 315 319) no Hoare annotation was computed. [2019-01-12 14:54:53,410 INFO L448 ceAbstractionStarter]: For program point L217-2(lines 217 225) no Hoare annotation was computed. [2019-01-12 14:54:53,410 INFO L448 ceAbstractionStarter]: For program point L85(lines 85 98) no Hoare annotation was computed. [2019-01-12 14:54:53,410 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 14:54:53,410 INFO L448 ceAbstractionStarter]: For program point L450(lines 450 454) no Hoare annotation was computed. [2019-01-12 14:54:53,410 INFO L448 ceAbstractionStarter]: For program point L450-1(lines 129 135) no Hoare annotation was computed. [2019-01-12 14:54:53,411 INFO L448 ceAbstractionStarter]: For program point L517(lines 517 524) no Hoare annotation was computed. [2019-01-12 14:54:53,411 INFO L451 ceAbstractionStarter]: At program point L517-1(lines 517 524) the Hoare annotation is: true [2019-01-12 14:54:53,411 INFO L448 ceAbstractionStarter]: For program point L187(lines 187 204) no Hoare annotation was computed. [2019-01-12 14:54:53,411 INFO L448 ceAbstractionStarter]: For program point L187-1(lines 187 204) no Hoare annotation was computed. [2019-01-12 14:54:53,411 INFO L448 ceAbstractionStarter]: For program point L187-2(lines 187 204) no Hoare annotation was computed. [2019-01-12 14:54:53,411 INFO L448 ceAbstractionStarter]: For program point L187-3(lines 187 204) no Hoare annotation was computed. [2019-01-12 14:54:53,411 INFO L448 ceAbstractionStarter]: For program point L187-4(lines 187 204) no Hoare annotation was computed. [2019-01-12 14:54:53,411 INFO L448 ceAbstractionStarter]: For program point L187-5(lines 187 204) no Hoare annotation was computed. [2019-01-12 14:54:53,411 INFO L448 ceAbstractionStarter]: For program point L980(lines 980 986) no Hoare annotation was computed. [2019-01-12 14:54:53,411 INFO L448 ceAbstractionStarter]: For program point L980-1(lines 980 986) no Hoare annotation was computed. [2019-01-12 14:54:53,411 INFO L448 ceAbstractionStarter]: For program point L980-2(lines 980 986) no Hoare annotation was computed. [2019-01-12 14:54:53,412 INFO L448 ceAbstractionStarter]: For program point L980-3(lines 980 986) no Hoare annotation was computed. [2019-01-12 14:54:53,412 INFO L448 ceAbstractionStarter]: For program point L980-4(lines 980 986) no Hoare annotation was computed. [2019-01-12 14:54:53,412 INFO L448 ceAbstractionStarter]: For program point L980-5(lines 980 986) no Hoare annotation was computed. [2019-01-12 14:54:53,412 INFO L448 ceAbstractionStarter]: For program point L980-6(lines 980 986) no Hoare annotation was computed. [2019-01-12 14:54:53,412 INFO L448 ceAbstractionStarter]: For program point L980-7(lines 980 986) no Hoare annotation was computed. [2019-01-12 14:54:53,412 INFO L448 ceAbstractionStarter]: For program point L980-8(lines 980 986) no Hoare annotation was computed. [2019-01-12 14:54:53,412 INFO L448 ceAbstractionStarter]: For program point L980-9(lines 980 986) no Hoare annotation was computed. [2019-01-12 14:54:53,412 INFO L448 ceAbstractionStarter]: For program point L980-10(lines 980 986) no Hoare annotation was computed. [2019-01-12 14:54:53,412 INFO L448 ceAbstractionStarter]: For program point L980-11(lines 980 986) no Hoare annotation was computed. [2019-01-12 14:54:53,412 INFO L448 ceAbstractionStarter]: For program point L56(lines 55 102) no Hoare annotation was computed. [2019-01-12 14:54:53,413 INFO L448 ceAbstractionStarter]: For program point L915(lines 915 919) no Hoare annotation was computed. [2019-01-12 14:54:53,413 INFO L444 ceAbstractionStarter]: At program point L321(lines 306 324) the Hoare annotation is: false [2019-01-12 14:54:53,413 INFO L444 ceAbstractionStarter]: At program point L321-1(lines 306 324) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_valid_product_#res| 1)) (.cse1 (= ULTIMATE.start_main_~tmp~7 1)) (.cse2 (and (= ULTIMATE.start_test_~splverifierCounter~0 0) (not (= 0 ~systemActive~0)))) (.cse3 (= ~pumpRunning~0 0))) (or (and (and (= 0 |ULTIMATE.start_isHighWaterLevel_#res|) .cse0 (not (= 0 ULTIMATE.start_isHighWaterLevel_~tmp~4)) .cse1 (= 0 ULTIMATE.start_isHighWaterLevel_~tmp___0~1) .cse2 .cse3) (<= 1 ~waterLevel~0)) (and .cse0 (<= 2 ~waterLevel~0) .cse1 .cse2 .cse3))) [2019-01-12 14:54:53,413 INFO L444 ceAbstractionStarter]: At program point L321-2(lines 306 324) the Hoare annotation is: false [2019-01-12 14:54:53,413 INFO L444 ceAbstractionStarter]: At program point L321-3(lines 306 324) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_valid_product_#res| 1)) (.cse1 (= ULTIMATE.start_main_~tmp~7 1)) (.cse2 (and (= ULTIMATE.start_test_~splverifierCounter~0 0) (not (= 0 ~systemActive~0)))) (.cse3 (= ~pumpRunning~0 0))) (or (and (and (= 0 |ULTIMATE.start_isHighWaterLevel_#res|) .cse0 (not (= 0 ULTIMATE.start_isHighWaterLevel_~tmp~4)) .cse1 (= 0 ULTIMATE.start_isHighWaterLevel_~tmp___0~1) .cse2 .cse3) (<= 1 ~waterLevel~0)) (and .cse0 (<= 2 ~waterLevel~0) .cse1 .cse2 .cse3))) [2019-01-12 14:54:53,413 INFO L444 ceAbstractionStarter]: At program point L321-4(lines 306 324) the Hoare annotation is: false [2019-01-12 14:54:53,413 INFO L444 ceAbstractionStarter]: At program point L321-5(lines 306 324) the Hoare annotation is: false [2019-01-12 14:54:53,413 INFO L444 ceAbstractionStarter]: At program point L321-6(lines 306 324) the Hoare annotation is: false [2019-01-12 14:54:53,414 INFO L444 ceAbstractionStarter]: At program point L321-7(lines 306 324) the Hoare annotation is: false [2019-01-12 14:54:53,414 INFO L448 ceAbstractionStarter]: For program point L57(lines 57 61) no Hoare annotation was computed. [2019-01-12 14:54:53,414 INFO L444 ceAbstractionStarter]: At program point L321-8(lines 306 324) the Hoare annotation is: false [2019-01-12 14:54:53,414 INFO L444 ceAbstractionStarter]: At program point L321-9(lines 306 324) the Hoare annotation is: false [2019-01-12 14:54:53,414 INFO L444 ceAbstractionStarter]: At program point L321-10(lines 306 324) the Hoare annotation is: false [2019-01-12 14:54:53,414 INFO L444 ceAbstractionStarter]: At program point L321-11(lines 306 324) the Hoare annotation is: false [2019-01-12 14:54:53,414 INFO L444 ceAbstractionStarter]: At program point L421(lines 416 424) the Hoare annotation is: (and (= 1 ~systemActive~0) (= 1 ~waterLevel~0) (= |ULTIMATE.start_valid_product_#res| ~systemActive~0) (= ~pumpRunning~0 0)) [2019-01-12 14:54:53,414 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 14:54:53,414 INFO L448 ceAbstractionStarter]: For program point L91(lines 91 97) no Hoare annotation was computed. [2019-01-12 14:54:53,415 INFO L444 ceAbstractionStarter]: At program point L91-1(lines 129 135) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_valid_product_#res| 1)) (.cse2 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse1 (= ULTIMATE.start_main_~tmp~7 1))) (or (and (and .cse0 .cse1 (and .cse2 (= ~pumpRunning~0 0))) (<= 1 ~waterLevel~0)) (and .cse0 (and .cse2 (not (= 0 ~systemActive~0))) (<= 2 ~waterLevel~0) .cse1))) [2019-01-12 14:54:53,415 INFO L444 ceAbstractionStarter]: At program point L257(lines 250 260) the Hoare annotation is: (and (= |ULTIMATE.start_valid_product_#res| 1) (= ULTIMATE.start_main_~tmp~7 1) (= ULTIMATE.start_test_~splverifierCounter~0 0) (<= 1 ~waterLevel~0) (not (= 0 ~systemActive~0))) [2019-01-12 14:54:53,415 INFO L444 ceAbstractionStarter]: At program point L257-1(lines 250 260) the Hoare annotation is: false [2019-01-12 14:54:53,415 INFO L448 ceAbstractionStarter]: For program point L191(lines 191 199) no Hoare annotation was computed. [2019-01-12 14:54:53,415 INFO L444 ceAbstractionStarter]: At program point L257-2(lines 250 260) the Hoare annotation is: false [2019-01-12 14:54:53,415 INFO L448 ceAbstractionStarter]: For program point L191-1(lines 191 199) no Hoare annotation was computed. [2019-01-12 14:54:53,415 INFO L448 ceAbstractionStarter]: For program point L191-2(lines 191 199) no Hoare annotation was computed. [2019-01-12 14:54:53,415 INFO L448 ceAbstractionStarter]: For program point L191-3(lines 191 199) no Hoare annotation was computed. [2019-01-12 14:54:53,415 INFO L448 ceAbstractionStarter]: For program point L191-4(lines 191 199) no Hoare annotation was computed. [2019-01-12 14:54:53,415 INFO L448 ceAbstractionStarter]: For program point L191-5(lines 191 199) no Hoare annotation was computed. [2019-01-12 14:54:53,416 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 430) no Hoare annotation was computed. [2019-01-12 14:54:53,416 INFO L444 ceAbstractionStarter]: At program point L985(lines 976 989) the Hoare annotation is: false [2019-01-12 14:54:53,416 INFO L444 ceAbstractionStarter]: At program point L985-1(lines 976 989) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_valid_product_#res| 1)) (.cse1 (= ULTIMATE.start_main_~tmp~7 1)) (.cse2 (and (= ULTIMATE.start_test_~splverifierCounter~0 0) (not (= 0 ~systemActive~0)))) (.cse3 (= ~pumpRunning~0 0))) (or (and (<= 1 ~waterLevel~0) (and .cse0 (not (= 0 |ULTIMATE.start_isHighWaterSensorDry_#res|)) .cse1 .cse2 .cse3)) (and .cse0 (<= 2 ~waterLevel~0) .cse1 .cse2 .cse3))) [2019-01-12 14:54:53,416 INFO L444 ceAbstractionStarter]: At program point L985-2(lines 976 989) the Hoare annotation is: false [2019-01-12 14:54:53,416 INFO L444 ceAbstractionStarter]: At program point L985-3(lines 976 989) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_valid_product_#res| 1)) (.cse1 (= ULTIMATE.start_main_~tmp~7 1)) (.cse2 (and (= ULTIMATE.start_test_~splverifierCounter~0 0) (not (= 0 ~systemActive~0)))) (.cse3 (= ~pumpRunning~0 0))) (or (and .cse0 (not (= 0 |ULTIMATE.start_isHighWaterSensorDry_#res|)) .cse1 .cse2 (<= 1 ~waterLevel~0) .cse3) (and .cse0 (<= 2 ~waterLevel~0) .cse1 .cse2 .cse3))) [2019-01-12 14:54:53,416 INFO L444 ceAbstractionStarter]: At program point L985-4(lines 976 989) the Hoare annotation is: false [2019-01-12 14:54:53,416 INFO L444 ceAbstractionStarter]: At program point L985-5(lines 976 989) the Hoare annotation is: false [2019-01-12 14:54:53,416 INFO L444 ceAbstractionStarter]: At program point L985-6(lines 976 989) the Hoare annotation is: false [2019-01-12 14:54:53,417 INFO L444 ceAbstractionStarter]: At program point L985-7(lines 976 989) the Hoare annotation is: false [2019-01-12 14:54:53,417 INFO L444 ceAbstractionStarter]: At program point L985-8(lines 976 989) the Hoare annotation is: false [2019-01-12 14:54:53,417 INFO L444 ceAbstractionStarter]: At program point L985-9(lines 976 989) the Hoare annotation is: false [2019-01-12 14:54:53,417 INFO L444 ceAbstractionStarter]: At program point L985-10(lines 976 989) the Hoare annotation is: false [2019-01-12 14:54:53,417 INFO L444 ceAbstractionStarter]: At program point L985-11(lines 976 989) the Hoare annotation is: false [2019-01-12 14:54:53,417 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 14:54:53,417 INFO L448 ceAbstractionStarter]: For program point L161(lines 161 178) no Hoare annotation was computed. [2019-01-12 14:54:53,417 INFO L448 ceAbstractionStarter]: For program point L161-1(lines 161 178) no Hoare annotation was computed. [2019-01-12 14:54:53,417 INFO L448 ceAbstractionStarter]: For program point L161-2(lines 161 178) no Hoare annotation was computed. [2019-01-12 14:54:53,417 INFO L448 ceAbstractionStarter]: For program point L161-3(lines 161 178) no Hoare annotation was computed. [2019-01-12 14:54:53,417 INFO L448 ceAbstractionStarter]: For program point L161-4(lines 161 178) no Hoare annotation was computed. [2019-01-12 14:54:53,418 INFO L448 ceAbstractionStarter]: For program point L161-5(lines 161 178) no Hoare annotation was computed. [2019-01-12 14:54:53,418 INFO L448 ceAbstractionStarter]: For program point L161-6(lines 161 178) no Hoare annotation was computed. [2019-01-12 14:54:53,418 INFO L448 ceAbstractionStarter]: For program point L161-7(lines 161 178) no Hoare annotation was computed. [2019-01-12 14:54:53,418 INFO L448 ceAbstractionStarter]: For program point L161-8(lines 161 178) no Hoare annotation was computed. [2019-01-12 14:54:53,418 INFO L448 ceAbstractionStarter]: For program point L161-9(lines 161 178) no Hoare annotation was computed. [2019-01-12 14:54:53,418 INFO L448 ceAbstractionStarter]: For program point L161-10(lines 161 178) no Hoare annotation was computed. [2019-01-12 14:54:53,418 INFO L448 ceAbstractionStarter]: For program point L161-11(lines 161 178) no Hoare annotation was computed. [2019-01-12 14:54:53,418 INFO L444 ceAbstractionStarter]: At program point L129(lines 128 147) the Hoare annotation is: (let ((.cse1 (= |ULTIMATE.start_valid_product_#res| 1)) (.cse3 (= ULTIMATE.start_main_~tmp~7 1)) (.cse2 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse0 (<= 1 ~waterLevel~0))) (or (and .cse0 (and .cse1 (and .cse2 (not (= 0 ~systemActive~0))) .cse3)) (and (and .cse1 .cse3 (and .cse2 (= ~pumpRunning~0 0))) .cse0))) [2019-01-12 14:54:53,418 INFO L448 ceAbstractionStarter]: For program point L129-1(lines 129 135) no Hoare annotation was computed. [2019-01-12 14:54:53,418 INFO L444 ceAbstractionStarter]: At program point L129-2(lines 128 147) the Hoare annotation is: false [2019-01-12 14:54:53,418 INFO L444 ceAbstractionStarter]: At program point L129-3(lines 128 147) the Hoare annotation is: false [2019-01-12 14:54:53,419 INFO L451 ceAbstractionStarter]: At program point L526(lines 507 529) the Hoare annotation is: true [2019-01-12 14:54:53,419 INFO L444 ceAbstractionStarter]: At program point L494(lines 490 496) the Hoare annotation is: (and (= ULTIMATE.start_main_~tmp~7 ~systemActive~0) (= ULTIMATE.start_main_~tmp~7 1) (= 1 ~waterLevel~0) (= |ULTIMATE.start_valid_product_#res| ~systemActive~0) (= ~pumpRunning~0 0)) [2019-01-12 14:54:53,419 INFO L448 ceAbstractionStarter]: For program point L65(lines 65 71) no Hoare annotation was computed. [2019-01-12 14:54:53,419 INFO L444 ceAbstractionStarter]: At program point L65-1(lines 65 71) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_valid_product_#res| 1)) (.cse2 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse1 (= ULTIMATE.start_main_~tmp~7 1))) (or (and (and .cse0 .cse1 (and .cse2 (= ~pumpRunning~0 0))) (<= 1 ~waterLevel~0)) (and .cse0 (and .cse2 (not (= 0 ~systemActive~0))) (<= 2 ~waterLevel~0) .cse1))) [2019-01-12 14:54:53,419 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 14:54:53,419 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 173) no Hoare annotation was computed. [2019-01-12 14:54:53,419 INFO L448 ceAbstractionStarter]: For program point L165-1(lines 165 173) no Hoare annotation was computed. [2019-01-12 14:54:53,419 INFO L448 ceAbstractionStarter]: For program point L165-2(lines 165 173) no Hoare annotation was computed. [2019-01-12 14:54:53,419 INFO L448 ceAbstractionStarter]: For program point L165-3(lines 165 173) no Hoare annotation was computed. [2019-01-12 14:54:53,419 INFO L448 ceAbstractionStarter]: For program point L165-4(lines 165 173) no Hoare annotation was computed. [2019-01-12 14:54:53,420 INFO L448 ceAbstractionStarter]: For program point L165-5(lines 165 173) no Hoare annotation was computed. [2019-01-12 14:54:53,420 INFO L448 ceAbstractionStarter]: For program point L165-6(lines 165 173) no Hoare annotation was computed. [2019-01-12 14:54:53,420 INFO L448 ceAbstractionStarter]: For program point L165-7(lines 165 173) no Hoare annotation was computed. [2019-01-12 14:54:53,420 INFO L448 ceAbstractionStarter]: For program point L165-8(lines 165 173) no Hoare annotation was computed. [2019-01-12 14:54:53,420 INFO L448 ceAbstractionStarter]: For program point L165-9(lines 165 173) no Hoare annotation was computed. [2019-01-12 14:54:53,420 INFO L448 ceAbstractionStarter]: For program point L165-10(lines 165 173) no Hoare annotation was computed. [2019-01-12 14:54:53,420 INFO L448 ceAbstractionStarter]: For program point L165-11(lines 165 173) no Hoare annotation was computed. [2019-01-12 14:54:53,420 INFO L448 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2019-01-12 14:54:53,420 INFO L448 ceAbstractionStarter]: For program point L430-1(line 430) no Hoare annotation was computed. [2019-01-12 14:54:53,420 INFO L448 ceAbstractionStarter]: For program point L430-2(line 430) no Hoare annotation was computed. [2019-01-12 14:54:53,420 INFO L444 ceAbstractionStarter]: At program point L266(lines 261 269) the Hoare annotation is: (and (= |ULTIMATE.start_valid_product_#res| 1) (= 0 |ULTIMATE.start_isPumpRunning_#res|) (= ULTIMATE.start_main_~tmp~7 1) (= ULTIMATE.start_test_~splverifierCounter~0 0) (<= 1 ~waterLevel~0) (= ~pumpRunning~0 0)) [2019-01-12 14:54:53,421 INFO L444 ceAbstractionStarter]: At program point L266-1(lines 261 269) the Hoare annotation is: false [2019-01-12 14:54:53,421 INFO L444 ceAbstractionStarter]: At program point L266-2(lines 261 269) the Hoare annotation is: false [2019-01-12 14:54:53,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 02:54:53 BoogieIcfgContainer [2019-01-12 14:54:53,486 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 14:54:53,486 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 14:54:53,486 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 14:54:53,487 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 14:54:53,487 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:54:33" (3/4) ... [2019-01-12 14:54:53,494 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 14:54:53,547 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 38 nodes and edges [2019-01-12 14:54:53,550 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2019-01-12 14:54:53,552 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-01-12 14:54:53,554 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-12 14:54:53,556 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 14:54:53,558 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-12 14:54:53,594 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((1 == systemActive && 1 == waterLevel) && \result == systemActive) && pumpRunning == 0 [2019-01-12 14:54:53,595 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((tmp == systemActive && tmp == 1) && 1 == waterLevel) && \result == systemActive) && pumpRunning == 0 [2019-01-12 14:54:53,595 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\result == 1 && splverifierCounter == 0 && !(0 == systemActive)) && 2 <= waterLevel) && tmp == 1) && 2 <= tmp) && 2 <= \result) || ((((\result == 1 && tmp == 1) && splverifierCounter == 0) && 1 <= waterLevel) && pumpRunning == 0) [2019-01-12 14:54:53,596 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result == 1 && tmp == 1) && splverifierCounter == 0 && pumpRunning == 0) && 1 <= waterLevel) || (((\result == 1 && splverifierCounter == 0 && !(0 == systemActive)) && 2 <= waterLevel) && tmp == 1) [2019-01-12 14:54:53,597 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result == 1 && tmp == 1) && splverifierCounter == 0 && pumpRunning == 0) && 1 <= waterLevel) || (((\result == 1 && splverifierCounter == 0 && !(0 == systemActive)) && 2 <= waterLevel) && tmp == 1) [2019-01-12 14:54:53,598 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result == 1 && tmp == 1) && splverifierCounter == 0 && pumpRunning == 0) && 1 <= waterLevel) || (((\result == 1 && splverifierCounter == 0 && !(0 == systemActive)) && 2 <= waterLevel) && tmp == 1) [2019-01-12 14:54:53,598 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (1 <= waterLevel && (\result == 1 && splverifierCounter == 0 && !(0 == systemActive)) && tmp == 1) || (((\result == 1 && tmp == 1) && splverifierCounter == 0 && pumpRunning == 0) && 1 <= waterLevel) [2019-01-12 14:54:53,598 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result == 1 && 2 <= waterLevel) && tmp == 1) && splverifierCounter == 0 && !(0 == systemActive)) || (((\result == 1 && tmp == 1) && splverifierCounter == 0 && pumpRunning == 0) && 1 <= waterLevel) [2019-01-12 14:54:53,600 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result == 1 && tmp == 1) && splverifierCounter == 0) && 1 <= waterLevel) && pumpRunning == 0 [2019-01-12 14:54:53,602 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\result == 1 && splverifierCounter == 0 && !(0 == systemActive)) && 2 <= waterLevel) && tmp == 1) && 2 <= \result) || ((((\result == 1 && tmp == 1) && splverifierCounter == 0) && pumpRunning == 0) && 1 <= waterLevel) [2019-01-12 14:54:53,603 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result == 1 && tmp == 1) && splverifierCounter == 0) && 1 <= waterLevel) && !(0 == systemActive) [2019-01-12 14:54:53,604 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result == 1 && tmp == 1) && splverifierCounter == 0) && 1 <= waterLevel) && !(0 == systemActive) [2019-01-12 14:54:53,605 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\result == 1 && 0 == \result) && tmp == 1) && splverifierCounter == 0) && 1 <= waterLevel) && pumpRunning == 0 [2019-01-12 14:54:53,606 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\result == 1 && !(0 == \result)) && tmp == 1) && splverifierCounter == 0 && !(0 == systemActive)) && 1 <= waterLevel) && pumpRunning == 0) || ((((\result == 1 && 2 <= waterLevel) && tmp == 1) && splverifierCounter == 0 && !(0 == systemActive)) && pumpRunning == 0) [2019-01-12 14:54:53,608 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((0 == \result && \result == 1) && !(0 == tmp)) && tmp == 1) && 0 == tmp___0) && splverifierCounter == 0 && !(0 == systemActive)) && pumpRunning == 0) && 1 <= waterLevel) || ((((\result == 1 && 2 <= waterLevel) && tmp == 1) && splverifierCounter == 0 && !(0 == systemActive)) && pumpRunning == 0) [2019-01-12 14:54:53,610 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\result == 1 && 0 == \result) && tmp == 1) && splverifierCounter == 0) && 1 <= waterLevel) && !(0 == systemActive) [2019-01-12 14:54:53,611 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (1 <= waterLevel && (((\result == 1 && !(0 == \result)) && tmp == 1) && splverifierCounter == 0 && !(0 == systemActive)) && pumpRunning == 0) || ((((\result == 1 && 2 <= waterLevel) && tmp == 1) && splverifierCounter == 0 && !(0 == systemActive)) && pumpRunning == 0) [2019-01-12 14:54:53,612 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((\result == 1 && 0 == \result) && tmp == 1) && splverifierCounter == 0) && 1 == tmp___0) && 0 == tmp) && 1 == \result) && 1 <= waterLevel) && !(0 == systemActive) [2019-01-12 14:54:53,613 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((0 == \result && \result == 1) && !(0 == tmp)) && tmp == 1) && 0 == tmp___0) && splverifierCounter == 0 && !(0 == systemActive)) && pumpRunning == 0) && 1 <= waterLevel) || ((((\result == 1 && 2 <= waterLevel) && tmp == 1) && splverifierCounter == 0 && !(0 == systemActive)) && pumpRunning == 0) [2019-01-12 14:54:53,750 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 14:54:53,751 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 14:54:53,752 INFO L168 Benchmark]: Toolchain (without parser) took 22496.06 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 371.7 MB). Free memory was 948.7 MB in the beginning and 1.2 GB in the end (delta: -208.8 MB). Peak memory consumption was 162.9 MB. Max. memory is 11.5 GB. [2019-01-12 14:54:53,753 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 14:54:53,754 INFO L168 Benchmark]: CACSL2BoogieTranslator took 663.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -172.8 MB). Peak memory consumption was 38.6 MB. Max. memory is 11.5 GB. [2019-01-12 14:54:53,754 INFO L168 Benchmark]: Boogie Procedure Inliner took 101.91 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-01-12 14:54:53,754 INFO L168 Benchmark]: Boogie Preprocessor took 79.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-12 14:54:53,755 INFO L168 Benchmark]: RCFGBuilder took 1724.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: 72.0 MB). Peak memory consumption was 72.0 MB. Max. memory is 11.5 GB. [2019-01-12 14:54:53,755 INFO L168 Benchmark]: TraceAbstraction took 19656.30 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 229.1 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -143.5 MB). Peak memory consumption was 387.8 MB. Max. memory is 11.5 GB. [2019-01-12 14:54:53,755 INFO L168 Benchmark]: Witness Printer took 264.83 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 22.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 11.5 GB. [2019-01-12 14:54:53,760 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 663.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -172.8 MB). Peak memory consumption was 38.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 101.91 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 79.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1724.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: 72.0 MB). Peak memory consumption was 72.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 19656.30 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 229.1 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -143.5 MB). Peak memory consumption was 387.8 MB. Max. memory is 11.5 GB. * Witness Printer took 264.83 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 22.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 430]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 430]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 430]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: (((\result == 1 && tmp == 1) && splverifierCounter == 0 && pumpRunning == 0) && 1 <= waterLevel) || (((\result == 1 && splverifierCounter == 0 && !(0 == systemActive)) && 2 <= waterLevel) && tmp == 1) - InvariantResult [Line: 507]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 967]: Loop Invariant Derived loop invariant: ((((\result == 1 && splverifierCounter == 0 && !(0 == systemActive)) && 2 <= waterLevel) && tmp == 1) && 2 <= \result) || ((((\result == 1 && tmp == 1) && splverifierCounter == 0) && pumpRunning == 0) && 1 <= waterLevel) - InvariantResult [Line: 306]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 967]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 306]: Loop Invariant Derived loop invariant: (((((((0 == \result && \result == 1) && !(0 == tmp)) && tmp == 1) && 0 == tmp___0) && splverifierCounter == 0 && !(0 == systemActive)) && pumpRunning == 0) && 1 <= waterLevel) || ((((\result == 1 && 2 <= waterLevel) && tmp == 1) && splverifierCounter == 0 && !(0 == systemActive)) && pumpRunning == 0) - InvariantResult [Line: 967]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 306]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 325]: Loop Invariant Derived loop invariant: (((((((\result == 1 && 0 == \result) && tmp == 1) && splverifierCounter == 0) && 1 == tmp___0) && 0 == tmp) && 1 == \result) && 1 <= waterLevel) && !(0 == systemActive) - InvariantResult [Line: 261]: Loop Invariant Derived loop invariant: ((((\result == 1 && 0 == \result) && tmp == 1) && splverifierCounter == 0) && 1 <= waterLevel) && pumpRunning == 0 - InvariantResult [Line: 990]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: (((\result == 1 && tmp == 1) && splverifierCounter == 0 && pumpRunning == 0) && 1 <= waterLevel) || (((\result == 1 && splverifierCounter == 0 && !(0 == systemActive)) && 2 <= waterLevel) && tmp == 1) - InvariantResult [Line: 325]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (1 == systemActive && 1 == waterLevel) && pumpRunning == 0 - InvariantResult [Line: 325]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 446]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 325]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 325]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 325]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 490]: Loop Invariant Derived loop invariant: (((tmp == systemActive && tmp == 1) && 1 == waterLevel) && \result == systemActive) && pumpRunning == 0 - InvariantResult [Line: 976]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 990]: Loop Invariant Derived loop invariant: ((((\result == 1 && 0 == \result) && tmp == 1) && splverifierCounter == 0) && 1 <= waterLevel) && !(0 == systemActive) - InvariantResult [Line: 136]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 990]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 136]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 935]: Loop Invariant Derived loop invariant: (((\result == 1 && tmp == 1) && splverifierCounter == 0) && 1 <= waterLevel) && !(0 == systemActive) - InvariantResult [Line: 990]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 935]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 136]: Loop Invariant Derived loop invariant: (((\result == 1 && 2 <= waterLevel) && tmp == 1) && splverifierCounter == 0 && !(0 == systemActive)) || (((\result == 1 && tmp == 1) && splverifierCounter == 0 && pumpRunning == 0) && 1 <= waterLevel) - InvariantResult [Line: 990]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 128]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 935]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 990]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 976]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 976]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 976]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 976]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((\result == 1 && splverifierCounter == 0 && !(0 == systemActive)) && 2 <= waterLevel) && tmp == 1) && 2 <= tmp) && 2 <= \result) || ((((\result == 1 && tmp == 1) && splverifierCounter == 0) && 1 <= waterLevel) && pumpRunning == 0) - InvariantResult [Line: 348]: Loop Invariant Derived loop invariant: (((\result == 1 && tmp == 1) && splverifierCounter == 0) && 1 <= waterLevel) && pumpRunning == 0 - InvariantResult [Line: 976]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 416]: Loop Invariant Derived loop invariant: ((1 == systemActive && 1 == waterLevel) && \result == systemActive) && pumpRunning == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 976]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 517]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 976]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 976]: Loop Invariant Derived loop invariant: (1 <= waterLevel && (((\result == 1 && !(0 == \result)) && tmp == 1) && splverifierCounter == 0 && !(0 == systemActive)) && pumpRunning == 0) || ((((\result == 1 && 2 <= waterLevel) && tmp == 1) && splverifierCounter == 0 && !(0 == systemActive)) && pumpRunning == 0) - InvariantResult [Line: 976]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 976]: Loop Invariant Derived loop invariant: (((((\result == 1 && !(0 == \result)) && tmp == 1) && splverifierCounter == 0 && !(0 == systemActive)) && 1 <= waterLevel) && pumpRunning == 0) || ((((\result == 1 && 2 <= waterLevel) && tmp == 1) && splverifierCounter == 0 && !(0 == systemActive)) && pumpRunning == 0) - InvariantResult [Line: 976]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 128]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 250]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 250]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 128]: Loop Invariant Derived loop invariant: (1 <= waterLevel && (\result == 1 && splverifierCounter == 0 && !(0 == systemActive)) && tmp == 1) || (((\result == 1 && tmp == 1) && splverifierCounter == 0 && pumpRunning == 0) && 1 <= waterLevel) - InvariantResult [Line: 250]: Loop Invariant Derived loop invariant: (((\result == 1 && tmp == 1) && splverifierCounter == 0) && 1 <= waterLevel) && !(0 == systemActive) - InvariantResult [Line: 306]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 306]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 306]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 306]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 261]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 261]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 75]: Loop Invariant Derived loop invariant: (((\result == 1 && tmp == 1) && splverifierCounter == 0 && pumpRunning == 0) && 1 <= waterLevel) || (((\result == 1 && splverifierCounter == 0 && !(0 == systemActive)) && 2 <= waterLevel) && tmp == 1) - InvariantResult [Line: 306]: Loop Invariant Derived loop invariant: (((((((0 == \result && \result == 1) && !(0 == tmp)) && tmp == 1) && 0 == tmp___0) && splverifierCounter == 0 && !(0 == systemActive)) && pumpRunning == 0) && 1 <= waterLevel) || ((((\result == 1 && 2 <= waterLevel) && tmp == 1) && splverifierCounter == 0 && !(0 == systemActive)) && pumpRunning == 0) - InvariantResult [Line: 306]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 306]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 306]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 306]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 191 locations, 3 error locations. SAFE Result, 19.5s OverallTime, 11 OverallIterations, 2 TraceHistogramMax, 6.5s AutomataDifference, 0.0s DeadEndRemovalTime, 9.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 1591 SDtfs, 2381 SDslu, 2722 SDs, 0 SdLazy, 354 SolverSat, 82 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 89 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=344occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 1219 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 68 LocationsWithAnnotation, 68 PreInvPairs, 253 NumberOfFragments, 684 HoareAnnotationTreeSize, 68 FomulaSimplifications, 437294 FormulaSimplificationTreeSizeReduction, 2.2s HoareSimplificationTime, 68 FomulaSimplificationsInter, 303781 FormulaSimplificationTreeSizeReductionInter, 7.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 341 NumberOfCodeBlocks, 341 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 330 ConstructedInterpolants, 0 QuantifiedInterpolants, 20091 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 28/28 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...