./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec5_product43_true-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa 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_product43_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 77b70849cb3dcecd37b0edacca9651109dbc42ac ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-31 09:50:56,090 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 09:50:56,092 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 09:50:56,110 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 09:50:56,111 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 09:50:56,112 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 09:50:56,117 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 09:50:56,119 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 09:50:56,124 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 09:50:56,127 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 09:50:56,130 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 09:50:56,131 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 09:50:56,132 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 09:50:56,135 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 09:50:56,137 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 09:50:56,138 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 09:50:56,139 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 09:50:56,151 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 09:50:56,153 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 09:50:56,156 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 09:50:56,161 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 09:50:56,162 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 09:50:56,166 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 09:50:56,169 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 09:50:56,169 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 09:50:56,170 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 09:50:56,171 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 09:50:56,172 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 09:50:56,176 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 09:50:56,178 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 09:50:56,180 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 09:50:56,181 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 09:50:56,182 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 09:50:56,182 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 09:50:56,183 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 09:50:56,183 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 09:50:56,186 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 09:50:56,219 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 09:50:56,219 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 09:50:56,220 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 09:50:56,222 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 09:50:56,223 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 09:50:56,223 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 09:50:56,223 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 09:50:56,223 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 09:50:56,223 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 09:50:56,225 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 09:50:56,225 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 09:50:56,225 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 09:50:56,226 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 09:50:56,226 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 09:50:56,226 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 09:50:56,227 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 09:50:56,227 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 09:50:56,227 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 09:50:56,227 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 09:50:56,228 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 09:50:56,228 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 09:50:56,228 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 09:50:56,228 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 09:50:56,228 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 09:50:56,229 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 09:50:56,231 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 09:50:56,232 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 09:50:56,232 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 09:50:56,232 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 -> 77b70849cb3dcecd37b0edacca9651109dbc42ac [2018-12-31 09:50:56,294 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 09:50:56,314 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 09:50:56,319 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 09:50:56,321 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 09:50:56,322 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 09:50:56,323 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec5_product43_true-unreach-call_false-termination.cil.c [2018-12-31 09:50:56,391 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ba378463/b1177002ab2f4dfba44e0999a5b21c85/FLAGd39d3be52 [2018-12-31 09:50:56,917 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 09:50:56,919 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec5_product43_true-unreach-call_false-termination.cil.c [2018-12-31 09:50:56,936 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ba378463/b1177002ab2f4dfba44e0999a5b21c85/FLAGd39d3be52 [2018-12-31 09:50:57,206 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ba378463/b1177002ab2f4dfba44e0999a5b21c85 [2018-12-31 09:50:57,210 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 09:50:57,211 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 09:50:57,212 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 09:50:57,212 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 09:50:57,216 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 09:50:57,217 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:50:57" (1/1) ... [2018-12-31 09:50:57,221 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6605ba18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:50:57, skipping insertion in model container [2018-12-31 09:50:57,224 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:50:57" (1/1) ... [2018-12-31 09:50:57,232 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 09:50:57,298 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 09:50:57,684 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 09:50:57,708 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 09:50:57,837 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 09:50:57,971 INFO L195 MainTranslator]: Completed translation [2018-12-31 09:50:57,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:50:57 WrapperNode [2018-12-31 09:50:57,973 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 09:50:57,974 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 09:50:57,974 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 09:50:57,974 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 09:50:57,985 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:50:57" (1/1) ... [2018-12-31 09:50:58,005 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:50:57" (1/1) ... [2018-12-31 09:50:58,051 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 09:50:58,051 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 09:50:58,051 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 09:50:58,052 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 09:50:58,061 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:50:57" (1/1) ... [2018-12-31 09:50:58,061 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:50:57" (1/1) ... [2018-12-31 09:50:58,066 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:50:57" (1/1) ... [2018-12-31 09:50:58,066 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:50:57" (1/1) ... [2018-12-31 09:50:58,076 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:50:57" (1/1) ... [2018-12-31 09:50:58,086 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:50:57" (1/1) ... [2018-12-31 09:50:58,089 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:50:57" (1/1) ... [2018-12-31 09:50:58,094 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 09:50:58,094 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 09:50:58,094 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 09:50:58,095 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 09:50:58,095 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:50:57" (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 [2018-12-31 09:50:58,176 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 09:50:58,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-31 09:50:58,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 09:50:58,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 09:50:59,463 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 09:50:59,463 INFO L280 CfgBuilder]: Removed 132 assue(true) statements. [2018-12-31 09:50:59,464 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:50:59 BoogieIcfgContainer [2018-12-31 09:50:59,464 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 09:50:59,465 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 09:50:59,465 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 09:50:59,469 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 09:50:59,469 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 09:50:57" (1/3) ... [2018-12-31 09:50:59,470 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c6f4dff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:50:59, skipping insertion in model container [2018-12-31 09:50:59,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:50:57" (2/3) ... [2018-12-31 09:50:59,471 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c6f4dff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:50:59, skipping insertion in model container [2018-12-31 09:50:59,471 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:50:59" (3/3) ... [2018-12-31 09:50:59,473 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec5_product43_true-unreach-call_false-termination.cil.c [2018-12-31 09:50:59,484 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 09:50:59,493 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-31 09:50:59,511 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-31 09:50:59,544 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 09:50:59,545 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 09:50:59,545 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 09:50:59,545 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 09:50:59,545 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 09:50:59,546 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 09:50:59,546 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 09:50:59,546 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 09:50:59,546 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 09:50:59,564 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2018-12-31 09:50:59,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-31 09:50:59,573 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:50:59,574 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:50:59,576 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:50:59,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:50:59,583 INFO L82 PathProgramCache]: Analyzing trace with hash -2684768, now seen corresponding path program 1 times [2018-12-31 09:50:59,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:50:59,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:50:59,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:50:59,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:50:59,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:50:59,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:50:59,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:50:59,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:50:59,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 09:50:59,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 09:50:59,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 09:50:59,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 09:50:59,863 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 2 states. [2018-12-31 09:50:59,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:50:59,893 INFO L93 Difference]: Finished difference Result 189 states and 280 transitions. [2018-12-31 09:50:59,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 09:50:59,895 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-12-31 09:50:59,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:50:59,908 INFO L225 Difference]: With dead ends: 189 [2018-12-31 09:50:59,908 INFO L226 Difference]: Without dead ends: 94 [2018-12-31 09:50:59,912 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 [2018-12-31 09:50:59,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-12-31 09:50:59,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-12-31 09:50:59,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-31 09:50:59,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 132 transitions. [2018-12-31 09:50:59,959 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 132 transitions. Word has length 19 [2018-12-31 09:50:59,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:50:59,960 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 132 transitions. [2018-12-31 09:50:59,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 09:50:59,960 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 132 transitions. [2018-12-31 09:50:59,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-31 09:50:59,961 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:50:59,961 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] [2018-12-31 09:50:59,962 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:50:59,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:50:59,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1024617476, now seen corresponding path program 1 times [2018-12-31 09:50:59,962 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:50:59,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:50:59,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:50:59,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:50:59,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:51:00,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:51:00,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:51:00,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:51:00,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 09:51:00,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:51:00,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:51:00,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:51:00,177 INFO L87 Difference]: Start difference. First operand 94 states and 132 transitions. Second operand 3 states. [2018-12-31 09:51:00,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:51:00,213 INFO L93 Difference]: Finished difference Result 94 states and 132 transitions. [2018-12-31 09:51:00,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:51:00,214 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-31 09:51:00,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:51:00,215 INFO L225 Difference]: With dead ends: 94 [2018-12-31 09:51:00,217 INFO L226 Difference]: Without dead ends: 43 [2018-12-31 09:51:00,218 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 [2018-12-31 09:51:00,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-31 09:51:00,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-31 09:51:00,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-31 09:51:00,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 60 transitions. [2018-12-31 09:51:00,229 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 60 transitions. Word has length 20 [2018-12-31 09:51:00,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:51:00,229 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 60 transitions. [2018-12-31 09:51:00,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:51:00,229 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 60 transitions. [2018-12-31 09:51:00,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-31 09:51:00,230 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:51:00,232 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] [2018-12-31 09:51:00,232 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:51:00,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:51:00,232 INFO L82 PathProgramCache]: Analyzing trace with hash -322803839, now seen corresponding path program 1 times [2018-12-31 09:51:00,233 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:51:00,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:51:00,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:51:00,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:51:00,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:51:00,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:51:00,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:51:00,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:51:00,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 09:51:00,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:51:00,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:51:00,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:51:00,398 INFO L87 Difference]: Start difference. First operand 43 states and 60 transitions. Second operand 3 states. [2018-12-31 09:51:00,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:51:00,449 INFO L93 Difference]: Finished difference Result 115 states and 166 transitions. [2018-12-31 09:51:00,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:51:00,454 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-31 09:51:00,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:51:00,456 INFO L225 Difference]: With dead ends: 115 [2018-12-31 09:51:00,458 INFO L226 Difference]: Without dead ends: 79 [2018-12-31 09:51:00,458 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 [2018-12-31 09:51:00,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-31 09:51:00,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 75. [2018-12-31 09:51:00,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-31 09:51:00,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 108 transitions. [2018-12-31 09:51:00,484 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 108 transitions. Word has length 26 [2018-12-31 09:51:00,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:51:00,486 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 108 transitions. [2018-12-31 09:51:00,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:51:00,486 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 108 transitions. [2018-12-31 09:51:00,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-31 09:51:00,487 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:51:00,488 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] [2018-12-31 09:51:00,488 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:51:00,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:51:00,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1431450619, now seen corresponding path program 1 times [2018-12-31 09:51:00,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:51:00,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:51:00,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:51:00,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:51:00,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:51:00,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:51:00,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:51:00,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:51:00,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 09:51:00,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:51:00,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:51:00,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:51:00,567 INFO L87 Difference]: Start difference. First operand 75 states and 108 transitions. Second operand 3 states. [2018-12-31 09:51:00,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:51:00,664 INFO L93 Difference]: Finished difference Result 190 states and 279 transitions. [2018-12-31 09:51:00,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:51:00,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-31 09:51:00,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:51:00,667 INFO L225 Difference]: With dead ends: 190 [2018-12-31 09:51:00,667 INFO L226 Difference]: Without dead ends: 122 [2018-12-31 09:51:00,668 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 [2018-12-31 09:51:00,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-12-31 09:51:00,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2018-12-31 09:51:00,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-12-31 09:51:00,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 172 transitions. [2018-12-31 09:51:00,683 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 172 transitions. Word has length 27 [2018-12-31 09:51:00,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:51:00,684 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 172 transitions. [2018-12-31 09:51:00,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:51:00,684 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 172 transitions. [2018-12-31 09:51:00,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-31 09:51:00,685 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:51:00,685 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] [2018-12-31 09:51:00,686 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:51:00,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:51:00,686 INFO L82 PathProgramCache]: Analyzing trace with hash -591283254, now seen corresponding path program 1 times [2018-12-31 09:51:00,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:51:00,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:51:00,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:51:00,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:51:00,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:51:00,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:51:00,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:51:00,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:51:00,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 09:51:00,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:51:00,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:51:00,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:51:00,944 INFO L87 Difference]: Start difference. First operand 120 states and 172 transitions. Second operand 5 states. [2018-12-31 09:51:01,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:51:01,313 INFO L93 Difference]: Finished difference Result 435 states and 625 transitions. [2018-12-31 09:51:01,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 09:51:01,313 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-12-31 09:51:01,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:51:01,316 INFO L225 Difference]: With dead ends: 435 [2018-12-31 09:51:01,316 INFO L226 Difference]: Without dead ends: 322 [2018-12-31 09:51:01,317 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 [2018-12-31 09:51:01,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-12-31 09:51:01,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 118. [2018-12-31 09:51:01,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-12-31 09:51:01,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 166 transitions. [2018-12-31 09:51:01,342 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 166 transitions. Word has length 29 [2018-12-31 09:51:01,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:51:01,342 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 166 transitions. [2018-12-31 09:51:01,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:51:01,343 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 166 transitions. [2018-12-31 09:51:01,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-31 09:51:01,344 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:51:01,344 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] [2018-12-31 09:51:01,345 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:51:01,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:51:01,345 INFO L82 PathProgramCache]: Analyzing trace with hash 644254591, now seen corresponding path program 1 times [2018-12-31 09:51:01,345 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:51:01,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:51:01,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:51:01,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:51:01,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:51:01,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:51:01,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:51:01,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:51:01,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 09:51:01,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:51:01,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:51:01,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:51:01,618 INFO L87 Difference]: Start difference. First operand 118 states and 166 transitions. Second operand 5 states. [2018-12-31 09:51:01,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:51:01,805 INFO L93 Difference]: Finished difference Result 321 states and 449 transitions. [2018-12-31 09:51:01,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 09:51:01,806 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2018-12-31 09:51:01,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:51:01,809 INFO L225 Difference]: With dead ends: 321 [2018-12-31 09:51:01,809 INFO L226 Difference]: Without dead ends: 210 [2018-12-31 09:51:01,810 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 [2018-12-31 09:51:01,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-12-31 09:51:01,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 124. [2018-12-31 09:51:01,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-12-31 09:51:01,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 172 transitions. [2018-12-31 09:51:01,859 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 172 transitions. Word has length 36 [2018-12-31 09:51:01,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:51:01,862 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 172 transitions. [2018-12-31 09:51:01,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:51:01,863 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 172 transitions. [2018-12-31 09:51:01,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-31 09:51:01,868 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:51:01,868 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] [2018-12-31 09:51:01,869 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:51:01,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:51:01,869 INFO L82 PathProgramCache]: Analyzing trace with hash -366862659, now seen corresponding path program 1 times [2018-12-31 09:51:01,869 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:51:01,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:51:01,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:51:01,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:51:01,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:51:01,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:51:02,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:51:02,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:51:02,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 09:51:02,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:51:02,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:51:02,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:51:02,163 INFO L87 Difference]: Start difference. First operand 124 states and 172 transitions. Second operand 5 states. [2018-12-31 09:51:02,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:51:02,678 INFO L93 Difference]: Finished difference Result 348 states and 476 transitions. [2018-12-31 09:51:02,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 09:51:02,679 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2018-12-31 09:51:02,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:51:02,682 INFO L225 Difference]: With dead ends: 348 [2018-12-31 09:51:02,682 INFO L226 Difference]: Without dead ends: 231 [2018-12-31 09:51:02,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-31 09:51:02,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-12-31 09:51:02,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 128. [2018-12-31 09:51:02,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-12-31 09:51:02,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 176 transitions. [2018-12-31 09:51:02,705 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 176 transitions. Word has length 36 [2018-12-31 09:51:02,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:51:02,705 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 176 transitions. [2018-12-31 09:51:02,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:51:02,706 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 176 transitions. [2018-12-31 09:51:02,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-31 09:51:02,707 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:51:02,707 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] [2018-12-31 09:51:02,708 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:51:02,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:51:02,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1387931013, now seen corresponding path program 1 times [2018-12-31 09:51:02,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:51:02,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:51:02,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:51:02,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:51:02,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:51:02,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:51:02,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:51:02,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:51:02,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 09:51:02,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:51:02,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:51:02,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:51:02,823 INFO L87 Difference]: Start difference. First operand 128 states and 176 transitions. Second operand 3 states. [2018-12-31 09:51:02,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:51:02,997 INFO L93 Difference]: Finished difference Result 305 states and 418 transitions. [2018-12-31 09:51:02,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:51:02,998 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-12-31 09:51:02,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:51:03,000 INFO L225 Difference]: With dead ends: 305 [2018-12-31 09:51:03,001 INFO L226 Difference]: Without dead ends: 184 [2018-12-31 09:51:03,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:51:03,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-12-31 09:51:03,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2018-12-31 09:51:03,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-12-31 09:51:03,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 245 transitions. [2018-12-31 09:51:03,048 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 245 transitions. Word has length 36 [2018-12-31 09:51:03,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:51:03,048 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 245 transitions. [2018-12-31 09:51:03,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:51:03,050 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 245 transitions. [2018-12-31 09:51:03,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-31 09:51:03,059 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:51:03,060 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] [2018-12-31 09:51:03,060 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:51:03,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:51:03,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1432557499, now seen corresponding path program 1 times [2018-12-31 09:51:03,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:51:03,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:51:03,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:51:03,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:51:03,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:51:03,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:51:03,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:51:03,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:51:03,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 09:51:03,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 09:51:03,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 09:51:03,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-31 09:51:03,461 INFO L87 Difference]: Start difference. First operand 184 states and 245 transitions. Second operand 6 states. [2018-12-31 09:51:04,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:51:04,460 INFO L93 Difference]: Finished difference Result 689 states and 945 transitions. [2018-12-31 09:51:04,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 09:51:04,461 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2018-12-31 09:51:04,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:51:04,464 INFO L225 Difference]: With dead ends: 689 [2018-12-31 09:51:04,465 INFO L226 Difference]: Without dead ends: 568 [2018-12-31 09:51:04,465 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-12-31 09:51:04,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2018-12-31 09:51:04,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 269. [2018-12-31 09:51:04,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-12-31 09:51:04,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 354 transitions. [2018-12-31 09:51:04,515 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 354 transitions. Word has length 37 [2018-12-31 09:51:04,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:51:04,515 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 354 transitions. [2018-12-31 09:51:04,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 09:51:04,516 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 354 transitions. [2018-12-31 09:51:04,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-31 09:51:04,517 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:51:04,517 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] [2018-12-31 09:51:04,517 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:51:04,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:51:04,518 INFO L82 PathProgramCache]: Analyzing trace with hash 329840228, now seen corresponding path program 1 times [2018-12-31 09:51:04,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:51:04,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:51:04,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:51:04,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:51:04,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:51:04,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:51:04,926 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:51:04,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 09:51:04,926 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 [2018-12-31 09:51:04,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:51:05,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:51:05,086 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 09:51:05,515 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:51:05,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 09:51:05,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2018-12-31 09:51:05,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 09:51:05,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 09:51:05,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-31 09:51:05,544 INFO L87 Difference]: Start difference. First operand 269 states and 354 transitions. Second operand 9 states. [2018-12-31 09:51:06,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:51:06,418 INFO L93 Difference]: Finished difference Result 507 states and 677 transitions. [2018-12-31 09:51:06,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-31 09:51:06,422 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2018-12-31 09:51:06,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:51:06,422 INFO L225 Difference]: With dead ends: 507 [2018-12-31 09:51:06,422 INFO L226 Difference]: Without dead ends: 0 [2018-12-31 09:51:06,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2018-12-31 09:51:06,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-31 09:51:06,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-31 09:51:06,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-31 09:51:06,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-31 09:51:06,428 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 54 [2018-12-31 09:51:06,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:51:06,428 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-31 09:51:06,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 09:51:06,428 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-31 09:51:06,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-31 09:51:06,435 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-31 09:51:06,495 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:06,542 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:06,545 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:06,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:06,589 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 70 [2018-12-31 09:51:06,604 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:06,605 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:06,606 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:06,606 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:06,611 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:06,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:06,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:06,614 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:06,615 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:06,617 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:06,627 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:06,638 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:06,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:06,654 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:06,663 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:06,669 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:06,676 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:06,718 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:06,742 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:06,744 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:06,762 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:06,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:06,770 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:06,807 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:06,823 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:06,830 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:06,843 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:06,848 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:06,850 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:06,867 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:06,870 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:06,873 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:06,880 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:06,888 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:06,892 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:06,918 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:06,949 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:06,950 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:06,960 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:06,961 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:06,962 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:06,967 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:06,972 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:06,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:06,980 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:06,980 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:06,988 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:06,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:06,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:06,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:07,020 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:07,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:07,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:07,052 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:07,069 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:07,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:07,087 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:07,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:07,091 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:07,093 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:07,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:07,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:07,105 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:08,969 WARN L181 SmtUtils]: Spent 1.77 s on a formula simplification. DAG size of input: 68 DAG size of output: 19 [2018-12-31 09:51:09,151 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 15 [2018-12-31 09:51:09,599 WARN L181 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 23 [2018-12-31 09:51:09,843 WARN L181 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 20 [2018-12-31 09:51:09,988 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 20 [2018-12-31 09:51:10,509 WARN L181 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 26 [2018-12-31 09:51:10,856 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 20 [2018-12-31 09:51:11,124 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 10 [2018-12-31 09:51:11,234 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2018-12-31 09:51:11,236 INFO L448 ceAbstractionStarter]: For program point L861(lines 861 867) no Hoare annotation was computed. [2018-12-31 09:51:11,236 INFO L448 ceAbstractionStarter]: For program point L861-1(lines 861 867) no Hoare annotation was computed. [2018-12-31 09:51:11,236 INFO L448 ceAbstractionStarter]: For program point L861-2(lines 861 867) no Hoare annotation was computed. [2018-12-31 09:51:11,236 INFO L448 ceAbstractionStarter]: For program point L498(lines 498 505) no Hoare annotation was computed. [2018-12-31 09:51:11,237 INFO L451 ceAbstractionStarter]: At program point L498-1(lines 498 505) the Hoare annotation is: true [2018-12-31 09:51:11,237 INFO L444 ceAbstractionStarter]: At program point L944(lines 1 964) the Hoare annotation is: (and (= ~waterLevel~0 1) (= ~pumpRunning~0 0) (= ~systemActive~0 1)) [2018-12-31 09:51:11,237 INFO L448 ceAbstractionStarter]: For program point L961(line 961) no Hoare annotation was computed. [2018-12-31 09:51:11,237 INFO L448 ceAbstractionStarter]: For program point L961-1(line 961) no Hoare annotation was computed. [2018-12-31 09:51:11,238 INFO L448 ceAbstractionStarter]: For program point L961-2(line 961) no Hoare annotation was computed. [2018-12-31 09:51:11,239 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-31 09:51:11,239 INFO L448 ceAbstractionStarter]: For program point L796(lines 796 800) no Hoare annotation was computed. [2018-12-31 09:51:11,239 INFO L448 ceAbstractionStarter]: For program point L631(lines 631 648) no Hoare annotation was computed. [2018-12-31 09:51:11,239 INFO L448 ceAbstractionStarter]: For program point L631-1(lines 631 648) no Hoare annotation was computed. [2018-12-31 09:51:11,239 INFO L448 ceAbstractionStarter]: For program point L631-2(lines 631 648) no Hoare annotation was computed. [2018-12-31 09:51:11,240 INFO L444 ceAbstractionStarter]: At program point L879(lines 874 881) the Hoare annotation is: (and (= ~waterLevel~0 1) (= ~pumpRunning~0 0) (= ~systemActive~0 1)) [2018-12-31 09:51:11,240 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 961) no Hoare annotation was computed. [2018-12-31 09:51:11,240 INFO L444 ceAbstractionStarter]: At program point L599(lines 595 617) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse1 (<= ~waterLevel~0 2))) (or (and (<= 1 ~switchedOnBeforeTS~0) (<= 1 ~pumpRunning~0) .cse0 .cse1 (<= 1 |ULTIMATE.start_isPumpRunning_#res|)) (and .cse0 .cse1 (= ~pumpRunning~0 0)))) [2018-12-31 09:51:11,240 INFO L444 ceAbstractionStarter]: At program point L599-1(lines 595 617) the Hoare annotation is: false [2018-12-31 09:51:11,240 INFO L448 ceAbstractionStarter]: For program point L533(lines 533 539) no Hoare annotation was computed. [2018-12-31 09:51:11,240 INFO L444 ceAbstractionStarter]: At program point L599-2(lines 595 617) the Hoare annotation is: false [2018-12-31 09:51:11,241 INFO L444 ceAbstractionStarter]: At program point L533-1(lines 533 539) the Hoare annotation is: (let ((.cse0 (<= 1 ~pumpRunning~0)) (.cse2 (<= ~waterLevel~0 2)) (.cse1 (= ULTIMATE.start_test_~splverifierCounter~0 0))) (or (and (<= 1 ~switchedOnBeforeTS~0) .cse0 .cse1 .cse2 (<= 1 |ULTIMATE.start_isPumpRunning_#res|)) (and .cse0 (<= 2 ~waterLevel~0) .cse1 .cse2) (and .cse2 (and .cse1 (= ~pumpRunning~0 0))))) [2018-12-31 09:51:11,241 INFO L444 ceAbstractionStarter]: At program point L418-2(lines 418 432) the Hoare annotation is: false [2018-12-31 09:51:11,241 INFO L448 ceAbstractionStarter]: For program point L765(lines 765 771) no Hoare annotation was computed. [2018-12-31 09:51:11,241 INFO L444 ceAbstractionStarter]: At program point L765-1(lines 765 771) the Hoare annotation is: (and (= ULTIMATE.start_test_~splverifierCounter~0 0) (<= ~waterLevel~0 2) (= ~pumpRunning~0 0)) [2018-12-31 09:51:11,241 INFO L448 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-12-31 09:51:11,241 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 961) no Hoare annotation was computed. [2018-12-31 09:51:11,241 INFO L444 ceAbstractionStarter]: At program point L469(lines 465 471) the Hoare annotation is: (and (= ~waterLevel~0 1) (= ~pumpRunning~0 0) (= ~systemActive~0 1)) [2018-12-31 09:51:11,241 INFO L444 ceAbstractionStarter]: At program point L866(lines 857 870) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse1 (<= ~waterLevel~0 2)) (.cse2 (= ~pumpRunning~0 0))) (or (and (<= 2 ~waterLevel~0) .cse0 .cse1 .cse2) (and (not (= 0 |ULTIMATE.start_isHighWaterSensorDry_#res|)) .cse0 .cse1 .cse2))) [2018-12-31 09:51:11,242 INFO L444 ceAbstractionStarter]: At program point L866-1(lines 857 870) the Hoare annotation is: false [2018-12-31 09:51:11,242 INFO L444 ceAbstractionStarter]: At program point L866-2(lines 857 870) the Hoare annotation is: false [2018-12-31 09:51:11,242 INFO L448 ceAbstractionStarter]: For program point L668(lines 668 674) no Hoare annotation was computed. [2018-12-31 09:51:11,242 INFO L448 ceAbstractionStarter]: For program point L635(lines 635 643) no Hoare annotation was computed. [2018-12-31 09:51:11,242 INFO L448 ceAbstractionStarter]: For program point L635-1(lines 635 643) no Hoare annotation was computed. [2018-12-31 09:51:11,242 INFO L448 ceAbstractionStarter]: For program point L668-2(lines 668 674) no Hoare annotation was computed. [2018-12-31 09:51:11,242 INFO L448 ceAbstractionStarter]: For program point L635-2(lines 635 643) no Hoare annotation was computed. [2018-12-31 09:51:11,242 INFO L448 ceAbstractionStarter]: For program point L668-4(lines 668 674) no Hoare annotation was computed. [2018-12-31 09:51:11,242 INFO L448 ceAbstractionStarter]: For program point L784(lines 784 788) no Hoare annotation was computed. [2018-12-31 09:51:11,243 INFO L448 ceAbstractionStarter]: For program point L751(lines 751 755) no Hoare annotation was computed. [2018-12-31 09:51:11,243 INFO L448 ceAbstractionStarter]: For program point L751-2(lines 751 755) no Hoare annotation was computed. [2018-12-31 09:51:11,243 INFO L448 ceAbstractionStarter]: For program point L784-3(lines 784 788) no Hoare annotation was computed. [2018-12-31 09:51:11,243 INFO L448 ceAbstractionStarter]: For program point L751-3(lines 751 755) no Hoare annotation was computed. [2018-12-31 09:51:11,243 INFO L448 ceAbstractionStarter]: For program point L751-5(lines 751 755) no Hoare annotation was computed. [2018-12-31 09:51:11,243 INFO L448 ceAbstractionStarter]: For program point L784-6(lines 784 788) no Hoare annotation was computed. [2018-12-31 09:51:11,243 INFO L448 ceAbstractionStarter]: For program point L553(lines 553 566) no Hoare annotation was computed. [2018-12-31 09:51:11,243 INFO L448 ceAbstractionStarter]: For program point L751-6(lines 751 755) no Hoare annotation was computed. [2018-12-31 09:51:11,243 INFO L448 ceAbstractionStarter]: For program point L751-8(lines 751 755) no Hoare annotation was computed. [2018-12-31 09:51:11,243 INFO L448 ceAbstractionStarter]: For program point L900(lines 900 917) no Hoare annotation was computed. [2018-12-31 09:51:11,244 INFO L444 ceAbstractionStarter]: At program point L900-1(lines 1 964) the Hoare annotation is: (let ((.cse0 (<= 1 ~pumpRunning~0)) (.cse1 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse2 (<= ~waterLevel~0 2))) (or (and (<= 1 ~switchedOnBeforeTS~0) .cse0 .cse1 .cse2 (<= 1 |ULTIMATE.start_isPumpRunning_#res|)) (and .cse2 (and .cse1 (= ~pumpRunning~0 0))) (and .cse0 (<= 2 ~waterLevel~0) (< 1 ULTIMATE.start___utac_acc__Specification5_spec__3_~tmp~8) .cse1 (<= ULTIMATE.start___utac_acc__Specification5_spec__3_~tmp~8 2) .cse2 (<= |ULTIMATE.start_getWaterLevel_#res| 2) (<= 2 |ULTIMATE.start_getWaterLevel_#res|)))) [2018-12-31 09:51:11,244 INFO L448 ceAbstractionStarter]: For program point L900-2(lines 900 917) no Hoare annotation was computed. [2018-12-31 09:51:11,244 INFO L444 ceAbstractionStarter]: At program point L900-3(lines 1 964) the Hoare annotation is: false [2018-12-31 09:51:11,244 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-31 09:51:11,244 INFO L448 ceAbstractionStarter]: For program point L900-4(lines 900 917) no Hoare annotation was computed. [2018-12-31 09:51:11,244 INFO L444 ceAbstractionStarter]: At program point L900-5(lines 1 964) the Hoare annotation is: false [2018-12-31 09:51:11,244 INFO L444 ceAbstractionStarter]: At program point L702(lines 697 705) the Hoare annotation is: (let ((.cse0 (<= 1 ~pumpRunning~0)) (.cse3 (<= 1 |ULTIMATE.start_isPumpRunning_#res|)) (.cse1 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse2 (<= ~waterLevel~0 2))) (or (and (<= 1 ~switchedOnBeforeTS~0) .cse0 .cse1 .cse2 .cse3) (and .cse0 (<= 2 ~waterLevel~0) .cse1 .cse2 .cse3) (and (= 0 |ULTIMATE.start_isPumpRunning_#res|) .cse1 .cse2 (= ~pumpRunning~0 0)))) [2018-12-31 09:51:11,245 INFO L444 ceAbstractionStarter]: At program point L702-1(lines 697 705) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse1 (<= ~waterLevel~0 2))) (or (and (<= 1 ~switchedOnBeforeTS~0) (<= 1 ~pumpRunning~0) .cse0 .cse1 (<= 1 |ULTIMATE.start_isPumpRunning_#res|)) (and (= 0 |ULTIMATE.start_isPumpRunning_#res|) .cse0 .cse1 (= ~pumpRunning~0 0)))) [2018-12-31 09:51:11,245 INFO L444 ceAbstractionStarter]: At program point L702-2(lines 697 705) the Hoare annotation is: false [2018-12-31 09:51:11,245 INFO L444 ceAbstractionStarter]: At program point L702-3(lines 697 705) the Hoare annotation is: false [2018-12-31 09:51:11,245 INFO L444 ceAbstractionStarter]: At program point L702-4(lines 697 705) the Hoare annotation is: false [2018-12-31 09:51:11,245 INFO L444 ceAbstractionStarter]: At program point L702-5(lines 697 705) the Hoare annotation is: false [2018-12-31 09:51:11,245 INFO L448 ceAbstractionStarter]: For program point L422(lines 422 426) no Hoare annotation was computed. [2018-12-31 09:51:11,245 INFO L448 ceAbstractionStarter]: For program point L422-1(lines 422 426) no Hoare annotation was computed. [2018-12-31 09:51:11,245 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 961) no Hoare annotation was computed. [2018-12-31 09:51:11,246 INFO L444 ceAbstractionStarter]: At program point L571(lines 522 572) the Hoare annotation is: false [2018-12-31 09:51:11,246 INFO L444 ceAbstractionStarter]: At program point L952(lines 947 955) the Hoare annotation is: (and (= ~waterLevel~0 1) (= ~pumpRunning~0 0) (= ~systemActive~0 1)) [2018-12-31 09:51:11,246 INFO L444 ceAbstractionStarter]: At program point L853(lines 848 856) the Hoare annotation is: (let ((.cse0 (<= 1 ~pumpRunning~0)) (.cse2 (<= ~waterLevel~0 2)) (.cse1 (= ULTIMATE.start_test_~splverifierCounter~0 0))) (or (and (<= 1 ~switchedOnBeforeTS~0) .cse0 .cse1 .cse2 (<= 1 |ULTIMATE.start_isPumpRunning_#res|)) (and .cse0 (<= 2 ~waterLevel~0) .cse1 .cse2 (<= |ULTIMATE.start_getWaterLevel_#res| 2) (<= 2 |ULTIMATE.start_getWaterLevel_#res|)) (and .cse2 (and .cse1 (= ~pumpRunning~0 0))))) [2018-12-31 09:51:11,246 INFO L444 ceAbstractionStarter]: At program point L853-1(lines 848 856) the Hoare annotation is: false [2018-12-31 09:51:11,246 INFO L444 ceAbstractionStarter]: At program point L853-2(lines 848 856) the Hoare annotation is: false [2018-12-31 09:51:11,246 INFO L444 ceAbstractionStarter]: At program point L606(lines 606 612) the Hoare annotation is: (let ((.cse0 (<= 1 ~pumpRunning~0)) (.cse1 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse2 (<= ~waterLevel~0 2))) (or (and (<= 1 ~switchedOnBeforeTS~0) .cse0 .cse1 .cse2 (<= 1 |ULTIMATE.start_isPumpRunning_#res|)) (and .cse0 (<= 2 ~waterLevel~0) .cse1 .cse2) (and .cse1 .cse2 (= ~pumpRunning~0 0)))) [2018-12-31 09:51:11,246 INFO L444 ceAbstractionStarter]: At program point L606-1(lines 606 612) the Hoare annotation is: false [2018-12-31 09:51:11,246 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-31 09:51:11,247 INFO L444 ceAbstractionStarter]: At program point L606-2(lines 606 612) the Hoare annotation is: false [2018-12-31 09:51:11,247 INFO L451 ceAbstractionStarter]: At program point L507(lines 488 510) the Hoare annotation is: true [2018-12-31 09:51:11,247 INFO L444 ceAbstractionStarter]: At program point L821(lines 816 824) the Hoare annotation is: (and (<= 2 ~waterLevel~0) (= ULTIMATE.start_test_~splverifierCounter~0 0) (<= ~waterLevel~0 2) (= ~pumpRunning~0 0)) [2018-12-31 09:51:11,247 INFO L444 ceAbstractionStarter]: At program point L821-1(lines 816 824) the Hoare annotation is: false [2018-12-31 09:51:11,247 INFO L444 ceAbstractionStarter]: At program point L821-2(lines 816 824) the Hoare annotation is: false [2018-12-31 09:51:11,247 INFO L448 ceAbstractionStarter]: For program point L524(lines 523 570) no Hoare annotation was computed. [2018-12-31 09:51:11,247 INFO L448 ceAbstractionStarter]: For program point L904(lines 904 914) no Hoare annotation was computed. [2018-12-31 09:51:11,247 INFO L448 ceAbstractionStarter]: For program point L904-2(lines 904 914) no Hoare annotation was computed. [2018-12-31 09:51:11,247 INFO L448 ceAbstractionStarter]: For program point L904-4(lines 904 914) no Hoare annotation was computed. [2018-12-31 09:51:11,247 INFO L448 ceAbstractionStarter]: For program point L525(lines 525 529) no Hoare annotation was computed. [2018-12-31 09:51:11,247 INFO L448 ceAbstractionStarter]: For program point L905(lines 905 911) no Hoare annotation was computed. [2018-12-31 09:51:11,248 INFO L448 ceAbstractionStarter]: For program point L905-2(lines 905 911) no Hoare annotation was computed. [2018-12-31 09:51:11,249 INFO L448 ceAbstractionStarter]: For program point L905-4(lines 905 911) no Hoare annotation was computed. [2018-12-31 09:51:11,249 INFO L444 ceAbstractionStarter]: At program point L889(lines 599 605) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse1 (<= ~waterLevel~0 2))) (or (and (<= 1 ~switchedOnBeforeTS~0) (<= 1 ~pumpRunning~0) .cse0 .cse1 (<= 1 |ULTIMATE.start_isPumpRunning_#res|)) (and (= 0 |ULTIMATE.start_isPumpRunning_#res|) .cse0 .cse1 (= ~pumpRunning~0 0)))) [2018-12-31 09:51:11,249 INFO L444 ceAbstractionStarter]: At program point L889-1(lines 599 605) the Hoare annotation is: false [2018-12-31 09:51:11,249 INFO L444 ceAbstractionStarter]: At program point L889-2(lines 599 605) the Hoare annotation is: false [2018-12-31 09:51:11,249 INFO L444 ceAbstractionStarter]: At program point L757(lines 742 760) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse2 (= ~pumpRunning~0 0)) (.cse1 (<= ~waterLevel~0 2))) (or (and (<= 2 ~waterLevel~0) .cse0 .cse1 .cse2) (and (and (not (= 0 ULTIMATE.start_isHighWaterLevel_~tmp~7)) (= 0 |ULTIMATE.start_isHighWaterLevel_#res|) (= 0 ULTIMATE.start_isHighWaterLevel_~tmp___0~1) .cse0 .cse2) .cse1))) [2018-12-31 09:51:11,249 INFO L444 ceAbstractionStarter]: At program point L757-1(lines 742 760) the Hoare annotation is: false [2018-12-31 09:51:11,249 INFO L444 ceAbstractionStarter]: At program point L757-2(lines 742 760) the Hoare annotation is: false [2018-12-31 09:51:11,249 INFO L448 ceAbstractionStarter]: For program point L559(lines 559 565) no Hoare annotation was computed. [2018-12-31 09:51:11,250 INFO L444 ceAbstractionStarter]: At program point L559-1(lines 559 565) the Hoare annotation is: (let ((.cse0 (<= 1 ~pumpRunning~0)) (.cse1 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse2 (<= ~waterLevel~0 2))) (or (and (<= 1 ~switchedOnBeforeTS~0) .cse0 .cse1 .cse2 (<= 1 |ULTIMATE.start_isPumpRunning_#res|)) (and .cse0 (<= 2 ~waterLevel~0) .cse1 .cse2) (and .cse1 .cse2 (= ~pumpRunning~0 0)))) [2018-12-31 09:51:11,250 INFO L448 ceAbstractionStarter]: For program point L543(lines 543 549) no Hoare annotation was computed. [2018-12-31 09:51:11,250 INFO L444 ceAbstractionStarter]: At program point L543-1(lines 543 549) the Hoare annotation is: (let ((.cse0 (<= 1 ~pumpRunning~0)) (.cse2 (<= ~waterLevel~0 2)) (.cse1 (= ULTIMATE.start_test_~splverifierCounter~0 0))) (or (and (<= 1 ~switchedOnBeforeTS~0) .cse0 .cse1 .cse2 (<= 1 |ULTIMATE.start_isPumpRunning_#res|)) (and .cse0 (<= 2 ~waterLevel~0) .cse1 .cse2) (and .cse2 (and .cse1 (= ~pumpRunning~0 0))))) [2018-12-31 09:51:11,250 INFO L448 ceAbstractionStarter]: For program point L808(lines 808 812) no Hoare annotation was computed. [2018-12-31 09:51:11,250 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-12-31 09:51:11,250 INFO L444 ceAbstractionStarter]: At program point L693(lines 686 696) the Hoare annotation is: (and (<= 2 ~waterLevel~0) (= ULTIMATE.start_test_~splverifierCounter~0 0) (<= ~waterLevel~0 2) (= ~pumpRunning~0 0)) [2018-12-31 09:51:11,250 INFO L444 ceAbstractionStarter]: At program point L693-1(lines 686 696) the Hoare annotation is: false [2018-12-31 09:51:11,250 INFO L444 ceAbstractionStarter]: At program point L693-2(lines 686 696) the Hoare annotation is: false [2018-12-31 09:51:11,296 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 09:51:11 BoogieIcfgContainer [2018-12-31 09:51:11,297 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 09:51:11,299 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 09:51:11,299 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 09:51:11,299 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 09:51:11,300 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:50:59" (3/4) ... [2018-12-31 09:51:11,310 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-31 09:51:11,348 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 38 nodes and edges [2018-12-31 09:51:11,348 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2018-12-31 09:51:11,351 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2018-12-31 09:51:11,353 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-12-31 09:51:11,353 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-31 09:51:11,354 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-31 09:51:11,389 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((1 <= switchedOnBeforeTS && 1 <= pumpRunning) && splverifierCounter == 0) && waterLevel <= 2) && 1 <= \result) || (waterLevel <= 2 && splverifierCounter == 0 && pumpRunning == 0)) || (((((((1 <= pumpRunning && 2 <= waterLevel) && 1 < tmp) && splverifierCounter == 0) && tmp <= 2) && waterLevel <= 2) && \result <= 2) && 2 <= \result) [2018-12-31 09:51:11,390 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((1 <= switchedOnBeforeTS && 1 <= pumpRunning) && splverifierCounter == 0) && waterLevel <= 2) && 1 <= \result) || (((1 <= pumpRunning && 2 <= waterLevel) && splverifierCounter == 0) && waterLevel <= 2)) || (waterLevel <= 2 && splverifierCounter == 0 && pumpRunning == 0) [2018-12-31 09:51:11,390 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((1 <= switchedOnBeforeTS && 1 <= pumpRunning) && splverifierCounter == 0) && waterLevel <= 2) && 1 <= \result) || (((1 <= pumpRunning && 2 <= waterLevel) && splverifierCounter == 0) && waterLevel <= 2)) || (waterLevel <= 2 && splverifierCounter == 0 && pumpRunning == 0) [2018-12-31 09:51:11,390 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((1 <= switchedOnBeforeTS && 1 <= pumpRunning) && splverifierCounter == 0) && waterLevel <= 2) && 1 <= \result) || (((1 <= pumpRunning && 2 <= waterLevel) && splverifierCounter == 0) && waterLevel <= 2)) || ((splverifierCounter == 0 && waterLevel <= 2) && pumpRunning == 0) [2018-12-31 09:51:11,391 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((1 <= switchedOnBeforeTS && 1 <= pumpRunning) && splverifierCounter == 0) && waterLevel <= 2) && 1 <= \result) || ((((1 <= pumpRunning && 2 <= waterLevel) && splverifierCounter == 0) && waterLevel <= 2) && 1 <= \result)) || (((0 == \result && splverifierCounter == 0) && waterLevel <= 2) && pumpRunning == 0) [2018-12-31 09:51:11,391 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((1 <= switchedOnBeforeTS && 1 <= pumpRunning) && splverifierCounter == 0) && waterLevel <= 2) && 1 <= \result) || (((0 == \result && splverifierCounter == 0) && waterLevel <= 2) && pumpRunning == 0) [2018-12-31 09:51:11,392 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((1 <= switchedOnBeforeTS && 1 <= pumpRunning) && splverifierCounter == 0) && waterLevel <= 2) && 1 <= \result) || ((splverifierCounter == 0 && waterLevel <= 2) && pumpRunning == 0) [2018-12-31 09:51:11,392 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((1 <= switchedOnBeforeTS && 1 <= pumpRunning) && splverifierCounter == 0) && waterLevel <= 2) && 1 <= \result) || (((1 <= pumpRunning && 2 <= waterLevel) && splverifierCounter == 0) && waterLevel <= 2)) || ((splverifierCounter == 0 && waterLevel <= 2) && pumpRunning == 0) [2018-12-31 09:51:11,393 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((1 <= switchedOnBeforeTS && 1 <= pumpRunning) && splverifierCounter == 0) && waterLevel <= 2) && 1 <= \result) || (((((1 <= pumpRunning && 2 <= waterLevel) && splverifierCounter == 0) && waterLevel <= 2) && \result <= 2) && 2 <= \result)) || (waterLevel <= 2 && splverifierCounter == 0 && pumpRunning == 0) [2018-12-31 09:51:11,393 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((2 <= waterLevel && splverifierCounter == 0) && waterLevel <= 2) && pumpRunning == 0) || (((!(0 == \result) && splverifierCounter == 0) && waterLevel <= 2) && pumpRunning == 0) [2018-12-31 09:51:11,394 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((1 <= switchedOnBeforeTS && 1 <= pumpRunning) && splverifierCounter == 0) && waterLevel <= 2) && 1 <= \result) || (((0 == \result && splverifierCounter == 0) && waterLevel <= 2) && pumpRunning == 0) [2018-12-31 09:51:11,394 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((2 <= waterLevel && splverifierCounter == 0) && waterLevel <= 2) && pumpRunning == 0) || (((((!(0 == tmp) && 0 == \result) && 0 == tmp___0) && splverifierCounter == 0) && pumpRunning == 0) && waterLevel <= 2) [2018-12-31 09:51:11,484 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 09:51:11,484 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 09:51:11,485 INFO L168 Benchmark]: Toolchain (without parser) took 14274.74 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 296.2 MB). Free memory was 952.7 MB in the beginning and 1.2 GB in the end (delta: -293.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 11.5 GB. [2018-12-31 09:51:11,486 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 09:51:11,486 INFO L168 Benchmark]: CACSL2BoogieTranslator took 761.16 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.4 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -162.3 MB). Peak memory consumption was 39.5 MB. Max. memory is 11.5 GB. [2018-12-31 09:51:11,487 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.01 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-12-31 09:51:11,487 INFO L168 Benchmark]: Boogie Preprocessor took 42.66 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 09:51:11,487 INFO L168 Benchmark]: RCFGBuilder took 1369.86 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.6 MB). Peak memory consumption was 60.6 MB. Max. memory is 11.5 GB. [2018-12-31 09:51:11,488 INFO L168 Benchmark]: TraceAbstraction took 11833.67 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 179.8 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -213.6 MB). Peak memory consumption was 356.0 MB. Max. memory is 11.5 GB. [2018-12-31 09:51:11,488 INFO L168 Benchmark]: Witness Printer took 185.35 ms. Allocated memory is still 1.3 GB. Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 11.5 GB. [2018-12-31 09:51:11,490 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 761.16 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.4 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -162.3 MB). Peak memory consumption was 39.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 77.01 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.66 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1369.86 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.6 MB). Peak memory consumption was 60.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11833.67 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 179.8 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -213.6 MB). Peak memory consumption was 356.0 MB. Max. memory is 11.5 GB. * Witness Printer took 185.35 ms. Allocated memory is still 1.3 GB. Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 961]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 961]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 961]: 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: 697]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 559]: Loop Invariant Derived loop invariant: (((((1 <= switchedOnBeforeTS && 1 <= pumpRunning) && splverifierCounter == 0) && waterLevel <= 2) && 1 <= \result) || (((1 <= pumpRunning && 2 <= waterLevel) && splverifierCounter == 0) && waterLevel <= 2)) || ((splverifierCounter == 0 && waterLevel <= 2) && pumpRunning == 0) - InvariantResult [Line: 947]: Loop Invariant Derived loop invariant: (waterLevel == 1 && pumpRunning == 0) && systemActive == 1 - InvariantResult [Line: 857]: Loop Invariant Derived loop invariant: (((2 <= waterLevel && splverifierCounter == 0) && waterLevel <= 2) && pumpRunning == 0) || (((!(0 == \result) && splverifierCounter == 0) && waterLevel <= 2) && pumpRunning == 0) - InvariantResult [Line: 595]: Loop Invariant Derived loop invariant: ((((1 <= switchedOnBeforeTS && 1 <= pumpRunning) && splverifierCounter == 0) && waterLevel <= 2) && 1 <= \result) || ((splverifierCounter == 0 && waterLevel <= 2) && pumpRunning == 0) - InvariantResult [Line: 857]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 595]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 857]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 418]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 465]: Loop Invariant Derived loop invariant: (waterLevel == 1 && pumpRunning == 0) && systemActive == 1 - InvariantResult [Line: 848]: Loop Invariant Derived loop invariant: (((((1 <= switchedOnBeforeTS && 1 <= pumpRunning) && splverifierCounter == 0) && waterLevel <= 2) && 1 <= \result) || (((((1 <= pumpRunning && 2 <= waterLevel) && splverifierCounter == 0) && waterLevel <= 2) && \result <= 2) && 2 <= \result)) || (waterLevel <= 2 && splverifierCounter == 0 && pumpRunning == 0) - InvariantResult [Line: 595]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 742]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 816]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 686]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 543]: Loop Invariant Derived loop invariant: (((((1 <= switchedOnBeforeTS && 1 <= pumpRunning) && splverifierCounter == 0) && waterLevel <= 2) && 1 <= \result) || (((1 <= pumpRunning && 2 <= waterLevel) && splverifierCounter == 0) && waterLevel <= 2)) || (waterLevel <= 2 && splverifierCounter == 0 && pumpRunning == 0) - InvariantResult [Line: 697]: Loop Invariant Derived loop invariant: (((((1 <= switchedOnBeforeTS && 1 <= pumpRunning) && splverifierCounter == 0) && waterLevel <= 2) && 1 <= \result) || ((((1 <= pumpRunning && 2 <= waterLevel) && splverifierCounter == 0) && waterLevel <= 2) && 1 <= \result)) || (((0 == \result && splverifierCounter == 0) && waterLevel <= 2) && pumpRunning == 0) - InvariantResult [Line: 742]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 816]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 686]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 697]: Loop Invariant Derived loop invariant: ((((1 <= switchedOnBeforeTS && 1 <= pumpRunning) && splverifierCounter == 0) && waterLevel <= 2) && 1 <= \result) || (((0 == \result && splverifierCounter == 0) && waterLevel <= 2) && pumpRunning == 0) - InvariantResult [Line: 697]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 697]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 697]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 874]: Loop Invariant Derived loop invariant: (waterLevel == 1 && pumpRunning == 0) && systemActive == 1 - InvariantResult [Line: 599]: Loop Invariant Derived loop invariant: ((((1 <= switchedOnBeforeTS && 1 <= pumpRunning) && splverifierCounter == 0) && waterLevel <= 2) && 1 <= \result) || (((0 == \result && splverifierCounter == 0) && waterLevel <= 2) && pumpRunning == 0) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((1 <= switchedOnBeforeTS && 1 <= pumpRunning) && splverifierCounter == 0) && waterLevel <= 2) && 1 <= \result) || (waterLevel <= 2 && splverifierCounter == 0 && pumpRunning == 0)) || (((((((1 <= pumpRunning && 2 <= waterLevel) && 1 < tmp) && splverifierCounter == 0) && tmp <= 2) && waterLevel <= 2) && \result <= 2) && 2 <= \result) - InvariantResult [Line: 599]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 599]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 742]: Loop Invariant Derived loop invariant: (((2 <= waterLevel && splverifierCounter == 0) && waterLevel <= 2) && pumpRunning == 0) || (((((!(0 == tmp) && 0 == \result) && 0 == tmp___0) && splverifierCounter == 0) && pumpRunning == 0) && waterLevel <= 2) - InvariantResult [Line: 816]: Loop Invariant Derived loop invariant: ((2 <= waterLevel && splverifierCounter == 0) && waterLevel <= 2) && pumpRunning == 0 - InvariantResult [Line: 686]: Loop Invariant Derived loop invariant: ((2 <= waterLevel && splverifierCounter == 0) && waterLevel <= 2) && pumpRunning == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 533]: Loop Invariant Derived loop invariant: (((((1 <= switchedOnBeforeTS && 1 <= pumpRunning) && splverifierCounter == 0) && waterLevel <= 2) && 1 <= \result) || (((1 <= pumpRunning && 2 <= waterLevel) && splverifierCounter == 0) && waterLevel <= 2)) || (waterLevel <= 2 && splverifierCounter == 0 && pumpRunning == 0) - InvariantResult [Line: 848]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: (((((1 <= switchedOnBeforeTS && 1 <= pumpRunning) && splverifierCounter == 0) && waterLevel <= 2) && 1 <= \result) || (((1 <= pumpRunning && 2 <= waterLevel) && splverifierCounter == 0) && waterLevel <= 2)) || ((splverifierCounter == 0 && waterLevel <= 2) && pumpRunning == 0) - InvariantResult [Line: 848]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 765]: Loop Invariant Derived loop invariant: (splverifierCounter == 0 && waterLevel <= 2) && pumpRunning == 0 - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 498]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 488]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 522]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (waterLevel == 1 && pumpRunning == 0) && systemActive == 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 98 locations, 3 error locations. SAFE Result, 11.7s OverallTime, 10 OverallIterations, 2 TraceHistogramMax, 3.4s AutomataDifference, 0.0s DeadEndRemovalTime, 4.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 902 SDtfs, 1222 SDslu, 1406 SDs, 0 SdLazy, 239 SolverSat, 64 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 123 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=269occurred 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.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 698 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 45 LocationsWithAnnotation, 45 PreInvPairs, 181 NumberOfFragments, 561 HoareAnnotationTreeSize, 45 FomulaSimplifications, 81729 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 45 FomulaSimplificationsInter, 10740 FormulaSimplificationTreeSizeReductionInter, 4.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 374 NumberOfCodeBlocks, 374 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 363 ConstructedInterpolants, 0 QuantifiedInterpolants, 31064 SizeOfPredicates, 4 NumberOfNonLiveVariables, 412 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 11 InterpolantComputations, 9 PerfectInterpolantSequences, 14/32 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...