./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec5_product47_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_spec5_product47_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 c5a0b2bcaab730b804e6efb5bb851b66755fb542 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:55:43,242 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 14:55:43,244 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 14:55:43,256 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 14:55:43,257 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 14:55:43,258 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 14:55:43,259 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 14:55:43,262 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 14:55:43,263 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 14:55:43,264 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 14:55:43,266 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 14:55:43,266 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 14:55:43,267 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 14:55:43,268 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 14:55:43,269 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 14:55:43,270 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 14:55:43,271 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 14:55:43,274 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 14:55:43,276 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 14:55:43,278 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 14:55:43,279 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 14:55:43,280 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 14:55:43,283 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 14:55:43,284 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 14:55:43,284 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 14:55:43,285 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 14:55:43,286 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 14:55:43,287 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 14:55:43,288 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 14:55:43,289 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 14:55:43,290 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 14:55:43,290 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 14:55:43,291 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 14:55:43,291 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 14:55:43,292 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 14:55:43,293 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 14:55:43,293 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:55:43,314 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 14:55:43,314 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 14:55:43,316 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 14:55:43,316 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 14:55:43,317 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 14:55:43,317 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 14:55:43,317 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 14:55:43,317 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 14:55:43,317 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 14:55:43,317 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 14:55:43,321 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 14:55:43,322 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 14:55:43,322 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 14:55:43,322 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 14:55:43,322 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 14:55:43,322 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 14:55:43,322 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 14:55:43,323 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 14:55:43,323 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 14:55:43,323 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 14:55:43,323 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 14:55:43,323 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 14:55:43,325 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 14:55:43,325 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 14:55:43,325 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 14:55:43,325 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 14:55:43,325 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 14:55:43,326 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 14:55:43,326 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 -> c5a0b2bcaab730b804e6efb5bb851b66755fb542 [2019-01-12 14:55:43,372 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 14:55:43,385 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 14:55:43,388 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 14:55:43,390 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 14:55:43,390 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 14:55:43,391 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec5_product47_true-unreach-call_false-termination.cil.c [2019-01-12 14:55:43,455 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bf45176c/8cac6986b9624bac87636c385777b8ed/FLAGb3420d09a [2019-01-12 14:55:43,906 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 14:55:43,907 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec5_product47_true-unreach-call_false-termination.cil.c [2019-01-12 14:55:43,920 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bf45176c/8cac6986b9624bac87636c385777b8ed/FLAGb3420d09a [2019-01-12 14:55:44,241 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bf45176c/8cac6986b9624bac87636c385777b8ed [2019-01-12 14:55:44,245 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 14:55:44,247 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 14:55:44,248 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 14:55:44,248 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 14:55:44,255 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 14:55:44,256 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:55:44" (1/1) ... [2019-01-12 14:55:44,259 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60f6c20d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:55:44, skipping insertion in model container [2019-01-12 14:55:44,259 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:55:44" (1/1) ... [2019-01-12 14:55:44,269 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 14:55:44,341 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 14:55:44,676 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:55:44,692 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 14:55:44,789 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:55:44,904 INFO L195 MainTranslator]: Completed translation [2019-01-12 14:55:44,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:55:44 WrapperNode [2019-01-12 14:55:44,905 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 14:55:44,906 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 14:55:44,906 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 14:55:44,906 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 14:55:44,913 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:55:44" (1/1) ... [2019-01-12 14:55:44,931 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:55:44" (1/1) ... [2019-01-12 14:55:44,988 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 14:55:44,989 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 14:55:44,989 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 14:55:44,989 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 14:55:45,004 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:55:44" (1/1) ... [2019-01-12 14:55:45,004 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:55:44" (1/1) ... [2019-01-12 14:55:45,010 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:55:44" (1/1) ... [2019-01-12 14:55:45,010 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:55:44" (1/1) ... [2019-01-12 14:55:45,025 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:55:44" (1/1) ... [2019-01-12 14:55:45,036 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:55:44" (1/1) ... [2019-01-12 14:55:45,040 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:55:44" (1/1) ... [2019-01-12 14:55:45,046 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 14:55:45,047 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 14:55:45,047 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 14:55:45,047 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 14:55:45,048 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:55:44" (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:55:45,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 14:55:45,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-12 14:55:45,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 14:55:45,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 14:55:46,855 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 14:55:46,855 INFO L286 CfgBuilder]: Removed 210 assue(true) statements. [2019-01-12 14:55:46,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:55:46 BoogieIcfgContainer [2019-01-12 14:55:46,858 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 14:55:46,859 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 14:55:46,859 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 14:55:46,863 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 14:55:46,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 02:55:44" (1/3) ... [2019-01-12 14:55:46,865 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8a008f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:55:46, skipping insertion in model container [2019-01-12 14:55:46,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:55:44" (2/3) ... [2019-01-12 14:55:46,866 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8a008f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:55:46, skipping insertion in model container [2019-01-12 14:55:46,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:55:46" (3/3) ... [2019-01-12 14:55:46,869 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec5_product47_true-unreach-call_false-termination.cil.c [2019-01-12 14:55:46,879 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 14:55:46,889 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-12 14:55:46,907 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-12 14:55:46,951 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 14:55:46,952 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 14:55:46,952 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 14:55:46,952 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 14:55:46,953 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 14:55:46,953 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 14:55:46,953 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 14:55:46,953 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 14:55:46,953 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 14:55:46,973 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states. [2019-01-12 14:55:46,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-12 14:55:46,980 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:55:46,981 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:55:46,983 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:55:46,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:55:46,988 INFO L82 PathProgramCache]: Analyzing trace with hash -373537608, now seen corresponding path program 1 times [2019-01-12 14:55:46,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:55:46,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:55:47,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:47,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:55:47,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:47,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:55:47,220 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:55:47,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:55:47,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:55:47,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 14:55:47,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 14:55:47,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 14:55:47,240 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 2 states. [2019-01-12 14:55:47,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:55:47,288 INFO L93 Difference]: Finished difference Result 273 states and 406 transitions. [2019-01-12 14:55:47,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 14:55:47,289 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2019-01-12 14:55:47,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:55:47,308 INFO L225 Difference]: With dead ends: 273 [2019-01-12 14:55:47,308 INFO L226 Difference]: Without dead ends: 136 [2019-01-12 14:55:47,312 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:55:47,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-01-12 14:55:47,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2019-01-12 14:55:47,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-01-12 14:55:47,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 195 transitions. [2019-01-12 14:55:47,365 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 195 transitions. Word has length 19 [2019-01-12 14:55:47,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:55:47,365 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 195 transitions. [2019-01-12 14:55:47,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 14:55:47,366 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 195 transitions. [2019-01-12 14:55:47,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-12 14:55:47,367 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:55:47,367 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] [2019-01-12 14:55:47,368 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:55:47,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:55:47,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1432481945, now seen corresponding path program 1 times [2019-01-12 14:55:47,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:55:47,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:55:47,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:47,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:55:47,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:47,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:55:47,556 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:55:47,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:55:47,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 14:55:47,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:55:47,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:55:47,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:55:47,561 INFO L87 Difference]: Start difference. First operand 136 states and 195 transitions. Second operand 3 states. [2019-01-12 14:55:47,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:55:47,585 INFO L93 Difference]: Finished difference Result 136 states and 195 transitions. [2019-01-12 14:55:47,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:55:47,591 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-01-12 14:55:47,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:55:47,593 INFO L225 Difference]: With dead ends: 136 [2019-01-12 14:55:47,593 INFO L226 Difference]: Without dead ends: 57 [2019-01-12 14:55:47,595 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:55:47,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-12 14:55:47,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-01-12 14:55:47,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-12 14:55:47,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 81 transitions. [2019-01-12 14:55:47,610 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 81 transitions. Word has length 20 [2019-01-12 14:55:47,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:55:47,610 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 81 transitions. [2019-01-12 14:55:47,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:55:47,611 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 81 transitions. [2019-01-12 14:55:47,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-12 14:55:47,612 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:55:47,612 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:55:47,612 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:55:47,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:55:47,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1277815295, now seen corresponding path program 1 times [2019-01-12 14:55:47,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:55:47,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:55:47,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:47,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:55:47,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:47,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:55:47,785 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:55:47,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:55:47,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:55:47,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:55:47,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:55:47,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:55:47,787 INFO L87 Difference]: Start difference. First operand 57 states and 81 transitions. Second operand 3 states. [2019-01-12 14:55:47,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:55:47,860 INFO L93 Difference]: Finished difference Result 157 states and 229 transitions. [2019-01-12 14:55:47,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:55:47,861 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-01-12 14:55:47,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:55:47,862 INFO L225 Difference]: With dead ends: 157 [2019-01-12 14:55:47,862 INFO L226 Difference]: Without dead ends: 107 [2019-01-12 14:55:47,863 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:55:47,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-12 14:55:47,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 103. [2019-01-12 14:55:47,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-12 14:55:47,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 150 transitions. [2019-01-12 14:55:47,888 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 150 transitions. Word has length 26 [2019-01-12 14:55:47,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:55:47,888 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 150 transitions. [2019-01-12 14:55:47,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:55:47,888 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 150 transitions. [2019-01-12 14:55:47,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-12 14:55:47,893 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:55:47,893 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] [2019-01-12 14:55:47,893 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:55:47,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:55:47,894 INFO L82 PathProgramCache]: Analyzing trace with hash 120130499, now seen corresponding path program 1 times [2019-01-12 14:55:47,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:55:47,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:55:47,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:47,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:55:47,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:47,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:55:48,045 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:55:48,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:55:48,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:55:48,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:55:48,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:55:48,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:55:48,050 INFO L87 Difference]: Start difference. First operand 103 states and 150 transitions. Second operand 3 states. [2019-01-12 14:55:48,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:55:48,229 INFO L93 Difference]: Finished difference Result 246 states and 363 transitions. [2019-01-12 14:55:48,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:55:48,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-01-12 14:55:48,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:55:48,232 INFO L225 Difference]: With dead ends: 246 [2019-01-12 14:55:48,232 INFO L226 Difference]: Without dead ends: 150 [2019-01-12 14:55:48,233 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:55:48,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-01-12 14:55:48,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2019-01-12 14:55:48,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-01-12 14:55:48,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 212 transitions. [2019-01-12 14:55:48,252 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 212 transitions. Word has length 28 [2019-01-12 14:55:48,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:55:48,253 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 212 transitions. [2019-01-12 14:55:48,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:55:48,253 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 212 transitions. [2019-01-12 14:55:48,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-12 14:55:48,254 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:55:48,254 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] [2019-01-12 14:55:48,255 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:55:48,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:55:48,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1546294710, now seen corresponding path program 1 times [2019-01-12 14:55:48,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:55:48,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:55:48,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:48,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:55:48,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:48,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:55:48,515 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:55:48,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:55:48,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:55:48,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:55:48,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:55:48,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:55:48,518 INFO L87 Difference]: Start difference. First operand 148 states and 212 transitions. Second operand 5 states. [2019-01-12 14:55:48,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:55:48,932 INFO L93 Difference]: Finished difference Result 523 states and 749 transitions. [2019-01-12 14:55:48,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 14:55:48,933 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-01-12 14:55:48,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:55:48,937 INFO L225 Difference]: With dead ends: 523 [2019-01-12 14:55:48,937 INFO L226 Difference]: Without dead ends: 382 [2019-01-12 14:55:48,938 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:55:48,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-01-12 14:55:48,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 146. [2019-01-12 14:55:48,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-01-12 14:55:48,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 206 transitions. [2019-01-12 14:55:48,995 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 206 transitions. Word has length 29 [2019-01-12 14:55:48,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:55:48,996 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 206 transitions. [2019-01-12 14:55:48,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:55:48,996 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 206 transitions. [2019-01-12 14:55:49,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-12 14:55:49,004 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:55:49,004 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, 1, 1, 1, 1, 1] [2019-01-12 14:55:49,004 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:55:49,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:55:49,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1771234378, now seen corresponding path program 1 times [2019-01-12 14:55:49,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:55:49,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:55:49,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:49,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:55:49,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:49,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:55:49,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:55:49,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:55:49,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:55:49,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:55:49,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:55:49,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:55:49,161 INFO L87 Difference]: Start difference. First operand 146 states and 206 transitions. Second operand 5 states. [2019-01-12 14:55:49,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:55:49,530 INFO L93 Difference]: Finished difference Result 387 states and 541 transitions. [2019-01-12 14:55:49,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 14:55:49,532 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-01-12 14:55:49,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:55:49,534 INFO L225 Difference]: With dead ends: 387 [2019-01-12 14:55:49,535 INFO L226 Difference]: Without dead ends: 248 [2019-01-12 14:55:49,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:55:49,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-01-12 14:55:49,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 158. [2019-01-12 14:55:49,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-01-12 14:55:49,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 218 transitions. [2019-01-12 14:55:49,558 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 218 transitions. Word has length 37 [2019-01-12 14:55:49,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:55:49,559 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 218 transitions. [2019-01-12 14:55:49,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:55:49,559 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 218 transitions. [2019-01-12 14:55:49,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-12 14:55:49,561 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:55:49,561 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, 1, 1, 1, 1, 1] [2019-01-12 14:55:49,561 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:55:49,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:55:49,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1512615668, now seen corresponding path program 1 times [2019-01-12 14:55:49,562 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:55:49,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:55:49,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:49,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:55:49,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:49,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:55:49,740 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:55:49,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:55:49,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:55:49,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 14:55:49,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 14:55:49,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 14:55:49,742 INFO L87 Difference]: Start difference. First operand 158 states and 218 transitions. Second operand 4 states. [2019-01-12 14:55:50,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:55:50,003 INFO L93 Difference]: Finished difference Result 375 states and 514 transitions. [2019-01-12 14:55:50,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 14:55:50,004 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-01-12 14:55:50,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:55:50,006 INFO L225 Difference]: With dead ends: 375 [2019-01-12 14:55:50,006 INFO L226 Difference]: Without dead ends: 224 [2019-01-12 14:55:50,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:55:50,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-01-12 14:55:50,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 166. [2019-01-12 14:55:50,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-01-12 14:55:50,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 226 transitions. [2019-01-12 14:55:50,032 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 226 transitions. Word has length 37 [2019-01-12 14:55:50,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:55:50,033 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 226 transitions. [2019-01-12 14:55:50,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 14:55:50,033 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 226 transitions. [2019-01-12 14:55:50,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-12 14:55:50,036 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:55:50,036 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, 1, 1, 1, 1, 1] [2019-01-12 14:55:50,037 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:55:50,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:55:50,037 INFO L82 PathProgramCache]: Analyzing trace with hash 491547314, now seen corresponding path program 1 times [2019-01-12 14:55:50,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:55:50,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:55:50,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:50,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:55:50,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:50,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:55:50,133 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:55:50,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:55:50,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:55:50,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:55:50,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:55:50,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:55:50,137 INFO L87 Difference]: Start difference. First operand 166 states and 226 transitions. Second operand 3 states. [2019-01-12 14:55:50,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:55:50,340 INFO L93 Difference]: Finished difference Result 383 states and 520 transitions. [2019-01-12 14:55:50,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:55:50,342 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-01-12 14:55:50,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:55:50,343 INFO L225 Difference]: With dead ends: 383 [2019-01-12 14:55:50,344 INFO L226 Difference]: Without dead ends: 224 [2019-01-12 14:55:50,346 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:55:50,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-01-12 14:55:50,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2019-01-12 14:55:50,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-01-12 14:55:50,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 297 transitions. [2019-01-12 14:55:50,381 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 297 transitions. Word has length 37 [2019-01-12 14:55:50,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:55:50,382 INFO L480 AbstractCegarLoop]: Abstraction has 224 states and 297 transitions. [2019-01-12 14:55:50,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:55:50,382 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 297 transitions. [2019-01-12 14:55:50,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-12 14:55:50,389 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:55:50,390 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, 1, 1, 1, 1, 1, 1] [2019-01-12 14:55:50,390 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:55:50,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:55:50,390 INFO L82 PathProgramCache]: Analyzing trace with hash 2027345266, now seen corresponding path program 1 times [2019-01-12 14:55:50,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:55:50,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:55:50,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:50,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:55:50,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:50,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:55:50,822 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 5 [2019-01-12 14:55:50,826 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:55:50,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:55:50,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 14:55:50,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 14:55:50,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 14:55:50,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-12 14:55:50,831 INFO L87 Difference]: Start difference. First operand 224 states and 297 transitions. Second operand 6 states. [2019-01-12 14:55:51,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:55:51,889 INFO L93 Difference]: Finished difference Result 869 states and 1173 transitions. [2019-01-12 14:55:51,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 14:55:51,889 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2019-01-12 14:55:51,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:55:51,893 INFO L225 Difference]: With dead ends: 869 [2019-01-12 14:55:51,893 INFO L226 Difference]: Without dead ends: 710 [2019-01-12 14:55:51,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-12 14:55:51,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2019-01-12 14:55:51,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 317. [2019-01-12 14:55:51,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-01-12 14:55:51,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 414 transitions. [2019-01-12 14:55:51,973 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 414 transitions. Word has length 38 [2019-01-12 14:55:51,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:55:51,973 INFO L480 AbstractCegarLoop]: Abstraction has 317 states and 414 transitions. [2019-01-12 14:55:51,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 14:55:51,974 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 414 transitions. [2019-01-12 14:55:51,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-12 14:55:51,976 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:55:51,977 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:55:51,977 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:55:51,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:55:51,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1633592198, now seen corresponding path program 1 times [2019-01-12 14:55:51,978 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:55:51,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:55:51,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:51,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:55:51,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:51,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:55:52,065 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-12 14:55:52,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:55:52,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 14:55:52,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:55:52,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:55:52,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:55:52,067 INFO L87 Difference]: Start difference. First operand 317 states and 414 transitions. Second operand 3 states. [2019-01-12 14:55:52,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:55:52,155 INFO L93 Difference]: Finished difference Result 391 states and 510 transitions. [2019-01-12 14:55:52,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:55:52,156 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-01-12 14:55:52,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:55:52,157 INFO L225 Difference]: With dead ends: 391 [2019-01-12 14:55:52,157 INFO L226 Difference]: Without dead ends: 159 [2019-01-12 14:55:52,159 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:55:52,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-01-12 14:55:52,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2019-01-12 14:55:52,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-01-12 14:55:52,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 199 transitions. [2019-01-12 14:55:52,180 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 199 transitions. Word has length 57 [2019-01-12 14:55:52,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:55:52,181 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 199 transitions. [2019-01-12 14:55:52,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:55:52,181 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 199 transitions. [2019-01-12 14:55:52,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-01-12 14:55:52,183 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:55:52,183 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:55:52,184 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:55:52,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:55:52,184 INFO L82 PathProgramCache]: Analyzing trace with hash 80874501, now seen corresponding path program 1 times [2019-01-12 14:55:52,184 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:55:52,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:55:52,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:52,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:55:52,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:52,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:55:52,598 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:55:52,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:55:52,598 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:55:52,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:55:52,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:55:52,728 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:55:52,967 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:55:52,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:55:52,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-01-12 14:55:52,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 14:55:52,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 14:55:52,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-01-12 14:55:52,999 INFO L87 Difference]: Start difference. First operand 159 states and 199 transitions. Second operand 9 states. [2019-01-12 14:55:53,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:55:53,706 INFO L93 Difference]: Finished difference Result 317 states and 409 transitions. [2019-01-12 14:55:53,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 14:55:53,706 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2019-01-12 14:55:53,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:55:53,707 INFO L225 Difference]: With dead ends: 317 [2019-01-12 14:55:53,707 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 14:55:53,708 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-01-12 14:55:53,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 14:55:53,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 14:55:53,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 14:55:53,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 14:55:53,711 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 59 [2019-01-12 14:55:53,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:55:53,712 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 14:55:53,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 14:55:53,712 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 14:55:53,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 14:55:53,720 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 14:55:53,878 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:53,880 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:53,961 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:53,965 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:53,983 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:53,986 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:54,073 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:54,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:54,077 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:54,089 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:54,114 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:54,117 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:54,135 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:54,137 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:54,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:54,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:54,148 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:54,172 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:54,172 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:54,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:54,204 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:54,207 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:54,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:54,255 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:54,256 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:54,258 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:54,288 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:54,289 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:54,298 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:54,304 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:54,307 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:54,310 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:54,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:54,331 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:54,332 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:54,334 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:54,355 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:54,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:54,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:54,387 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:54,388 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:54,393 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:54,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:54,443 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:54,444 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:54,999 WARN L181 SmtUtils]: Spent 479.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 14 [2019-01-12 14:55:55,201 WARN L181 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2019-01-12 14:55:55,404 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-12 14:55:55,583 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-12 14:55:56,444 WARN L181 SmtUtils]: Spent 807.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2019-01-12 14:55:56,648 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 25 [2019-01-12 14:55:56,899 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 25 [2019-01-12 14:55:57,034 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 24 [2019-01-12 14:55:57,289 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 24 [2019-01-12 14:55:57,509 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 26 [2019-01-12 14:55:57,625 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 23 [2019-01-12 14:55:57,871 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 25 [2019-01-12 14:55:58,088 WARN L181 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 9 [2019-01-12 14:55:58,205 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 27 [2019-01-12 14:55:58,241 INFO L448 ceAbstractionStarter]: For program point L103(lines 103 120) no Hoare annotation was computed. [2019-01-12 14:55:58,242 INFO L448 ceAbstractionStarter]: For program point L103-1(lines 103 120) no Hoare annotation was computed. [2019-01-12 14:55:58,242 INFO L448 ceAbstractionStarter]: For program point L103-2(lines 103 120) no Hoare annotation was computed. [2019-01-12 14:55:58,242 INFO L448 ceAbstractionStarter]: For program point L103-3(lines 103 120) no Hoare annotation was computed. [2019-01-12 14:55:58,242 INFO L448 ceAbstractionStarter]: For program point L103-4(lines 103 120) no Hoare annotation was computed. [2019-01-12 14:55:58,242 INFO L448 ceAbstractionStarter]: For program point L103-5(lines 103 120) no Hoare annotation was computed. [2019-01-12 14:55:58,242 INFO L444 ceAbstractionStarter]: At program point L863(lines 71 77) the Hoare annotation is: (let ((.cse0 (= 0 |ULTIMATE.start_isPumpRunning_#res|)) (.cse3 (= ~pumpRunning~0 0)) (.cse1 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse2 (<= ~waterLevel~0 2)) (.cse4 (= ~systemActive~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (= ~systemActive~0 0) (and (and .cse0 .cse1 .cse3) .cse2)) (and (<= 1 ~switchedOnBeforeTS~0) (<= 1 ~pumpRunning~0) .cse1 .cse2 (<= 1 |ULTIMATE.start_isPumpRunning_#res|) .cse4))) [2019-01-12 14:55:58,242 INFO L444 ceAbstractionStarter]: At program point L863-1(lines 71 77) the Hoare annotation is: false [2019-01-12 14:55:58,243 INFO L444 ceAbstractionStarter]: At program point L863-2(lines 71 77) the Hoare annotation is: false [2019-01-12 14:55:58,244 INFO L444 ceAbstractionStarter]: At program point L335(lines 286 336) the Hoare annotation is: false [2019-01-12 14:55:58,244 INFO L444 ceAbstractionStarter]: At program point L71(lines 67 89) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse2 (= ~pumpRunning~0 0)) (.cse1 (<= ~waterLevel~0 2)) (.cse3 (= ~systemActive~0 1))) (or (and (= ~systemActive~0 0) .cse0 .cse1 .cse2) (and (<= 1 ~switchedOnBeforeTS~0) (<= 1 ~pumpRunning~0) .cse0 .cse1 (<= 1 |ULTIMATE.start_isPumpRunning_#res|) .cse3) (and (and (and .cse0 .cse2) .cse1) .cse3))) [2019-01-12 14:55:58,244 INFO L444 ceAbstractionStarter]: At program point L71-1(lines 67 89) the Hoare annotation is: false [2019-01-12 14:55:58,244 INFO L444 ceAbstractionStarter]: At program point L71-2(lines 67 89) the Hoare annotation is: false [2019-01-12 14:55:58,244 INFO L444 ceAbstractionStarter]: At program point L403(lines 399 405) the Hoare annotation is: (and (= ~waterLevel~0 1) (= ~pumpRunning~0 0) (= ~systemActive~0 1)) [2019-01-12 14:55:58,244 INFO L444 ceAbstractionStarter]: At program point L833(lines 1 988) the Hoare annotation is: (and (= ~waterLevel~0 1) (= ~pumpRunning~0 0) (= ~systemActive~0 1)) [2019-01-12 14:55:58,244 INFO L448 ceAbstractionStarter]: For program point L107(lines 107 115) no Hoare annotation was computed. [2019-01-12 14:55:58,245 INFO L448 ceAbstractionStarter]: For program point L107-1(lines 107 115) no Hoare annotation was computed. [2019-01-12 14:55:58,245 INFO L448 ceAbstractionStarter]: For program point L107-2(lines 107 115) no Hoare annotation was computed. [2019-01-12 14:55:58,245 INFO L448 ceAbstractionStarter]: For program point L107-3(lines 107 115) no Hoare annotation was computed. [2019-01-12 14:55:58,245 INFO L448 ceAbstractionStarter]: For program point L107-4(lines 107 115) no Hoare annotation was computed. [2019-01-12 14:55:58,245 INFO L448 ceAbstractionStarter]: For program point L107-5(lines 107 115) no Hoare annotation was computed. [2019-01-12 14:55:58,245 INFO L448 ceAbstractionStarter]: For program point L307(lines 307 313) no Hoare annotation was computed. [2019-01-12 14:55:58,245 INFO L444 ceAbstractionStarter]: At program point L307-1(lines 307 313) the Hoare annotation is: (let ((.cse3 (= ULTIMATE.start_test_~splverifierCounter~0 0))) (let ((.cse0 (and .cse3 (= ~pumpRunning~0 0))) (.cse2 (<= 1 ~pumpRunning~0)) (.cse1 (<= ~waterLevel~0 2)) (.cse4 (= ~systemActive~0 1))) (or (and (= ~systemActive~0 0) (and .cse0 .cse1)) (and (<= 1 ~switchedOnBeforeTS~0) .cse2 .cse3 .cse1 (<= 1 |ULTIMATE.start_isPumpRunning_#res|) .cse4) (and .cse0 .cse1 .cse4) (and .cse2 (<= 2 ~waterLevel~0) .cse3 .cse1 .cse4)))) [2019-01-12 14:55:58,245 INFO L448 ceAbstractionStarter]: For program point L902(lines 902 906) no Hoare annotation was computed. [2019-01-12 14:55:58,245 INFO L448 ceAbstractionStarter]: For program point L902-3(lines 902 906) no Hoare annotation was computed. [2019-01-12 14:55:58,245 INFO L448 ceAbstractionStarter]: For program point L902-6(lines 902 906) no Hoare annotation was computed. [2019-01-12 14:55:58,246 INFO L451 ceAbstractionStarter]: At program point L440(lines 421 443) the Hoare annotation is: true [2019-01-12 14:55:58,248 INFO L448 ceAbstractionStarter]: For program point L44(line 44) no Hoare annotation was computed. [2019-01-12 14:55:58,248 INFO L448 ceAbstractionStarter]: For program point L44-1(line 44) no Hoare annotation was computed. [2019-01-12 14:55:58,248 INFO L448 ceAbstractionStarter]: For program point L44-2(line 44) no Hoare annotation was computed. [2019-01-12 14:55:58,249 INFO L444 ceAbstractionStarter]: At program point L78(lines 78 84) the Hoare annotation is: (let ((.cse3 (<= 1 ~pumpRunning~0)) (.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse2 (= ~pumpRunning~0 0)) (.cse1 (<= ~waterLevel~0 2)) (.cse4 (= ~systemActive~0 1))) (or (and (= ~systemActive~0 0) .cse0 .cse1 .cse2) (and (<= 1 ~switchedOnBeforeTS~0) .cse3 .cse0 .cse1 (<= 1 |ULTIMATE.start_isPumpRunning_#res|) .cse4) (and .cse3 (<= 2 ~waterLevel~0) .cse0 .cse1 .cse4) (and (and (and .cse0 .cse2) .cse1) .cse4))) [2019-01-12 14:55:58,249 INFO L444 ceAbstractionStarter]: At program point L78-1(lines 78 84) the Hoare annotation is: false [2019-01-12 14:55:58,249 INFO L444 ceAbstractionStarter]: At program point L78-2(lines 78 84) the Hoare annotation is: false [2019-01-12 14:55:58,249 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 44) no Hoare annotation was computed. [2019-01-12 14:55:58,249 INFO L444 ceAbstractionStarter]: At program point L971(lines 966 974) the Hoare annotation is: (let ((.cse2 (= ~pumpRunning~0 0)) (.cse3 (<= 1 ~pumpRunning~0)) (.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse1 (<= ~waterLevel~0 2)) (.cse4 (= ~systemActive~0 1))) (or (and (= ~systemActive~0 0) .cse0 .cse1 .cse2) (and (<= 1 ~switchedOnBeforeTS~0) .cse3 .cse0 .cse1 (<= 1 |ULTIMATE.start_isPumpRunning_#res|) .cse4) (and (and .cse0 .cse2) .cse1 .cse4) (and .cse3 (<= 2 ~waterLevel~0) .cse0 .cse1 (<= |ULTIMATE.start_getWaterLevel_#res| 2) (<= 2 |ULTIMATE.start_getWaterLevel_#res|) .cse4))) [2019-01-12 14:55:58,249 INFO L444 ceAbstractionStarter]: At program point L971-1(lines 966 974) the Hoare annotation is: false [2019-01-12 14:55:58,249 INFO L444 ceAbstractionStarter]: At program point L971-2(lines 966 974) the Hoare annotation is: false [2019-01-12 14:55:58,250 INFO L444 ceAbstractionStarter]: At program point L939(lines 934 942) the Hoare annotation is: (and (<= 1 ~switchedOnBeforeTS~0) (<= 1 ~pumpRunning~0) (= ULTIMATE.start_test_~splverifierCounter~0 0) (<= ~waterLevel~0 2) (<= 1 |ULTIMATE.start_isPumpRunning_#res|) (= ~systemActive~0 1)) [2019-01-12 14:55:58,250 INFO L444 ceAbstractionStarter]: At program point L939-1(lines 934 942) the Hoare annotation is: false [2019-01-12 14:55:58,252 INFO L444 ceAbstractionStarter]: At program point L939-2(lines 934 942) the Hoare annotation is: (and (<= 2 ~waterLevel~0) (= ULTIMATE.start_test_~splverifierCounter~0 0) (<= ~waterLevel~0 2) (= ~pumpRunning~0 0) (= ~systemActive~0 1)) [2019-01-12 14:55:58,252 INFO L444 ceAbstractionStarter]: At program point L939-3(lines 934 942) the Hoare annotation is: false [2019-01-12 14:55:58,252 INFO L444 ceAbstractionStarter]: At program point L939-4(lines 934 942) the Hoare annotation is: false [2019-01-12 14:55:58,252 INFO L444 ceAbstractionStarter]: At program point L939-5(lines 934 942) the Hoare annotation is: false [2019-01-12 14:55:58,252 INFO L444 ceAbstractionStarter]: At program point L939-6(lines 934 942) the Hoare annotation is: false [2019-01-12 14:55:58,252 INFO L444 ceAbstractionStarter]: At program point L939-7(lines 934 942) the Hoare annotation is: false [2019-01-12 14:55:58,252 INFO L444 ceAbstractionStarter]: At program point L939-8(lines 934 942) the Hoare annotation is: false [2019-01-12 14:55:58,252 INFO L448 ceAbstractionStarter]: For program point L874(lines 874 891) no Hoare annotation was computed. [2019-01-12 14:55:58,252 INFO L444 ceAbstractionStarter]: At program point L841(lines 836 844) the Hoare annotation is: (and (= ~waterLevel~0 1) (= ~pumpRunning~0 0) (= ~systemActive~0 1)) [2019-01-12 14:55:58,253 INFO L444 ceAbstractionStarter]: At program point L874-1(lines 1 988) the Hoare annotation is: (let ((.cse3 (= ULTIMATE.start_test_~splverifierCounter~0 0))) (let ((.cse0 (and .cse3 (= ~pumpRunning~0 0))) (.cse2 (<= 1 ~pumpRunning~0)) (.cse1 (<= ~waterLevel~0 2)) (.cse4 (= ~systemActive~0 1))) (or (and (= ~systemActive~0 0) (and .cse0 .cse1)) (and (<= 1 ~switchedOnBeforeTS~0) .cse2 .cse3 .cse1 (<= 1 |ULTIMATE.start_isPumpRunning_#res|) .cse4) (and .cse0 .cse1 .cse4) (and .cse2 (<= ULTIMATE.start___utac_acc__Specification5_spec__3_~tmp~9 2) (<= 2 ULTIMATE.start___utac_acc__Specification5_spec__3_~tmp~9) (<= 2 ~waterLevel~0) .cse3 .cse1 (<= |ULTIMATE.start_getWaterLevel_#res| 2) (<= 2 |ULTIMATE.start_getWaterLevel_#res|) .cse4)))) [2019-01-12 14:55:58,253 INFO L448 ceAbstractionStarter]: For program point L874-2(lines 874 891) no Hoare annotation was computed. [2019-01-12 14:55:58,253 INFO L444 ceAbstractionStarter]: At program point L874-3(lines 1 988) the Hoare annotation is: false [2019-01-12 14:55:58,253 INFO L448 ceAbstractionStarter]: For program point L874-4(lines 874 891) no Hoare annotation was computed. [2019-01-12 14:55:58,253 INFO L444 ceAbstractionStarter]: At program point L874-5(lines 1 988) the Hoare annotation is: false [2019-01-12 14:55:58,253 INFO L448 ceAbstractionStarter]: For program point L248(lines 248 252) no Hoare annotation was computed. [2019-01-12 14:55:58,253 INFO L448 ceAbstractionStarter]: For program point L248-2(lines 248 252) no Hoare annotation was computed. [2019-01-12 14:55:58,253 INFO L448 ceAbstractionStarter]: For program point L248-3(lines 248 252) no Hoare annotation was computed. [2019-01-12 14:55:58,253 INFO L448 ceAbstractionStarter]: For program point L248-5(lines 248 252) no Hoare annotation was computed. [2019-01-12 14:55:58,254 INFO L448 ceAbstractionStarter]: For program point L248-6(lines 248 252) no Hoare annotation was computed. [2019-01-12 14:55:58,254 INFO L448 ceAbstractionStarter]: For program point L248-8(lines 248 252) no Hoare annotation was computed. [2019-01-12 14:55:58,254 INFO L448 ceAbstractionStarter]: For program point L248-9(lines 248 252) no Hoare annotation was computed. [2019-01-12 14:55:58,254 INFO L448 ceAbstractionStarter]: For program point L248-11(lines 248 252) no Hoare annotation was computed. [2019-01-12 14:55:58,254 INFO L448 ceAbstractionStarter]: For program point L248-12(lines 248 252) no Hoare annotation was computed. [2019-01-12 14:55:58,254 INFO L448 ceAbstractionStarter]: For program point L248-14(lines 248 252) no Hoare annotation was computed. [2019-01-12 14:55:58,254 INFO L448 ceAbstractionStarter]: For program point L248-15(lines 248 252) no Hoare annotation was computed. [2019-01-12 14:55:58,254 INFO L448 ceAbstractionStarter]: For program point L248-17(lines 248 252) no Hoare annotation was computed. [2019-01-12 14:55:58,254 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 44) no Hoare annotation was computed. [2019-01-12 14:55:58,254 INFO L448 ceAbstractionStarter]: For program point L878(lines 878 888) no Hoare annotation was computed. [2019-01-12 14:55:58,254 INFO L448 ceAbstractionStarter]: For program point L878-2(lines 878 888) no Hoare annotation was computed. [2019-01-12 14:55:58,255 INFO L448 ceAbstractionStarter]: For program point L878-4(lines 878 888) no Hoare annotation was computed. [2019-01-12 14:55:58,255 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 14:55:58,255 INFO L448 ceAbstractionStarter]: For program point L317(lines 317 330) no Hoare annotation was computed. [2019-01-12 14:55:58,255 INFO L448 ceAbstractionStarter]: For program point L879(lines 879 885) no Hoare annotation was computed. [2019-01-12 14:55:58,255 INFO L448 ceAbstractionStarter]: For program point L879-2(lines 879 885) no Hoare annotation was computed. [2019-01-12 14:55:58,255 INFO L448 ceAbstractionStarter]: For program point L879-4(lines 879 885) no Hoare annotation was computed. [2019-01-12 14:55:58,255 INFO L448 ceAbstractionStarter]: For program point L979(lines 979 985) no Hoare annotation was computed. [2019-01-12 14:55:58,255 INFO L448 ceAbstractionStarter]: For program point L979-1(lines 979 985) no Hoare annotation was computed. [2019-01-12 14:55:58,255 INFO L448 ceAbstractionStarter]: For program point L979-2(lines 979 985) no Hoare annotation was computed. [2019-01-12 14:55:58,255 INFO L448 ceAbstractionStarter]: For program point L979-3(lines 979 985) no Hoare annotation was computed. [2019-01-12 14:55:58,255 INFO L448 ceAbstractionStarter]: For program point L979-4(lines 979 985) no Hoare annotation was computed. [2019-01-12 14:55:58,256 INFO L448 ceAbstractionStarter]: For program point L979-5(lines 979 985) no Hoare annotation was computed. [2019-01-12 14:55:58,256 INFO L448 ceAbstractionStarter]: For program point L914(lines 914 918) no Hoare annotation was computed. [2019-01-12 14:55:58,262 INFO L444 ceAbstractionStarter]: At program point L254(lines 239 257) the Hoare annotation is: false [2019-01-12 14:55:58,262 INFO L444 ceAbstractionStarter]: At program point L254-1(lines 239 257) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse1 (<= ~waterLevel~0 2)) (.cse2 (= ~pumpRunning~0 0)) (.cse3 (= ~systemActive~0 1))) (or (and (= 0 |ULTIMATE.start_isHighWaterLevel_#res|) .cse0 .cse1 (= 0 ULTIMATE.start_isHighWaterLevel_~tmp___0~0) .cse2 .cse3) (and (and (<= 2 ~waterLevel~0) .cse0 .cse1 .cse2) .cse3))) [2019-01-12 14:55:58,262 INFO L444 ceAbstractionStarter]: At program point L254-2(lines 239 257) the Hoare annotation is: false [2019-01-12 14:55:58,262 INFO L444 ceAbstractionStarter]: At program point L254-3(lines 239 257) the Hoare annotation is: false [2019-01-12 14:55:58,262 INFO L444 ceAbstractionStarter]: At program point L254-4(lines 239 257) the Hoare annotation is: false [2019-01-12 14:55:58,263 INFO L444 ceAbstractionStarter]: At program point L254-5(lines 239 257) the Hoare annotation is: false [2019-01-12 14:55:58,263 INFO L448 ceAbstractionStarter]: For program point L288(lines 287 334) no Hoare annotation was computed. [2019-01-12 14:55:58,263 INFO L448 ceAbstractionStarter]: For program point L289(lines 289 293) no Hoare annotation was computed. [2019-01-12 14:55:58,263 INFO L444 ceAbstractionStarter]: At program point L355-2(lines 355 369) the Hoare annotation is: false [2019-01-12 14:55:58,263 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 14:55:58,263 INFO L444 ceAbstractionStarter]: At program point L190(lines 183 193) the Hoare annotation is: (and (<= 1 ~switchedOnBeforeTS~0) (<= 1 ~pumpRunning~0) (= ULTIMATE.start_test_~splverifierCounter~0 0) (<= ~waterLevel~0 2) (<= 1 |ULTIMATE.start_isPumpRunning_#res|) (= ~systemActive~0 1)) [2019-01-12 14:55:58,263 INFO L444 ceAbstractionStarter]: At program point L190-1(lines 183 193) the Hoare annotation is: false [2019-01-12 14:55:58,263 INFO L444 ceAbstractionStarter]: At program point L190-2(lines 183 193) the Hoare annotation is: (and (<= 2 ~waterLevel~0) (= ULTIMATE.start_test_~splverifierCounter~0 0) (<= ~waterLevel~0 2) (= ~pumpRunning~0 0) (= ~systemActive~0 1)) [2019-01-12 14:55:58,263 INFO L444 ceAbstractionStarter]: At program point L190-3(lines 183 193) the Hoare annotation is: false [2019-01-12 14:55:58,263 INFO L444 ceAbstractionStarter]: At program point L190-4(lines 183 193) the Hoare annotation is: false [2019-01-12 14:55:58,263 INFO L444 ceAbstractionStarter]: At program point L190-5(lines 183 193) the Hoare annotation is: false [2019-01-12 14:55:58,264 INFO L444 ceAbstractionStarter]: At program point L190-6(lines 183 193) the Hoare annotation is: false [2019-01-12 14:55:58,264 INFO L444 ceAbstractionStarter]: At program point L190-7(lines 183 193) the Hoare annotation is: false [2019-01-12 14:55:58,264 INFO L444 ceAbstractionStarter]: At program point L190-8(lines 183 193) the Hoare annotation is: false [2019-01-12 14:55:58,264 INFO L448 ceAbstractionStarter]: For program point L356(line 356) no Hoare annotation was computed. [2019-01-12 14:55:58,264 INFO L448 ceAbstractionStarter]: For program point L323(lines 323 329) no Hoare annotation was computed. [2019-01-12 14:55:58,264 INFO L444 ceAbstractionStarter]: At program point L323-1(lines 323 329) the Hoare annotation is: (let ((.cse2 (= ~pumpRunning~0 0)) (.cse3 (<= 1 ~pumpRunning~0)) (.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse1 (<= ~waterLevel~0 2)) (.cse4 (= ~systemActive~0 1))) (or (and (= ~systemActive~0 0) .cse0 .cse1 .cse2) (and (<= 1 ~switchedOnBeforeTS~0) .cse3 .cse0 .cse1 (<= 1 |ULTIMATE.start_isPumpRunning_#res|) .cse4) (and (and .cse0 .cse2) .cse1 .cse4) (and .cse3 (<= 2 ~waterLevel~0) .cse0 .cse1 .cse4))) [2019-01-12 14:55:58,264 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 44) no Hoare annotation was computed. [2019-01-12 14:55:58,264 INFO L444 ceAbstractionStarter]: At program point L984(lines 975 988) the Hoare annotation is: false [2019-01-12 14:55:58,265 INFO L444 ceAbstractionStarter]: At program point L984-1(lines 975 988) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse1 (<= ~waterLevel~0 2)) (.cse2 (= ~pumpRunning~0 0)) (.cse3 (= ~systemActive~0 1))) (or (and .cse0 .cse1 (= 1 |ULTIMATE.start_isHighWaterSensorDry_#res|) .cse2 .cse3) (and (and (<= 2 ~waterLevel~0) .cse0 .cse1 .cse2) .cse3))) [2019-01-12 14:55:58,265 INFO L444 ceAbstractionStarter]: At program point L984-2(lines 975 988) the Hoare annotation is: false [2019-01-12 14:55:58,265 INFO L444 ceAbstractionStarter]: At program point L984-3(lines 975 988) the Hoare annotation is: false [2019-01-12 14:55:58,265 INFO L444 ceAbstractionStarter]: At program point L984-4(lines 975 988) the Hoare annotation is: false [2019-01-12 14:55:58,265 INFO L444 ceAbstractionStarter]: At program point L984-5(lines 975 988) the Hoare annotation is: false [2019-01-12 14:55:58,265 INFO L444 ceAbstractionStarter]: At program point L853(lines 848 855) the Hoare annotation is: (and (= ~waterLevel~0 1) (= ~pumpRunning~0 0) (= ~systemActive~0 1)) [2019-01-12 14:55:58,265 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 14:55:58,265 INFO L448 ceAbstractionStarter]: For program point L359(lines 359 363) no Hoare annotation was computed. [2019-01-12 14:55:58,265 INFO L448 ceAbstractionStarter]: For program point L359-1(lines 359 363) no Hoare annotation was computed. [2019-01-12 14:55:58,265 INFO L448 ceAbstractionStarter]: For program point L129(lines 129 146) no Hoare annotation was computed. [2019-01-12 14:55:58,266 INFO L448 ceAbstractionStarter]: For program point L129-1(lines 129 146) no Hoare annotation was computed. [2019-01-12 14:55:58,266 INFO L448 ceAbstractionStarter]: For program point L129-2(lines 129 146) no Hoare annotation was computed. [2019-01-12 14:55:58,266 INFO L448 ceAbstractionStarter]: For program point L262(lines 262 268) no Hoare annotation was computed. [2019-01-12 14:55:58,266 INFO L444 ceAbstractionStarter]: At program point L262-1(lines 262 268) the Hoare annotation is: (and (= ULTIMATE.start_test_~splverifierCounter~0 0) (<= ~waterLevel~0 2) (= ~pumpRunning~0 0)) [2019-01-12 14:55:58,266 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 14:55:58,266 INFO L448 ceAbstractionStarter]: For program point L297(lines 297 303) no Hoare annotation was computed. [2019-01-12 14:55:58,266 INFO L444 ceAbstractionStarter]: At program point L297-1(lines 297 303) the Hoare annotation is: (let ((.cse3 (= ULTIMATE.start_test_~splverifierCounter~0 0))) (let ((.cse0 (and .cse3 (= ~pumpRunning~0 0))) (.cse2 (<= 1 ~pumpRunning~0)) (.cse1 (<= ~waterLevel~0 2)) (.cse4 (= ~systemActive~0 1))) (or (and (= ~systemActive~0 0) (and .cse0 .cse1)) (and (<= 1 ~switchedOnBeforeTS~0) .cse2 .cse3 .cse1 (<= 1 |ULTIMATE.start_isPumpRunning_#res|) .cse4) (and .cse0 .cse1 .cse4) (and .cse2 (<= 2 ~waterLevel~0) .cse3 .cse1 .cse4)))) [2019-01-12 14:55:58,266 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 171) no Hoare annotation was computed. [2019-01-12 14:55:58,266 INFO L448 ceAbstractionStarter]: For program point L165-2(lines 165 171) no Hoare annotation was computed. [2019-01-12 14:55:58,266 INFO L448 ceAbstractionStarter]: For program point L165-4(lines 165 171) no Hoare annotation was computed. [2019-01-12 14:55:58,267 INFO L448 ceAbstractionStarter]: For program point L165-6(lines 165 171) no Hoare annotation was computed. [2019-01-12 14:55:58,267 INFO L448 ceAbstractionStarter]: For program point L165-8(lines 165 171) no Hoare annotation was computed. [2019-01-12 14:55:58,267 INFO L448 ceAbstractionStarter]: For program point L165-10(lines 165 171) no Hoare annotation was computed. [2019-01-12 14:55:58,267 INFO L444 ceAbstractionStarter]: At program point L199(lines 194 202) the Hoare annotation is: (let ((.cse0 (<= 1 ~pumpRunning~0)) (.cse3 (<= 1 |ULTIMATE.start_isPumpRunning_#res|)) (.cse4 (= ~systemActive~0 1)) (.cse5 (= 0 |ULTIMATE.start_isPumpRunning_#res|)) (.cse1 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse6 (= ~pumpRunning~0 0)) (.cse2 (<= ~waterLevel~0 2))) (or (and (<= 1 ~switchedOnBeforeTS~0) .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 (<= 2 ~waterLevel~0) .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse2 .cse6 .cse4) (and (= ~systemActive~0 0) (and (and .cse5 .cse1 .cse6) .cse2)))) [2019-01-12 14:55:58,267 INFO L444 ceAbstractionStarter]: At program point L199-1(lines 194 202) the Hoare annotation is: (let ((.cse4 (= ~systemActive~0 1)) (.cse0 (= 0 |ULTIMATE.start_isPumpRunning_#res|)) (.cse1 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse2 (<= ~waterLevel~0 2)) (.cse3 (= ~pumpRunning~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (<= 1 ~switchedOnBeforeTS~0) (<= 1 ~pumpRunning~0) .cse1 .cse2 (<= 1 |ULTIMATE.start_isPumpRunning_#res|) .cse4) (and (= ~systemActive~0 0) .cse0 .cse1 .cse2 .cse3))) [2019-01-12 14:55:58,267 INFO L448 ceAbstractionStarter]: For program point L133(lines 133 141) no Hoare annotation was computed. [2019-01-12 14:55:58,267 INFO L444 ceAbstractionStarter]: At program point L199-2(lines 194 202) the Hoare annotation is: false [2019-01-12 14:55:58,267 INFO L448 ceAbstractionStarter]: For program point L133-1(lines 133 141) no Hoare annotation was computed. [2019-01-12 14:55:58,268 INFO L444 ceAbstractionStarter]: At program point L199-3(lines 194 202) the Hoare annotation is: false [2019-01-12 14:55:58,268 INFO L444 ceAbstractionStarter]: At program point L199-4(lines 194 202) the Hoare annotation is: false [2019-01-12 14:55:58,268 INFO L448 ceAbstractionStarter]: For program point L133-2(lines 133 141) no Hoare annotation was computed. [2019-01-12 14:55:58,268 INFO L444 ceAbstractionStarter]: At program point L199-5(lines 194 202) the Hoare annotation is: false [2019-01-12 14:55:58,268 INFO L448 ceAbstractionStarter]: For program point L926(lines 926 930) no Hoare annotation was computed. [2019-01-12 14:55:58,268 INFO L448 ceAbstractionStarter]: For program point L431(lines 431 438) no Hoare annotation was computed. [2019-01-12 14:55:58,268 INFO L451 ceAbstractionStarter]: At program point L431-1(lines 431 438) the Hoare annotation is: true [2019-01-12 14:55:58,323 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 02:55:58 BoogieIcfgContainer [2019-01-12 14:55:58,324 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 14:55:58,324 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 14:55:58,324 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 14:55:58,325 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 14:55:58,325 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:55:46" (3/4) ... [2019-01-12 14:55:58,329 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 14:55:58,367 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 38 nodes and edges [2019-01-12 14:55:58,369 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2019-01-12 14:55:58,371 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-01-12 14:55:58,372 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-12 14:55:58,374 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 14:55:58,376 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-12 14:55:58,419 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((systemActive == 0 && (splverifierCounter == 0 && pumpRunning == 0) && waterLevel <= 2) || (((((1 <= switchedOnBeforeTS && 1 <= pumpRunning) && splverifierCounter == 0) && waterLevel <= 2) && 1 <= \result) && systemActive == 1)) || (((splverifierCounter == 0 && pumpRunning == 0) && waterLevel <= 2) && systemActive == 1)) || ((((((((1 <= pumpRunning && tmp <= 2) && 2 <= tmp) && 2 <= waterLevel) && splverifierCounter == 0) && waterLevel <= 2) && \result <= 2) && 2 <= \result) && systemActive == 1) [2019-01-12 14:55:58,420 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((systemActive == 0 && (splverifierCounter == 0 && pumpRunning == 0) && waterLevel <= 2) || (((((1 <= switchedOnBeforeTS && 1 <= pumpRunning) && splverifierCounter == 0) && waterLevel <= 2) && 1 <= \result) && systemActive == 1)) || (((splverifierCounter == 0 && pumpRunning == 0) && waterLevel <= 2) && systemActive == 1)) || ((((1 <= pumpRunning && 2 <= waterLevel) && splverifierCounter == 0) && waterLevel <= 2) && systemActive == 1) [2019-01-12 14:55:58,422 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((systemActive == 0 && (splverifierCounter == 0 && pumpRunning == 0) && waterLevel <= 2) || (((((1 <= switchedOnBeforeTS && 1 <= pumpRunning) && splverifierCounter == 0) && waterLevel <= 2) && 1 <= \result) && systemActive == 1)) || (((splverifierCounter == 0 && pumpRunning == 0) && waterLevel <= 2) && systemActive == 1)) || ((((1 <= pumpRunning && 2 <= waterLevel) && splverifierCounter == 0) && waterLevel <= 2) && systemActive == 1) [2019-01-12 14:55:58,422 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((systemActive == 0 && splverifierCounter == 0) && waterLevel <= 2) && pumpRunning == 0) || (((((1 <= switchedOnBeforeTS && 1 <= pumpRunning) && splverifierCounter == 0) && waterLevel <= 2) && 1 <= \result) && systemActive == 1)) || (((splverifierCounter == 0 && pumpRunning == 0) && waterLevel <= 2) && systemActive == 1)) || ((((1 <= pumpRunning && 2 <= waterLevel) && splverifierCounter == 0) && waterLevel <= 2) && systemActive == 1) [2019-01-12 14:55:58,425 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((1 <= switchedOnBeforeTS && 1 <= pumpRunning) && splverifierCounter == 0) && waterLevel <= 2) && 1 <= \result) && systemActive == 1) || (((((1 <= pumpRunning && 2 <= waterLevel) && splverifierCounter == 0) && waterLevel <= 2) && 1 <= \result) && systemActive == 1)) || ((((0 == \result && splverifierCounter == 0) && waterLevel <= 2) && pumpRunning == 0) && systemActive == 1)) || (systemActive == 0 && ((0 == \result && splverifierCounter == 0) && pumpRunning == 0) && waterLevel <= 2) [2019-01-12 14:55:58,426 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == \result && splverifierCounter == 0) && waterLevel <= 2) && pumpRunning == 0) && systemActive == 1) || (systemActive == 0 && ((0 == \result && splverifierCounter == 0) && pumpRunning == 0) && waterLevel <= 2)) || (((((1 <= switchedOnBeforeTS && 1 <= pumpRunning) && splverifierCounter == 0) && waterLevel <= 2) && 1 <= \result) && systemActive == 1) [2019-01-12 14:55:58,427 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((systemActive == 0 && splverifierCounter == 0) && waterLevel <= 2) && pumpRunning == 0) || (((((1 <= switchedOnBeforeTS && 1 <= pumpRunning) && splverifierCounter == 0) && waterLevel <= 2) && 1 <= \result) && systemActive == 1)) || (((splverifierCounter == 0 && pumpRunning == 0) && waterLevel <= 2) && systemActive == 1) [2019-01-12 14:55:58,427 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((systemActive == 0 && splverifierCounter == 0) && waterLevel <= 2) && pumpRunning == 0) || (((((1 <= switchedOnBeforeTS && 1 <= pumpRunning) && splverifierCounter == 0) && waterLevel <= 2) && 1 <= \result) && systemActive == 1)) || ((((1 <= pumpRunning && 2 <= waterLevel) && splverifierCounter == 0) && waterLevel <= 2) && systemActive == 1)) || (((splverifierCounter == 0 && pumpRunning == 0) && waterLevel <= 2) && systemActive == 1) [2019-01-12 14:55:58,430 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((systemActive == 0 && splverifierCounter == 0) && waterLevel <= 2) && pumpRunning == 0) || (((((1 <= switchedOnBeforeTS && 1 <= pumpRunning) && splverifierCounter == 0) && waterLevel <= 2) && 1 <= \result) && systemActive == 1)) || (((splverifierCounter == 0 && pumpRunning == 0) && waterLevel <= 2) && systemActive == 1)) || ((((((1 <= pumpRunning && 2 <= waterLevel) && splverifierCounter == 0) && waterLevel <= 2) && \result <= 2) && 2 <= \result) && systemActive == 1) [2019-01-12 14:55:58,431 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((1 <= switchedOnBeforeTS && 1 <= pumpRunning) && splverifierCounter == 0) && waterLevel <= 2) && 1 <= \result) && systemActive == 1 [2019-01-12 14:55:58,432 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((1 <= switchedOnBeforeTS && 1 <= pumpRunning) && splverifierCounter == 0) && waterLevel <= 2) && 1 <= \result) && systemActive == 1 [2019-01-12 14:55:58,432 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((splverifierCounter == 0 && waterLevel <= 2) && 1 == \result) && pumpRunning == 0) && systemActive == 1) || ((((2 <= waterLevel && splverifierCounter == 0) && waterLevel <= 2) && pumpRunning == 0) && systemActive == 1) [2019-01-12 14:55:58,433 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == \result && splverifierCounter == 0) && waterLevel <= 2) && pumpRunning == 0) && systemActive == 1) || (((((1 <= switchedOnBeforeTS && 1 <= pumpRunning) && splverifierCounter == 0) && waterLevel <= 2) && 1 <= \result) && systemActive == 1)) || ((((systemActive == 0 && 0 == \result) && splverifierCounter == 0) && waterLevel <= 2) && pumpRunning == 0) [2019-01-12 14:55:58,437 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == \result && splverifierCounter == 0) && waterLevel <= 2) && 0 == tmp___0) && pumpRunning == 0) && systemActive == 1) || ((((2 <= waterLevel && splverifierCounter == 0) && waterLevel <= 2) && pumpRunning == 0) && systemActive == 1) [2019-01-12 14:55:58,581 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 14:55:58,582 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 14:55:58,584 INFO L168 Benchmark]: Toolchain (without parser) took 14338.40 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 296.7 MB). Free memory was 946.0 MB in the beginning and 1.2 GB in the end (delta: -208.1 MB). Peak memory consumption was 88.7 MB. Max. memory is 11.5 GB. [2019-01-12 14:55:58,585 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:55:58,585 INFO L168 Benchmark]: CACSL2BoogieTranslator took 657.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -186.9 MB). Peak memory consumption was 43.7 MB. Max. memory is 11.5 GB. [2019-01-12 14:55:58,586 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.69 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:55:58,586 INFO L168 Benchmark]: Boogie Preprocessor took 57.52 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:55:58,588 INFO L168 Benchmark]: RCFGBuilder took 1811.39 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: 64.9 MB). Peak memory consumption was 64.9 MB. Max. memory is 11.5 GB. [2019-01-12 14:55:58,589 INFO L168 Benchmark]: TraceAbstraction took 11464.63 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 155.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -118.0 MB). Peak memory consumption was 324.9 MB. Max. memory is 11.5 GB. [2019-01-12 14:55:58,589 INFO L168 Benchmark]: Witness Printer took 258.72 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-01-12 14:55:58,592 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 657.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -186.9 MB). Peak memory consumption was 43.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 82.69 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 57.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1811.39 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: 64.9 MB). Peak memory consumption was 64.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11464.63 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 155.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -118.0 MB). Peak memory consumption was 324.9 MB. Max. memory is 11.5 GB. * Witness Printer took 258.72 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 44]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 44]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 44]: 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: 183]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 431]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 183]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 183]: Loop Invariant Derived loop invariant: (((2 <= waterLevel && splverifierCounter == 0) && waterLevel <= 2) && pumpRunning == 0) && systemActive == 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (waterLevel == 1 && pumpRunning == 0) && systemActive == 1 - InvariantResult [Line: 183]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 934]: Loop Invariant Derived loop invariant: ((((1 <= switchedOnBeforeTS && 1 <= pumpRunning) && splverifierCounter == 0) && waterLevel <= 2) && 1 <= \result) && systemActive == 1 - InvariantResult [Line: 183]: Loop Invariant Derived loop invariant: ((((1 <= switchedOnBeforeTS && 1 <= pumpRunning) && splverifierCounter == 0) && waterLevel <= 2) && 1 <= \result) && systemActive == 1 - InvariantResult [Line: 934]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 975]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 836]: Loop Invariant Derived loop invariant: (waterLevel == 1 && pumpRunning == 0) && systemActive == 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((systemActive == 0 && (splverifierCounter == 0 && pumpRunning == 0) && waterLevel <= 2) || (((((1 <= switchedOnBeforeTS && 1 <= pumpRunning) && splverifierCounter == 0) && waterLevel <= 2) && 1 <= \result) && systemActive == 1)) || (((splverifierCounter == 0 && pumpRunning == 0) && waterLevel <= 2) && systemActive == 1)) || ((((((((1 <= pumpRunning && tmp <= 2) && 2 <= tmp) && 2 <= waterLevel) && splverifierCounter == 0) && waterLevel <= 2) && \result <= 2) && 2 <= \result) && systemActive == 1) - InvariantResult [Line: 71]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 975]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 71]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 183]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 307]: Loop Invariant Derived loop invariant: (((systemActive == 0 && (splverifierCounter == 0 && pumpRunning == 0) && waterLevel <= 2) || (((((1 <= switchedOnBeforeTS && 1 <= pumpRunning) && splverifierCounter == 0) && waterLevel <= 2) && 1 <= \result) && systemActive == 1)) || (((splverifierCounter == 0 && pumpRunning == 0) && waterLevel <= 2) && systemActive == 1)) || ((((1 <= pumpRunning && 2 <= waterLevel) && splverifierCounter == 0) && waterLevel <= 2) && systemActive == 1) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 183]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 183]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 183]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 975]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 975]: Loop Invariant Derived loop invariant: ((((splverifierCounter == 0 && waterLevel <= 2) && 1 == \result) && pumpRunning == 0) && systemActive == 1) || ((((2 <= waterLevel && splverifierCounter == 0) && waterLevel <= 2) && pumpRunning == 0) && systemActive == 1) - InvariantResult [Line: 355]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 975]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 297]: Loop Invariant Derived loop invariant: (((systemActive == 0 && (splverifierCounter == 0 && pumpRunning == 0) && waterLevel <= 2) || (((((1 <= switchedOnBeforeTS && 1 <= pumpRunning) && splverifierCounter == 0) && waterLevel <= 2) && 1 <= \result) && systemActive == 1)) || (((splverifierCounter == 0 && pumpRunning == 0) && waterLevel <= 2) && systemActive == 1)) || ((((1 <= pumpRunning && 2 <= waterLevel) && splverifierCounter == 0) && waterLevel <= 2) && systemActive == 1) - InvariantResult [Line: 975]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 71]: Loop Invariant Derived loop invariant: (((((0 == \result && splverifierCounter == 0) && waterLevel <= 2) && pumpRunning == 0) && systemActive == 1) || (systemActive == 0 && ((0 == \result && splverifierCounter == 0) && pumpRunning == 0) && waterLevel <= 2)) || (((((1 <= switchedOnBeforeTS && 1 <= pumpRunning) && splverifierCounter == 0) && waterLevel <= 2) && 1 <= \result) && systemActive == 1) - InvariantResult [Line: 399]: Loop Invariant Derived loop invariant: (waterLevel == 1 && pumpRunning == 0) && systemActive == 1 - InvariantResult [Line: 239]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 194]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 67]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 421]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 239]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 67]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 194]: Loop Invariant Derived loop invariant: (((((0 == \result && splverifierCounter == 0) && waterLevel <= 2) && pumpRunning == 0) && systemActive == 1) || (((((1 <= switchedOnBeforeTS && 1 <= pumpRunning) && splverifierCounter == 0) && waterLevel <= 2) && 1 <= \result) && systemActive == 1)) || ((((systemActive == 0 && 0 == \result) && splverifierCounter == 0) && waterLevel <= 2) && pumpRunning == 0) - InvariantResult [Line: 323]: Loop Invariant Derived loop invariant: (((((systemActive == 0 && splverifierCounter == 0) && waterLevel <= 2) && pumpRunning == 0) || (((((1 <= switchedOnBeforeTS && 1 <= pumpRunning) && splverifierCounter == 0) && waterLevel <= 2) && 1 <= \result) && systemActive == 1)) || (((splverifierCounter == 0 && pumpRunning == 0) && waterLevel <= 2) && systemActive == 1)) || ((((1 <= pumpRunning && 2 <= waterLevel) && splverifierCounter == 0) && waterLevel <= 2) && systemActive == 1) - InvariantResult [Line: 239]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 194]: Loop Invariant Derived loop invariant: (((((((1 <= switchedOnBeforeTS && 1 <= pumpRunning) && splverifierCounter == 0) && waterLevel <= 2) && 1 <= \result) && systemActive == 1) || (((((1 <= pumpRunning && 2 <= waterLevel) && splverifierCounter == 0) && waterLevel <= 2) && 1 <= \result) && systemActive == 1)) || ((((0 == \result && splverifierCounter == 0) && waterLevel <= 2) && pumpRunning == 0) && systemActive == 1)) || (systemActive == 0 && ((0 == \result && splverifierCounter == 0) && pumpRunning == 0) && waterLevel <= 2) - InvariantResult [Line: 67]: Loop Invariant Derived loop invariant: ((((systemActive == 0 && splverifierCounter == 0) && waterLevel <= 2) && pumpRunning == 0) || (((((1 <= switchedOnBeforeTS && 1 <= pumpRunning) && splverifierCounter == 0) && waterLevel <= 2) && 1 <= \result) && systemActive == 1)) || (((splverifierCounter == 0 && pumpRunning == 0) && waterLevel <= 2) && systemActive == 1) - InvariantResult [Line: 239]: Loop Invariant Derived loop invariant: (((((0 == \result && splverifierCounter == 0) && waterLevel <= 2) && 0 == tmp___0) && pumpRunning == 0) && systemActive == 1) || ((((2 <= waterLevel && splverifierCounter == 0) && waterLevel <= 2) && pumpRunning == 0) && systemActive == 1) - InvariantResult [Line: 848]: Loop Invariant Derived loop invariant: (waterLevel == 1 && pumpRunning == 0) && systemActive == 1 - InvariantResult [Line: 239]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 966]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 78]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 194]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 78]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 194]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 78]: Loop Invariant Derived loop invariant: (((((systemActive == 0 && splverifierCounter == 0) && waterLevel <= 2) && pumpRunning == 0) || (((((1 <= switchedOnBeforeTS && 1 <= pumpRunning) && splverifierCounter == 0) && waterLevel <= 2) && 1 <= \result) && systemActive == 1)) || ((((1 <= pumpRunning && 2 <= waterLevel) && splverifierCounter == 0) && waterLevel <= 2) && systemActive == 1)) || (((splverifierCounter == 0 && pumpRunning == 0) && waterLevel <= 2) && systemActive == 1) - InvariantResult [Line: 239]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 194]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 934]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 262]: Loop Invariant Derived loop invariant: (splverifierCounter == 0 && waterLevel <= 2) && pumpRunning == 0 - InvariantResult [Line: 934]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 966]: Loop Invariant Derived loop invariant: (((((systemActive == 0 && splverifierCounter == 0) && waterLevel <= 2) && pumpRunning == 0) || (((((1 <= switchedOnBeforeTS && 1 <= pumpRunning) && splverifierCounter == 0) && waterLevel <= 2) && 1 <= \result) && systemActive == 1)) || (((splverifierCounter == 0 && pumpRunning == 0) && waterLevel <= 2) && systemActive == 1)) || ((((((1 <= pumpRunning && 2 <= waterLevel) && splverifierCounter == 0) && waterLevel <= 2) && \result <= 2) && 2 <= \result) && systemActive == 1) - InvariantResult [Line: 966]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 934]: Loop Invariant Derived loop invariant: (((2 <= waterLevel && splverifierCounter == 0) && waterLevel <= 2) && pumpRunning == 0) && systemActive == 1 - InvariantResult [Line: 934]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 934]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 934]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 934]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 286]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 140 locations, 3 error locations. SAFE Result, 11.3s OverallTime, 11 OverallIterations, 2 TraceHistogramMax, 3.5s AutomataDifference, 0.0s DeadEndRemovalTime, 4.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 1263 SDtfs, 1182 SDslu, 1631 SDs, 0 SdLazy, 256 SolverSat, 59 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 124 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=317occurred in iteration=9, 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, 783 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 63 LocationsWithAnnotation, 63 PreInvPairs, 181 NumberOfFragments, 865 HoareAnnotationTreeSize, 63 FomulaSimplifications, 47210 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 63 FomulaSimplificationsInter, 6380 FormulaSimplificationTreeSizeReductionInter, 3.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 446 NumberOfCodeBlocks, 446 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 434 ConstructedInterpolants, 0 QuantifiedInterpolants, 37066 SizeOfPredicates, 4 NumberOfNonLiveVariables, 431 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 12 InterpolantComputations, 10 PerfectInterpolantSequences, 29/47 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...