./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec5_product41_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_product41_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 5f4fa6f1cc0ba42b6f98a2dfe04ac0e8501306bf ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:54,834 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 09:50:54,836 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 09:50:54,849 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 09:50:54,849 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 09:50:54,850 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 09:50:54,852 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 09:50:54,854 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 09:50:54,856 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 09:50:54,857 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 09:50:54,858 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 09:50:54,859 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 09:50:54,860 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 09:50:54,861 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 09:50:54,862 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 09:50:54,863 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 09:50:54,864 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 09:50:54,867 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 09:50:54,869 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 09:50:54,871 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 09:50:54,872 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 09:50:54,874 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 09:50:54,877 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 09:50:54,878 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 09:50:54,878 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 09:50:54,879 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 09:50:54,880 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 09:50:54,881 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 09:50:54,882 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 09:50:54,884 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 09:50:54,884 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 09:50:54,885 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 09:50:54,885 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 09:50:54,886 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 09:50:54,887 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 09:50:54,888 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 09:50:54,888 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:54,905 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 09:50:54,905 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 09:50:54,906 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 09:50:54,907 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 09:50:54,907 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 09:50:54,907 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 09:50:54,907 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 09:50:54,907 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 09:50:54,908 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 09:50:54,908 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 09:50:54,908 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 09:50:54,908 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 09:50:54,908 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 09:50:54,908 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 09:50:54,909 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 09:50:54,909 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 09:50:54,909 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 09:50:54,909 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 09:50:54,909 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 09:50:54,911 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 09:50:54,912 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 09:50:54,912 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 09:50:54,912 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 09:50:54,912 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 09:50:54,912 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 09:50:54,912 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 09:50:54,913 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 09:50:54,913 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 09:50:54,913 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 -> 5f4fa6f1cc0ba42b6f98a2dfe04ac0e8501306bf [2018-12-31 09:50:54,952 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 09:50:54,965 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 09:50:54,969 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 09:50:54,970 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 09:50:54,971 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 09:50:54,972 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec5_product41_true-unreach-call_false-termination.cil.c [2018-12-31 09:50:55,027 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c905219b/3df868089801415b8ee3e31582ef9293/FLAG458a0e031 [2018-12-31 09:50:55,537 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 09:50:55,538 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec5_product41_true-unreach-call_false-termination.cil.c [2018-12-31 09:50:55,550 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c905219b/3df868089801415b8ee3e31582ef9293/FLAG458a0e031 [2018-12-31 09:50:55,831 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c905219b/3df868089801415b8ee3e31582ef9293 [2018-12-31 09:50:55,834 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 09:50:55,836 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 09:50:55,837 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 09:50:55,837 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 09:50:55,841 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 09:50:55,842 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:50:55" (1/1) ... [2018-12-31 09:50:55,848 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c578d12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:50:55, skipping insertion in model container [2018-12-31 09:50:55,849 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:50:55" (1/1) ... [2018-12-31 09:50:55,858 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 09:50:55,910 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 09:50:56,303 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 09:50:56,335 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 09:50:56,561 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 09:50:56,616 INFO L195 MainTranslator]: Completed translation [2018-12-31 09:50:56,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:50:56 WrapperNode [2018-12-31 09:50:56,617 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 09:50:56,618 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 09:50:56,618 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 09:50:56,618 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 09:50:56,629 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:56" (1/1) ... [2018-12-31 09:50:56,648 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:56" (1/1) ... [2018-12-31 09:50:56,694 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 09:50:56,695 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 09:50:56,695 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 09:50:56,695 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 09:50:56,705 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:56" (1/1) ... [2018-12-31 09:50:56,706 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:56" (1/1) ... [2018-12-31 09:50:56,711 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:56" (1/1) ... [2018-12-31 09:50:56,711 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:56" (1/1) ... [2018-12-31 09:50:56,725 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:56" (1/1) ... [2018-12-31 09:50:56,734 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:56" (1/1) ... [2018-12-31 09:50:56,737 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:56" (1/1) ... [2018-12-31 09:50:56,742 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 09:50:56,743 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 09:50:56,743 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 09:50:56,743 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 09:50:56,744 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:50:56" (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:56,817 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 09:50:56,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-31 09:50:56,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 09:50:56,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 09:50:58,177 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 09:50:58,177 INFO L280 CfgBuilder]: Removed 128 assue(true) statements. [2018-12-31 09:50:58,178 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:50:58 BoogieIcfgContainer [2018-12-31 09:50:58,178 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 09:50:58,179 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 09:50:58,179 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 09:50:58,183 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 09:50:58,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 09:50:55" (1/3) ... [2018-12-31 09:50:58,184 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63b1e082 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:50:58, skipping insertion in model container [2018-12-31 09:50:58,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:50:56" (2/3) ... [2018-12-31 09:50:58,185 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63b1e082 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:50:58, skipping insertion in model container [2018-12-31 09:50:58,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:50:58" (3/3) ... [2018-12-31 09:50:58,187 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec5_product41_true-unreach-call_false-termination.cil.c [2018-12-31 09:50:58,198 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 09:50:58,207 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-31 09:50:58,226 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-31 09:50:58,262 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 09:50:58,263 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 09:50:58,263 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 09:50:58,264 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 09:50:58,267 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 09:50:58,267 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 09:50:58,267 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 09:50:58,267 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 09:50:58,268 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 09:50:58,286 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states. [2018-12-31 09:50:58,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-31 09:50:58,294 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:50:58,295 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:58,297 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:50:58,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:50:58,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1151374926, now seen corresponding path program 1 times [2018-12-31 09:50:58,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:50:58,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:50:58,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:50:58,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:50:58,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:50:58,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:50:58,618 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:58,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:50:58,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 09:50:58,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 09:50:58,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 09:50:58,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 09:50:58,649 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 2 states. [2018-12-31 09:50:58,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:50:58,692 INFO L93 Difference]: Finished difference Result 185 states and 274 transitions. [2018-12-31 09:50:58,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 09:50:58,693 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-12-31 09:50:58,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:50:58,707 INFO L225 Difference]: With dead ends: 185 [2018-12-31 09:50:58,708 INFO L226 Difference]: Without dead ends: 92 [2018-12-31 09:50:58,712 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:58,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-31 09:50:58,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-12-31 09:50:58,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-12-31 09:50:58,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 129 transitions. [2018-12-31 09:50:58,762 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 129 transitions. Word has length 19 [2018-12-31 09:50:58,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:50:58,763 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 129 transitions. [2018-12-31 09:50:58,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 09:50:58,763 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 129 transitions. [2018-12-31 09:50:58,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-31 09:50:58,764 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:50:58,765 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:58,765 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:50:58,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:50:58,765 INFO L82 PathProgramCache]: Analyzing trace with hash 654644627, now seen corresponding path program 1 times [2018-12-31 09:50:58,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:50:58,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:50:58,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:50:58,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:50:58,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:50:58,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:50:58,931 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:58,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:50:58,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 09:50:58,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:50:58,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:50:58,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:50:58,935 INFO L87 Difference]: Start difference. First operand 92 states and 129 transitions. Second operand 3 states. [2018-12-31 09:50:58,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:50:58,962 INFO L93 Difference]: Finished difference Result 92 states and 129 transitions. [2018-12-31 09:50:58,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:50:58,962 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-31 09:50:58,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:50:58,963 INFO L225 Difference]: With dead ends: 92 [2018-12-31 09:50:58,964 INFO L226 Difference]: Without dead ends: 41 [2018-12-31 09:50:58,966 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:50:58,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-31 09:50:58,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-31 09:50:58,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-31 09:50:58,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 57 transitions. [2018-12-31 09:50:58,976 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 57 transitions. Word has length 20 [2018-12-31 09:50:58,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:50:58,978 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 57 transitions. [2018-12-31 09:50:58,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:50:58,979 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 57 transitions. [2018-12-31 09:50:58,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-31 09:50:58,980 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:50:58,980 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:50:58,980 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:50:58,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:50:58,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1356458264, now seen corresponding path program 1 times [2018-12-31 09:50:58,982 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:50:58,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:50:58,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:50:58,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:50:58,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:50:59,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:50:59,114 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,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:50:59,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 09:50:59,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:50:59,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:50:59,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:50:59,117 INFO L87 Difference]: Start difference. First operand 41 states and 57 transitions. Second operand 3 states. [2018-12-31 09:50:59,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:50:59,139 INFO L93 Difference]: Finished difference Result 75 states and 107 transitions. [2018-12-31 09:50:59,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:50:59,140 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-31 09:50:59,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:50:59,141 INFO L225 Difference]: With dead ends: 75 [2018-12-31 09:50:59,142 INFO L226 Difference]: Without dead ends: 41 [2018-12-31 09:50:59,143 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:50:59,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-31 09:50:59,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-31 09:50:59,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-31 09:50:59,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 56 transitions. [2018-12-31 09:50:59,150 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 56 transitions. Word has length 26 [2018-12-31 09:50:59,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:50:59,150 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 56 transitions. [2018-12-31 09:50:59,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:50:59,151 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 56 transitions. [2018-12-31 09:50:59,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-31 09:50:59,153 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:50:59,153 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:50:59,153 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:50:59,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:50:59,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1948968251, now seen corresponding path program 1 times [2018-12-31 09:50:59,154 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:50:59,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:50:59,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:50:59,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:50:59,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:50:59,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:50:59,289 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,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:50:59,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 09:50:59,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:50:59,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:50:59,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:50:59,291 INFO L87 Difference]: Start difference. First operand 41 states and 56 transitions. Second operand 3 states. [2018-12-31 09:50:59,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:50:59,400 INFO L93 Difference]: Finished difference Result 99 states and 139 transitions. [2018-12-31 09:50:59,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:50:59,401 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-31 09:50:59,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:50:59,402 INFO L225 Difference]: With dead ends: 99 [2018-12-31 09:50:59,402 INFO L226 Difference]: Without dead ends: 65 [2018-12-31 09:50:59,403 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:50:59,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-31 09:50:59,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2018-12-31 09:50:59,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-31 09:50:59,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 87 transitions. [2018-12-31 09:50:59,413 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 87 transitions. Word has length 27 [2018-12-31 09:50:59,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:50:59,413 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 87 transitions. [2018-12-31 09:50:59,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:50:59,413 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 87 transitions. [2018-12-31 09:50:59,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-31 09:50:59,415 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:50:59,415 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] [2018-12-31 09:50:59,415 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:50:59,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:50:59,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1806698503, now seen corresponding path program 1 times [2018-12-31 09:50:59,416 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:50:59,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:50:59,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:50:59,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:50:59,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:50:59,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:50:59,711 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,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:50:59,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 09:50:59,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:50:59,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:50:59,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:50:59,713 INFO L87 Difference]: Start difference. First operand 63 states and 87 transitions. Second operand 5 states. [2018-12-31 09:51:00,173 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-12-31 09:51:00,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:51:00,439 INFO L93 Difference]: Finished difference Result 216 states and 304 transitions. [2018-12-31 09:51:00,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 09:51:00,439 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-12-31 09:51:00,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:51:00,441 INFO L225 Difference]: With dead ends: 216 [2018-12-31 09:51:00,441 INFO L226 Difference]: Without dead ends: 160 [2018-12-31 09:51:00,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-31 09:51:00,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-12-31 09:51:00,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 62. [2018-12-31 09:51:00,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-31 09:51:00,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 84 transitions. [2018-12-31 09:51:00,456 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 84 transitions. Word has length 33 [2018-12-31 09:51:00,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:51:00,456 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 84 transitions. [2018-12-31 09:51:00,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:51:00,456 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 84 transitions. [2018-12-31 09:51:00,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-31 09:51:00,458 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:51:00,458 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:00,458 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:51:00,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:51:00,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1255671478, now seen corresponding path program 1 times [2018-12-31 09:51:00,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:51:00,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:51:00,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:51:00,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:51:00,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:51:00,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:51:00,743 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,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:51:00,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 09:51:00,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:51:00,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:51:00,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:51:00,746 INFO L87 Difference]: Start difference. First operand 62 states and 84 transitions. Second operand 5 states. [2018-12-31 09:51:01,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:51:01,249 INFO L93 Difference]: Finished difference Result 161 states and 220 transitions. [2018-12-31 09:51:01,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 09:51:01,250 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2018-12-31 09:51:01,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:51:01,252 INFO L225 Difference]: With dead ends: 161 [2018-12-31 09:51:01,252 INFO L226 Difference]: Without dead ends: 106 [2018-12-31 09:51:01,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-31 09:51:01,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-12-31 09:51:01,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 65. [2018-12-31 09:51:01,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-31 09:51:01,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 87 transitions. [2018-12-31 09:51:01,276 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 87 transitions. Word has length 36 [2018-12-31 09:51:01,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:51:01,280 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 87 transitions. [2018-12-31 09:51:01,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:51:01,280 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 87 transitions. [2018-12-31 09:51:01,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-31 09:51:01,281 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:51:01,282 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,284 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:51:01,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:51:01,284 INFO L82 PathProgramCache]: Analyzing trace with hash 244554228, now seen corresponding path program 1 times [2018-12-31 09:51:01,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:51:01,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:51:01,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:51:01,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:51:01,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:51:01,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:51:01,439 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,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:51:01,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 09:51:01,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 09:51:01,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 09:51:01,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 09:51:01,442 INFO L87 Difference]: Start difference. First operand 65 states and 87 transitions. Second operand 4 states. [2018-12-31 09:51:01,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:51:01,576 INFO L93 Difference]: Finished difference Result 149 states and 201 transitions. [2018-12-31 09:51:01,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 09:51:01,576 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-12-31 09:51:01,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:51:01,577 INFO L225 Difference]: With dead ends: 149 [2018-12-31 09:51:01,577 INFO L226 Difference]: Without dead ends: 91 [2018-12-31 09:51:01,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:51:01,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-31 09:51:01,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 67. [2018-12-31 09:51:01,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-31 09:51:01,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 89 transitions. [2018-12-31 09:51:01,590 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 89 transitions. Word has length 36 [2018-12-31 09:51:01,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:51:01,590 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 89 transitions. [2018-12-31 09:51:01,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 09:51:01,591 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 89 transitions. [2018-12-31 09:51:01,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-31 09:51:01,592 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:51:01,592 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,592 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:51:01,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:51:01,593 INFO L82 PathProgramCache]: Analyzing trace with hash -776514126, now seen corresponding path program 1 times [2018-12-31 09:51:01,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:51:01,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:51:01,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:51:01,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:51:01,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:51:01,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:51:01,721 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,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:51:01,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 09:51:01,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:51:01,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:51:01,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:51:01,724 INFO L87 Difference]: Start difference. First operand 67 states and 89 transitions. Second operand 3 states. [2018-12-31 09:51:01,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:51:01,877 INFO L93 Difference]: Finished difference Result 154 states and 206 transitions. [2018-12-31 09:51:01,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:51:01,878 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-12-31 09:51:01,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:51:01,879 INFO L225 Difference]: With dead ends: 154 [2018-12-31 09:51:01,879 INFO L226 Difference]: Without dead ends: 94 [2018-12-31 09:51:01,880 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:01,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-12-31 09:51:01,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-12-31 09:51:01,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-31 09:51:01,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 122 transitions. [2018-12-31 09:51:01,897 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 122 transitions. Word has length 36 [2018-12-31 09:51:01,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:51:01,898 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 122 transitions. [2018-12-31 09:51:01,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:51:01,898 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 122 transitions. [2018-12-31 09:51:01,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-31 09:51:01,899 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:51:01,900 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:01,900 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:51:01,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:51:01,900 INFO L82 PathProgramCache]: Analyzing trace with hash 2043974386, now seen corresponding path program 1 times [2018-12-31 09:51:01,900 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:51:01,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:51:01,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:51:01,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:51:01,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:51:01,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:51:02,196 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,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:51:02,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 09:51:02,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 09:51:02,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 09:51:02,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-31 09:51:02,198 INFO L87 Difference]: Start difference. First operand 94 states and 122 transitions. Second operand 6 states. [2018-12-31 09:51:02,590 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-12-31 09:51:03,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:51:03,546 INFO L93 Difference]: Finished difference Result 339 states and 457 transitions. [2018-12-31 09:51:03,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 09:51:03,547 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2018-12-31 09:51:03,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:51:03,549 INFO L225 Difference]: With dead ends: 339 [2018-12-31 09:51:03,549 INFO L226 Difference]: Without dead ends: 279 [2018-12-31 09:51:03,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-12-31 09:51:03,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-12-31 09:51:03,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 135. [2018-12-31 09:51:03,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-12-31 09:51:03,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 174 transitions. [2018-12-31 09:51:03,575 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 174 transitions. Word has length 37 [2018-12-31 09:51:03,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:51:03,575 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 174 transitions. [2018-12-31 09:51:03,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 09:51:03,575 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 174 transitions. [2018-12-31 09:51:03,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-31 09:51:03,577 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:51:03,577 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:03,578 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:51:03,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:51:03,578 INFO L82 PathProgramCache]: Analyzing trace with hash 146896004, now seen corresponding path program 1 times [2018-12-31 09:51:03,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:51:03,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:51:03,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:51:03,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:51:03,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:51:03,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:51:03,730 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:03,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 09:51:03,731 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:03,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:51:03,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:51:03,852 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 09:51:04,037 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:04,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 09:51:04,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-12-31 09:51:04,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 09:51:04,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 09:51:04,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-31 09:51:04,060 INFO L87 Difference]: Start difference. First operand 135 states and 174 transitions. Second operand 8 states. [2018-12-31 09:51:04,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:51:04,504 INFO L93 Difference]: Finished difference Result 242 states and 319 transitions. [2018-12-31 09:51:04,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 09:51:04,506 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2018-12-31 09:51:04,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:51:04,507 INFO L225 Difference]: With dead ends: 242 [2018-12-31 09:51:04,507 INFO L226 Difference]: Without dead ends: 0 [2018-12-31 09:51:04,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-12-31 09:51:04,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-31 09:51:04,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-31 09:51:04,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-31 09:51:04,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-31 09:51:04,511 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 54 [2018-12-31 09:51:04,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:51:04,511 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-31 09:51:04,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 09:51:04,512 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-31 09:51:04,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-31 09:51:04,519 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-31 09:51:04,589 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:04,591 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:04,597 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:04,614 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:04,621 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:04,623 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:04,631 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:04,753 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:04,755 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:04,758 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:04,759 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:04,772 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:04,792 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:04,796 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:04,798 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:04,800 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:04,818 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:04,821 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:04,828 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:04,845 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:04,846 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:04,850 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:04,856 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:04,859 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:04,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:04,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:04,914 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:04,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:04,925 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:51:05,942 WARN L181 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 29 DAG size of output: 17 [2018-12-31 09:51:06,162 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 22 [2018-12-31 09:51:06,628 WARN L181 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 21 [2018-12-31 09:51:06,809 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 24 [2018-12-31 09:51:06,975 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 22 [2018-12-31 09:51:07,567 WARN L181 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 26 [2018-12-31 09:51:07,715 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 22 [2018-12-31 09:51:07,857 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 22 [2018-12-31 09:51:07,966 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 20 [2018-12-31 09:51:08,169 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 25 [2018-12-31 09:51:08,175 INFO L448 ceAbstractionStarter]: For program point L481(lines 480 525) no Hoare annotation was computed. [2018-12-31 09:51:08,176 INFO L444 ceAbstractionStarter]: At program point L465(lines 450 468) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse3 (<= ~waterLevel~0 2)) (.cse1 (= ~pumpRunning~0 0)) (.cse2 (= ~systemActive~0 1))) (or (and (and (= 0 |ULTIMATE.start_isHighWaterLevel_#res|) (= 0 ULTIMATE.start_isHighWaterLevel_~tmp___0~1) .cse0 .cse1 .cse2) .cse3) (and (<= 2 ~waterLevel~0) .cse0 .cse3 .cse1 .cse2))) [2018-12-31 09:51:08,176 INFO L444 ceAbstractionStarter]: At program point L465-1(lines 450 468) the Hoare annotation is: false [2018-12-31 09:51:08,176 INFO L444 ceAbstractionStarter]: At program point L465-2(lines 450 468) the Hoare annotation is: false [2018-12-31 09:51:08,176 INFO L448 ceAbstractionStarter]: For program point L482(lines 482 486) no Hoare annotation was computed. [2018-12-31 09:51:08,176 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-31 09:51:08,176 INFO L448 ceAbstractionStarter]: For program point L70(lines 70 87) no Hoare annotation was computed. [2018-12-31 09:51:08,177 INFO L444 ceAbstractionStarter]: At program point L70-1(lines 1 943) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse1 (<= ~waterLevel~0 2)) (.cse2 (= 1 ~pumpRunning~0)) (.cse3 (= ~systemActive~0 1))) (or (and (<= 2 ~waterLevel~0) .cse0 (= 2 |ULTIMATE.start_getWaterLevel_#res|) .cse1 .cse2 (= ULTIMATE.start___utac_acc__Specification5_spec__3_~tmp~0 2) .cse3) (and .cse1 (and .cse0 (= ~pumpRunning~0 0) .cse3)) (and .cse0 (= ~switchedOnBeforeTS~0 1) .cse1 .cse2 (= 1 |ULTIMATE.start_isPumpRunning_#res|) .cse3))) [2018-12-31 09:51:08,177 INFO L448 ceAbstractionStarter]: For program point L516(lines 516 520) no Hoare annotation was computed. [2018-12-31 09:51:08,177 INFO L448 ceAbstractionStarter]: For program point L70-2(lines 70 87) no Hoare annotation was computed. [2018-12-31 09:51:08,177 INFO L444 ceAbstractionStarter]: At program point L70-3(lines 1 943) the Hoare annotation is: false [2018-12-31 09:51:08,177 INFO L448 ceAbstractionStarter]: For program point L516-2(lines 510 521) no Hoare annotation was computed. [2018-12-31 09:51:08,177 INFO L448 ceAbstractionStarter]: For program point L70-4(lines 70 87) no Hoare annotation was computed. [2018-12-31 09:51:08,177 INFO L444 ceAbstractionStarter]: At program point L70-5(lines 1 943) the Hoare annotation is: false [2018-12-31 09:51:08,177 INFO L444 ceAbstractionStarter]: At program point L186(lines 177 190) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse1 (<= ~waterLevel~0 2)) (.cse2 (= ~pumpRunning~0 0)) (.cse3 (= ~systemActive~0 1))) (or (and .cse0 .cse1 (= 1 |ULTIMATE.start_isHighWaterSensorDry_#res|) .cse2 .cse3) (and (<= 2 ~waterLevel~0) .cse0 .cse1 .cse2 .cse3))) [2018-12-31 09:51:08,178 INFO L444 ceAbstractionStarter]: At program point L186-1(lines 177 190) the Hoare annotation is: false [2018-12-31 09:51:08,178 INFO L444 ceAbstractionStarter]: At program point L186-2(lines 177 190) the Hoare annotation is: false [2018-12-31 09:51:08,178 INFO L448 ceAbstractionStarter]: For program point L500(lines 500 506) no Hoare annotation was computed. [2018-12-31 09:51:08,178 INFO L444 ceAbstractionStarter]: At program point L500-1(lines 500 506) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse1 (<= ~waterLevel~0 2)) (.cse2 (= 1 ~pumpRunning~0)) (.cse3 (= ~systemActive~0 1))) (or (and (<= 2 ~waterLevel~0) .cse0 .cse1 .cse2 .cse3) (and .cse1 (and .cse0 (= ~pumpRunning~0 0) .cse3)) (and .cse0 (= ~switchedOnBeforeTS~0 1) .cse1 .cse2 (= 1 |ULTIMATE.start_isPumpRunning_#res|) .cse3))) [2018-12-31 09:51:08,178 INFO L444 ceAbstractionStarter]: At program point L401(lines 394 404) the Hoare annotation is: (and (<= 2 ~waterLevel~0) (= ULTIMATE.start_test_~splverifierCounter~0 0) (<= ~waterLevel~0 2) (= ~pumpRunning~0 0) (= ~systemActive~0 1)) [2018-12-31 09:51:08,178 INFO L444 ceAbstractionStarter]: At program point L401-1(lines 394 404) the Hoare annotation is: false [2018-12-31 09:51:08,178 INFO L444 ceAbstractionStarter]: At program point L401-2(lines 394 404) the Hoare annotation is: false [2018-12-31 09:51:08,178 INFO L448 ceAbstractionStarter]: For program point L104(lines 104 108) no Hoare annotation was computed. [2018-12-31 09:51:08,178 INFO L448 ceAbstractionStarter]: For program point L104-3(lines 104 108) no Hoare annotation was computed. [2018-12-31 09:51:08,179 INFO L448 ceAbstractionStarter]: For program point L104-6(lines 104 108) no Hoare annotation was computed. [2018-12-31 09:51:08,179 INFO L444 ceAbstractionStarter]: At program point L253(lines 249 255) the Hoare annotation is: (and (= ~waterLevel~0 1) (= ~pumpRunning~0 0) (= ~systemActive~0 1)) [2018-12-31 09:51:08,179 INFO L444 ceAbstractionStarter]: At program point L204-2(lines 204 218) the Hoare annotation is: false [2018-12-31 09:51:08,179 INFO L444 ceAbstractionStarter]: At program point L931(lines 926 934) the Hoare annotation is: (and (= ~waterLevel~0 1) (= ~pumpRunning~0 0) (= ~systemActive~0 1)) [2018-12-31 09:51:08,179 INFO L448 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2018-12-31 09:51:08,179 INFO L444 ceAbstractionStarter]: At program point L173(lines 168 176) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse1 (<= ~waterLevel~0 2)) (.cse2 (= 1 ~pumpRunning~0)) (.cse3 (= ~systemActive~0 1))) (or (and (<= 2 ~waterLevel~0) (= 2 |ULTIMATE.start_getWaterLevel_#res|) .cse0 .cse1 .cse2 .cse3) (and (and .cse0 (= ~pumpRunning~0 0) .cse3) .cse1) (and .cse0 (= ~switchedOnBeforeTS~0 1) .cse1 .cse2 (= 1 |ULTIMATE.start_isPumpRunning_#res|) .cse3))) [2018-12-31 09:51:08,179 INFO L444 ceAbstractionStarter]: At program point L173-1(lines 168 176) the Hoare annotation is: false [2018-12-31 09:51:08,179 INFO L444 ceAbstractionStarter]: At program point L173-2(lines 168 176) the Hoare annotation is: false [2018-12-31 09:51:08,180 INFO L448 ceAbstractionStarter]: For program point L74(lines 74 84) no Hoare annotation was computed. [2018-12-31 09:51:08,180 INFO L448 ceAbstractionStarter]: For program point L74-2(lines 74 84) no Hoare annotation was computed. [2018-12-31 09:51:08,180 INFO L448 ceAbstractionStarter]: For program point L74-4(lines 74 84) no Hoare annotation was computed. [2018-12-31 09:51:08,180 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-31 09:51:08,180 INFO L448 ceAbstractionStarter]: For program point L339(lines 339 356) no Hoare annotation was computed. [2018-12-31 09:51:08,180 INFO L448 ceAbstractionStarter]: For program point L339-1(lines 339 356) no Hoare annotation was computed. [2018-12-31 09:51:08,180 INFO L448 ceAbstractionStarter]: For program point L339-2(lines 339 356) no Hoare annotation was computed. [2018-12-31 09:51:08,180 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 940) no Hoare annotation was computed. [2018-12-31 09:51:08,181 INFO L444 ceAbstractionStarter]: At program point L141(lines 136 144) the Hoare annotation is: (and (<= 2 ~waterLevel~0) (= ULTIMATE.start_test_~splverifierCounter~0 0) (<= ~waterLevel~0 2) (= ~pumpRunning~0 0) (= ~systemActive~0 1)) [2018-12-31 09:51:08,181 INFO L444 ceAbstractionStarter]: At program point L141-1(lines 136 144) the Hoare annotation is: false [2018-12-31 09:51:08,181 INFO L448 ceAbstractionStarter]: For program point L75(lines 75 81) no Hoare annotation was computed. [2018-12-31 09:51:08,181 INFO L444 ceAbstractionStarter]: At program point L141-2(lines 136 144) the Hoare annotation is: false [2018-12-31 09:51:08,181 INFO L448 ceAbstractionStarter]: For program point L75-2(lines 75 81) no Hoare annotation was computed. [2018-12-31 09:51:08,181 INFO L448 ceAbstractionStarter]: For program point L75-4(lines 75 81) no Hoare annotation was computed. [2018-12-31 09:51:08,181 INFO L451 ceAbstractionStarter]: At program point L290(lines 271 293) the Hoare annotation is: true [2018-12-31 09:51:08,181 INFO L444 ceAbstractionStarter]: At program point L59(lines 307 313) the Hoare annotation is: (let ((.cse1 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse0 (<= ~waterLevel~0 2)) (.cse2 (= ~systemActive~0 1))) (or (and .cse0 (and (= 0 |ULTIMATE.start_isPumpRunning_#res|) .cse1 (= ~pumpRunning~0 0) .cse2)) (and (and .cse1 .cse0 .cse2) (= ~switchedOnBeforeTS~0 1) (= 1 ~pumpRunning~0) (= 1 |ULTIMATE.start_isPumpRunning_#res|)))) [2018-12-31 09:51:08,181 INFO L444 ceAbstractionStarter]: At program point L59-1(lines 307 313) the Hoare annotation is: false [2018-12-31 09:51:08,182 INFO L444 ceAbstractionStarter]: At program point L59-2(lines 307 313) the Hoare annotation is: false [2018-12-31 09:51:08,182 INFO L444 ceAbstractionStarter]: At program point L307(lines 303 325) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse2 (= ~systemActive~0 1)) (.cse1 (<= ~waterLevel~0 2))) (or (and (and .cse0 .cse1 .cse2) (= ~switchedOnBeforeTS~0 1) (= 1 ~pumpRunning~0) (= 1 |ULTIMATE.start_isPumpRunning_#res|)) (and (and .cse0 (= ~pumpRunning~0 0) .cse2) .cse1))) [2018-12-31 09:51:08,182 INFO L444 ceAbstractionStarter]: At program point L307-1(lines 303 325) the Hoare annotation is: false [2018-12-31 09:51:08,182 INFO L444 ceAbstractionStarter]: At program point L307-2(lines 303 325) the Hoare annotation is: false [2018-12-31 09:51:08,182 INFO L448 ceAbstractionStarter]: For program point L208(lines 208 212) no Hoare annotation was computed. [2018-12-31 09:51:08,182 INFO L448 ceAbstractionStarter]: For program point L208-1(lines 208 212) no Hoare annotation was computed. [2018-12-31 09:51:08,182 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 940) no Hoare annotation was computed. [2018-12-31 09:51:08,182 INFO L448 ceAbstractionStarter]: For program point L490(lines 490 496) no Hoare annotation was computed. [2018-12-31 09:51:08,183 INFO L444 ceAbstractionStarter]: At program point L490-1(lines 490 496) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse1 (<= ~waterLevel~0 2)) (.cse2 (= 1 ~pumpRunning~0)) (.cse3 (= ~systemActive~0 1))) (or (and (<= 2 ~waterLevel~0) .cse0 .cse1 .cse2 .cse3) (and .cse1 (and .cse0 (= ~pumpRunning~0 0) .cse3)) (and .cse0 (= ~switchedOnBeforeTS~0 1) .cse1 .cse2 (= 1 |ULTIMATE.start_isPumpRunning_#res|) .cse3))) [2018-12-31 09:51:08,183 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-31 09:51:08,183 INFO L448 ceAbstractionStarter]: For program point L128(lines 128 132) no Hoare annotation was computed. [2018-12-31 09:51:08,183 INFO L448 ceAbstractionStarter]: For program point L376(lines 376 382) no Hoare annotation was computed. [2018-12-31 09:51:08,183 INFO L448 ceAbstractionStarter]: For program point L343(lines 343 351) no Hoare annotation was computed. [2018-12-31 09:51:08,183 INFO L448 ceAbstractionStarter]: For program point L343-1(lines 343 351) no Hoare annotation was computed. [2018-12-31 09:51:08,183 INFO L448 ceAbstractionStarter]: For program point L376-2(lines 376 382) no Hoare annotation was computed. [2018-12-31 09:51:08,183 INFO L448 ceAbstractionStarter]: For program point L343-2(lines 343 351) no Hoare annotation was computed. [2018-12-31 09:51:08,183 INFO L448 ceAbstractionStarter]: For program point L376-4(lines 376 382) no Hoare annotation was computed. [2018-12-31 09:51:08,183 INFO L448 ceAbstractionStarter]: For program point L459(lines 459 463) no Hoare annotation was computed. [2018-12-31 09:51:08,183 INFO L448 ceAbstractionStarter]: For program point L459-2(lines 459 463) no Hoare annotation was computed. [2018-12-31 09:51:08,184 INFO L448 ceAbstractionStarter]: For program point L459-3(lines 459 463) no Hoare annotation was computed. [2018-12-31 09:51:08,184 INFO L448 ceAbstractionStarter]: For program point L459-5(lines 459 463) no Hoare annotation was computed. [2018-12-31 09:51:08,184 INFO L448 ceAbstractionStarter]: For program point L459-6(lines 459 463) no Hoare annotation was computed. [2018-12-31 09:51:08,184 INFO L448 ceAbstractionStarter]: For program point L459-8(lines 459 463) no Hoare annotation was computed. [2018-12-31 09:51:08,184 INFO L444 ceAbstractionStarter]: At program point L410(lines 405 413) the Hoare annotation is: (let ((.cse3 (= 1 ~pumpRunning~0)) (.cse4 (= 1 |ULTIMATE.start_isPumpRunning_#res|)) (.cse1 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse0 (<= ~waterLevel~0 2)) (.cse2 (= ~systemActive~0 1))) (or (and .cse0 (and (= 0 |ULTIMATE.start_isPumpRunning_#res|) .cse1 (= ~pumpRunning~0 0) .cse2)) (and (and .cse1 .cse0 .cse2) (= ~switchedOnBeforeTS~0 1) .cse3 .cse4) (and .cse3 .cse4 (and (<= 2 ~waterLevel~0) .cse1 .cse0 .cse2)))) [2018-12-31 09:51:08,184 INFO L444 ceAbstractionStarter]: At program point L410-1(lines 405 413) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse1 (<= ~waterLevel~0 2)) (.cse2 (= ~systemActive~0 1))) (or (and .cse0 (= ~switchedOnBeforeTS~0 1) .cse1 (= 1 ~pumpRunning~0) (= 1 |ULTIMATE.start_isPumpRunning_#res|) .cse2) (and (= 0 |ULTIMATE.start_isPumpRunning_#res|) .cse0 .cse1 (= ~pumpRunning~0 0) .cse2))) [2018-12-31 09:51:08,184 INFO L444 ceAbstractionStarter]: At program point L410-2(lines 405 413) the Hoare annotation is: false [2018-12-31 09:51:08,184 INFO L444 ceAbstractionStarter]: At program point L410-3(lines 405 413) the Hoare annotation is: false [2018-12-31 09:51:08,184 INFO L444 ceAbstractionStarter]: At program point L410-4(lines 405 413) the Hoare annotation is: false [2018-12-31 09:51:08,185 INFO L444 ceAbstractionStarter]: At program point L410-5(lines 405 413) the Hoare annotation is: false [2018-12-31 09:51:08,185 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 940) no Hoare annotation was computed. [2018-12-31 09:51:08,185 INFO L444 ceAbstractionStarter]: At program point L526(lines 479 527) the Hoare annotation is: false [2018-12-31 09:51:08,185 INFO L448 ceAbstractionStarter]: For program point L510(lines 510 521) no Hoare annotation was computed. [2018-12-31 09:51:08,185 INFO L444 ceAbstractionStarter]: At program point L923(lines 1 943) the Hoare annotation is: (and (= ~waterLevel~0 1) (= ~pumpRunning~0 0) (= ~systemActive~0 1)) [2018-12-31 09:51:08,185 INFO L448 ceAbstractionStarter]: For program point L940(line 940) no Hoare annotation was computed. [2018-12-31 09:51:08,185 INFO L448 ceAbstractionStarter]: For program point L940-1(line 940) no Hoare annotation was computed. [2018-12-31 09:51:08,185 INFO L448 ceAbstractionStarter]: For program point L940-2(line 940) no Hoare annotation was computed. [2018-12-31 09:51:08,185 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-12-31 09:51:08,185 INFO L448 ceAbstractionStarter]: For program point L181(lines 181 187) no Hoare annotation was computed. [2018-12-31 09:51:08,186 INFO L448 ceAbstractionStarter]: For program point L181-1(lines 181 187) no Hoare annotation was computed. [2018-12-31 09:51:08,186 INFO L448 ceAbstractionStarter]: For program point L181-2(lines 181 187) no Hoare annotation was computed. [2018-12-31 09:51:08,186 INFO L444 ceAbstractionStarter]: At program point L49(lines 44 51) the Hoare annotation is: (and (= ~waterLevel~0 1) (= ~pumpRunning~0 0) (= ~systemActive~0 1)) [2018-12-31 09:51:08,186 INFO L444 ceAbstractionStarter]: At program point L314(lines 314 320) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse1 (<= ~waterLevel~0 2)) (.cse2 (= 1 ~pumpRunning~0)) (.cse3 (= ~systemActive~0 1))) (or (and (<= 2 ~waterLevel~0) .cse0 .cse1 .cse2 .cse3) (and (and .cse0 (= ~pumpRunning~0 0) .cse3) .cse1) (and .cse0 (= ~switchedOnBeforeTS~0 1) .cse1 .cse2 (= 1 |ULTIMATE.start_isPumpRunning_#res|) .cse3))) [2018-12-31 09:51:08,186 INFO L448 ceAbstractionStarter]: For program point L281(lines 281 288) no Hoare annotation was computed. [2018-12-31 09:51:08,186 INFO L444 ceAbstractionStarter]: At program point L314-1(lines 314 320) the Hoare annotation is: false [2018-12-31 09:51:08,186 INFO L444 ceAbstractionStarter]: At program point L314-2(lines 314 320) the Hoare annotation is: false [2018-12-31 09:51:08,186 INFO L451 ceAbstractionStarter]: At program point L281-1(lines 281 288) the Hoare annotation is: true [2018-12-31 09:51:08,186 INFO L448 ceAbstractionStarter]: For program point L116(lines 116 120) no Hoare annotation was computed. [2018-12-31 09:51:08,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 09:51:08 BoogieIcfgContainer [2018-12-31 09:51:08,216 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 09:51:08,217 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 09:51:08,217 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 09:51:08,219 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 09:51:08,219 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:58" (3/4) ... [2018-12-31 09:51:08,230 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-31 09:51:08,271 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 38 nodes and edges [2018-12-31 09:51:08,272 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2018-12-31 09:51:08,273 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2018-12-31 09:51:08,275 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-12-31 09:51:08,276 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-31 09:51:08,276 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-31 09:51:08,315 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((2 <= waterLevel && splverifierCounter == 0) && 2 == \result) && waterLevel <= 2) && 1 == pumpRunning) && tmp == 2) && systemActive == 1) || (waterLevel <= 2 && (splverifierCounter == 0 && pumpRunning == 0) && systemActive == 1)) || (((((splverifierCounter == 0 && switchedOnBeforeTS == 1) && waterLevel <= 2) && 1 == pumpRunning) && 1 == \result) && systemActive == 1) [2018-12-31 09:51:08,316 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((2 <= waterLevel && splverifierCounter == 0) && waterLevel <= 2) && 1 == pumpRunning) && systemActive == 1) || (waterLevel <= 2 && (splverifierCounter == 0 && pumpRunning == 0) && systemActive == 1)) || (((((splverifierCounter == 0 && switchedOnBeforeTS == 1) && waterLevel <= 2) && 1 == pumpRunning) && 1 == \result) && systemActive == 1) [2018-12-31 09:51:08,317 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((2 <= waterLevel && splverifierCounter == 0) && waterLevel <= 2) && 1 == pumpRunning) && systemActive == 1) || (waterLevel <= 2 && (splverifierCounter == 0 && pumpRunning == 0) && systemActive == 1)) || (((((splverifierCounter == 0 && switchedOnBeforeTS == 1) && waterLevel <= 2) && 1 == pumpRunning) && 1 == \result) && systemActive == 1) [2018-12-31 09:51:08,317 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((waterLevel <= 2 && ((0 == \result && splverifierCounter == 0) && pumpRunning == 0) && systemActive == 1) || (((((splverifierCounter == 0 && waterLevel <= 2) && systemActive == 1) && switchedOnBeforeTS == 1) && 1 == pumpRunning) && 1 == \result)) || ((1 == pumpRunning && 1 == \result) && ((2 <= waterLevel && splverifierCounter == 0) && waterLevel <= 2) && systemActive == 1) [2018-12-31 09:51:08,318 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (waterLevel <= 2 && ((0 == \result && splverifierCounter == 0) && pumpRunning == 0) && systemActive == 1) || (((((splverifierCounter == 0 && waterLevel <= 2) && systemActive == 1) && switchedOnBeforeTS == 1) && 1 == pumpRunning) && 1 == \result) [2018-12-31 09:51:08,318 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((splverifierCounter == 0 && waterLevel <= 2) && systemActive == 1) && switchedOnBeforeTS == 1) && 1 == pumpRunning) && 1 == \result) || (((splverifierCounter == 0 && pumpRunning == 0) && systemActive == 1) && waterLevel <= 2) [2018-12-31 09:51:08,318 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((2 <= waterLevel && splverifierCounter == 0) && waterLevel <= 2) && 1 == pumpRunning) && systemActive == 1) || (((splverifierCounter == 0 && pumpRunning == 0) && systemActive == 1) && waterLevel <= 2)) || (((((splverifierCounter == 0 && switchedOnBeforeTS == 1) && waterLevel <= 2) && 1 == pumpRunning) && 1 == \result) && systemActive == 1) [2018-12-31 09:51:08,323 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((2 <= waterLevel && 2 == \result) && splverifierCounter == 0) && waterLevel <= 2) && 1 == pumpRunning) && systemActive == 1) || (((splverifierCounter == 0 && pumpRunning == 0) && systemActive == 1) && waterLevel <= 2)) || (((((splverifierCounter == 0 && switchedOnBeforeTS == 1) && waterLevel <= 2) && 1 == pumpRunning) && 1 == \result) && systemActive == 1) [2018-12-31 09:51:08,324 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((splverifierCounter == 0 && waterLevel <= 2) && 1 == \result) && pumpRunning == 0) && systemActive == 1) || ((((2 <= waterLevel && splverifierCounter == 0) && waterLevel <= 2) && pumpRunning == 0) && systemActive == 1) [2018-12-31 09:51:08,324 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((splverifierCounter == 0 && switchedOnBeforeTS == 1) && waterLevel <= 2) && 1 == pumpRunning) && 1 == \result) && systemActive == 1) || ((((0 == \result && splverifierCounter == 0) && waterLevel <= 2) && pumpRunning == 0) && systemActive == 1) [2018-12-31 09:51:08,328 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == \result && 0 == tmp___0) && splverifierCounter == 0) && pumpRunning == 0) && systemActive == 1) && waterLevel <= 2) || ((((2 <= waterLevel && splverifierCounter == 0) && waterLevel <= 2) && pumpRunning == 0) && systemActive == 1) [2018-12-31 09:51:08,433 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 09:51:08,434 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 09:51:08,434 INFO L168 Benchmark]: Toolchain (without parser) took 12600.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 207.1 MB). Free memory was 951.3 MB in the beginning and 930.4 MB in the end (delta: 21.0 MB). Peak memory consumption was 228.1 MB. Max. memory is 11.5 GB. [2018-12-31 09:51:08,436 INFO L168 Benchmark]: CDTParser took 0.16 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:08,436 INFO L168 Benchmark]: CACSL2BoogieTranslator took 780.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -161.7 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. [2018-12-31 09:51:08,436 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.69 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 09:51:08,436 INFO L168 Benchmark]: Boogie Preprocessor took 47.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-12-31 09:51:08,437 INFO L168 Benchmark]: RCFGBuilder took 1435.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 53.9 MB). Peak memory consumption was 53.9 MB. Max. memory is 11.5 GB. [2018-12-31 09:51:08,437 INFO L168 Benchmark]: TraceAbstraction took 10037.13 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 72.9 MB). Free memory was 1.1 GB in the beginning and 946.3 MB in the end (delta: 105.9 MB). Peak memory consumption was 269.0 MB. Max. memory is 11.5 GB. [2018-12-31 09:51:08,437 INFO L168 Benchmark]: Witness Printer took 216.83 ms. Allocated memory is still 1.2 GB. Free memory was 946.3 MB in the beginning and 930.4 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 11.5 GB. [2018-12-31 09:51:08,440 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.16 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 780.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -161.7 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 76.69 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 47.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1435.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 53.9 MB). Peak memory consumption was 53.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10037.13 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 72.9 MB). Free memory was 1.1 GB in the beginning and 946.3 MB in the end (delta: 105.9 MB). Peak memory consumption was 269.0 MB. Max. memory is 11.5 GB. * Witness Printer took 216.83 ms. Allocated memory is still 1.2 GB. Free memory was 946.3 MB in the beginning and 930.4 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 940]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 940]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 940]: 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: 314]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: ((((splverifierCounter == 0 && waterLevel <= 2) && 1 == \result) && pumpRunning == 0) && systemActive == 1) || ((((2 <= waterLevel && splverifierCounter == 0) && waterLevel <= 2) && pumpRunning == 0) && systemActive == 1) - InvariantResult [Line: 479]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 314]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 44]: Loop Invariant Derived loop invariant: (waterLevel == 1 && pumpRunning == 0) && systemActive == 1 - InvariantResult [Line: 490]: Loop Invariant Derived loop invariant: (((((2 <= waterLevel && splverifierCounter == 0) && waterLevel <= 2) && 1 == pumpRunning) && systemActive == 1) || (waterLevel <= 2 && (splverifierCounter == 0 && pumpRunning == 0) && systemActive == 1)) || (((((splverifierCounter == 0 && switchedOnBeforeTS == 1) && waterLevel <= 2) && 1 == pumpRunning) && 1 == \result) && systemActive == 1) - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 303]: Loop Invariant Derived loop invariant: (((((splverifierCounter == 0 && waterLevel <= 2) && systemActive == 1) && switchedOnBeforeTS == 1) && 1 == pumpRunning) && 1 == \result) || (((splverifierCounter == 0 && pumpRunning == 0) && systemActive == 1) && waterLevel <= 2) - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 303]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 271]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 303]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: ((((((2 <= waterLevel && 2 == \result) && splverifierCounter == 0) && waterLevel <= 2) && 1 == pumpRunning) && systemActive == 1) || (((splverifierCounter == 0 && pumpRunning == 0) && systemActive == 1) && waterLevel <= 2)) || (((((splverifierCounter == 0 && switchedOnBeforeTS == 1) && waterLevel <= 2) && 1 == pumpRunning) && 1 == \result) && systemActive == 1) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (waterLevel == 1 && pumpRunning == 0) && systemActive == 1 - InvariantResult [Line: 281]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 314]: Loop Invariant Derived loop invariant: (((((2 <= waterLevel && splverifierCounter == 0) && waterLevel <= 2) && 1 == pumpRunning) && systemActive == 1) || (((splverifierCounter == 0 && pumpRunning == 0) && systemActive == 1) && waterLevel <= 2)) || (((((splverifierCounter == 0 && switchedOnBeforeTS == 1) && waterLevel <= 2) && 1 == pumpRunning) && 1 == \result) && systemActive == 1) - InvariantResult [Line: 307]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 405]: Loop Invariant Derived loop invariant: (((((splverifierCounter == 0 && switchedOnBeforeTS == 1) && waterLevel <= 2) && 1 == pumpRunning) && 1 == \result) && systemActive == 1) || ((((0 == \result && splverifierCounter == 0) && waterLevel <= 2) && pumpRunning == 0) && systemActive == 1) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((2 <= waterLevel && splverifierCounter == 0) && 2 == \result) && waterLevel <= 2) && 1 == pumpRunning) && tmp == 2) && systemActive == 1) || (waterLevel <= 2 && (splverifierCounter == 0 && pumpRunning == 0) && systemActive == 1)) || (((((splverifierCounter == 0 && switchedOnBeforeTS == 1) && waterLevel <= 2) && 1 == pumpRunning) && 1 == \result) && systemActive == 1) - InvariantResult [Line: 926]: Loop Invariant Derived loop invariant: (waterLevel == 1 && pumpRunning == 0) && systemActive == 1 - InvariantResult [Line: 405]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 307]: Loop Invariant Derived loop invariant: (waterLevel <= 2 && ((0 == \result && splverifierCounter == 0) && pumpRunning == 0) && systemActive == 1) || (((((splverifierCounter == 0 && waterLevel <= 2) && systemActive == 1) && switchedOnBeforeTS == 1) && 1 == pumpRunning) && 1 == \result) - InvariantResult [Line: 405]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 249]: Loop Invariant Derived loop invariant: (waterLevel == 1 && pumpRunning == 0) && systemActive == 1 - InvariantResult [Line: 405]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 405]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 500]: Loop Invariant Derived loop invariant: (((((2 <= waterLevel && splverifierCounter == 0) && waterLevel <= 2) && 1 == pumpRunning) && systemActive == 1) || (waterLevel <= 2 && (splverifierCounter == 0 && pumpRunning == 0) && systemActive == 1)) || (((((splverifierCounter == 0 && switchedOnBeforeTS == 1) && waterLevel <= 2) && 1 == pumpRunning) && 1 == \result) && systemActive == 1) - InvariantResult [Line: 136]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 136]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 450]: Loop Invariant Derived loop invariant: (((((0 == \result && 0 == tmp___0) && splverifierCounter == 0) && pumpRunning == 0) && systemActive == 1) && waterLevel <= 2) || ((((2 <= waterLevel && splverifierCounter == 0) && waterLevel <= 2) && pumpRunning == 0) && systemActive == 1) - InvariantResult [Line: 394]: Loop Invariant Derived loop invariant: (((2 <= waterLevel && splverifierCounter == 0) && waterLevel <= 2) && pumpRunning == 0) && systemActive == 1 - InvariantResult [Line: 136]: Loop Invariant Derived loop invariant: (((2 <= waterLevel && splverifierCounter == 0) && waterLevel <= 2) && pumpRunning == 0) && systemActive == 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 450]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 394]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 405]: Loop Invariant Derived loop invariant: ((waterLevel <= 2 && ((0 == \result && splverifierCounter == 0) && pumpRunning == 0) && systemActive == 1) || (((((splverifierCounter == 0 && waterLevel <= 2) && systemActive == 1) && switchedOnBeforeTS == 1) && 1 == pumpRunning) && 1 == \result)) || ((1 == pumpRunning && 1 == \result) && ((2 <= waterLevel && splverifierCounter == 0) && waterLevel <= 2) && systemActive == 1) - InvariantResult [Line: 307]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 450]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 394]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 96 locations, 3 error locations. SAFE Result, 9.9s OverallTime, 10 OverallIterations, 2 TraceHistogramMax, 3.5s AutomataDifference, 0.0s DeadEndRemovalTime, 3.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 817 SDtfs, 789 SDslu, 1069 SDs, 0 SdLazy, 172 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 109 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=135occurred 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.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 309 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 43 LocationsWithAnnotation, 43 PreInvPairs, 99 NumberOfFragments, 594 HoareAnnotationTreeSize, 43 FomulaSimplifications, 16854 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 43 FomulaSimplificationsInter, 4135 FormulaSimplificationTreeSizeReductionInter, 3.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 378 NumberOfCodeBlocks, 378 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 367 ConstructedInterpolants, 0 QuantifiedInterpolants, 26917 SizeOfPredicates, 4 NumberOfNonLiveVariables, 412 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 11 InterpolantComputations, 9 PerfectInterpolantSequences, 26/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...