./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec4_product56_true-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/product-lines/minepump_spec4_product56_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 210feffc8ddd7d7862cfab969b7a82589a978274 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 14:54:32,624 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 14:54:32,625 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 14:54:32,637 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 14:54:32,637 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 14:54:32,638 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 14:54:32,640 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 14:54:32,649 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 14:54:32,651 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 14:54:32,652 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 14:54:32,653 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 14:54:32,653 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 14:54:32,654 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 14:54:32,655 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 14:54:32,656 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 14:54:32,656 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 14:54:32,657 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 14:54:32,659 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 14:54:32,661 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 14:54:32,662 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 14:54:32,664 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 14:54:32,665 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 14:54:32,667 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 14:54:32,667 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 14:54:32,667 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 14:54:32,668 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 14:54:32,669 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 14:54:32,670 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 14:54:32,671 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 14:54:32,672 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 14:54:32,672 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 14:54:32,676 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 14:54:32,676 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 14:54:32,676 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 14:54:32,677 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 14:54:32,678 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 14:54:32,678 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 14:54:32,693 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 14:54:32,693 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 14:54:32,694 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 14:54:32,694 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 14:54:32,694 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 14:54:32,695 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 14:54:32,695 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 14:54:32,695 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 14:54:32,695 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 14:54:32,695 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 14:54:32,695 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 14:54:32,696 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 14:54:32,696 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 14:54:32,696 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 14:54:32,696 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 14:54:32,696 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 14:54:32,696 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 14:54:32,697 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 14:54:32,697 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 14:54:32,697 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 14:54:32,697 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 14:54:32,697 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 14:54:32,698 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 14:54:32,698 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 14:54:32,698 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 14:54:32,698 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 14:54:32,698 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 14:54:32,698 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 14:54:32,699 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 -> 210feffc8ddd7d7862cfab969b7a82589a978274 [2019-01-12 14:54:32,732 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 14:54:32,744 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 14:54:32,747 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 14:54:32,749 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 14:54:32,749 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 14:54:32,750 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec4_product56_true-unreach-call_false-termination.cil.c [2019-01-12 14:54:32,806 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/356777653/01b29b0dd0634519b143d173ac155d61/FLAGc2819dc32 [2019-01-12 14:54:33,351 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 14:54:33,355 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec4_product56_true-unreach-call_false-termination.cil.c [2019-01-12 14:54:33,372 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/356777653/01b29b0dd0634519b143d173ac155d61/FLAGc2819dc32 [2019-01-12 14:54:33,605 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/356777653/01b29b0dd0634519b143d173ac155d61 [2019-01-12 14:54:33,609 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 14:54:33,610 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 14:54:33,612 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 14:54:33,612 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 14:54:33,616 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 14:54:33,617 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:54:33" (1/1) ... [2019-01-12 14:54:33,620 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7471e6e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:54:33, skipping insertion in model container [2019-01-12 14:54:33,620 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:54:33" (1/1) ... [2019-01-12 14:54:33,628 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 14:54:33,687 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 14:54:34,051 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:54:34,065 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 14:54:34,272 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:54:34,314 INFO L195 MainTranslator]: Completed translation [2019-01-12 14:54:34,314 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:54:34 WrapperNode [2019-01-12 14:54:34,314 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 14:54:34,315 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 14:54:34,316 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 14:54:34,316 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 14:54:34,326 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:54:34" (1/1) ... [2019-01-12 14:54:34,347 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:54:34" (1/1) ... [2019-01-12 14:54:34,413 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 14:54:34,413 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 14:54:34,413 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 14:54:34,413 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 14:54:34,432 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:54:34" (1/1) ... [2019-01-12 14:54:34,434 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:54:34" (1/1) ... [2019-01-12 14:54:34,451 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:54:34" (1/1) ... [2019-01-12 14:54:34,451 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:54:34" (1/1) ... [2019-01-12 14:54:34,469 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:54:34" (1/1) ... [2019-01-12 14:54:34,482 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:54:34" (1/1) ... [2019-01-12 14:54:34,486 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:54:34" (1/1) ... [2019-01-12 14:54:34,499 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 14:54:34,500 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 14:54:34,500 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 14:54:34,500 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 14:54:34,501 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:54:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 14:54:34,580 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 14:54:34,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-12 14:54:34,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 14:54:34,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 14:54:36,672 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 14:54:36,672 INFO L286 CfgBuilder]: Removed 282 assue(true) statements. [2019-01-12 14:54:36,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:54:36 BoogieIcfgContainer [2019-01-12 14:54:36,674 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 14:54:36,675 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 14:54:36,676 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 14:54:36,679 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 14:54:36,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 02:54:33" (1/3) ... [2019-01-12 14:54:36,680 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cbebba6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:54:36, skipping insertion in model container [2019-01-12 14:54:36,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:54:34" (2/3) ... [2019-01-12 14:54:36,681 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cbebba6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:54:36, skipping insertion in model container [2019-01-12 14:54:36,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:54:36" (3/3) ... [2019-01-12 14:54:36,683 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec4_product56_true-unreach-call_false-termination.cil.c [2019-01-12 14:54:36,694 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 14:54:36,703 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-12 14:54:36,721 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-12 14:54:36,755 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 14:54:36,756 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 14:54:36,756 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 14:54:36,756 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 14:54:36,757 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 14:54:36,757 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 14:54:36,757 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 14:54:36,757 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 14:54:36,758 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 14:54:36,781 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states. [2019-01-12 14:54:36,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-12 14:54:36,789 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:54:36,790 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:54:36,793 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:54:36,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:54:36,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1937289636, now seen corresponding path program 1 times [2019-01-12 14:54:36,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:54:36,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:54:36,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:36,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:54:36,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:36,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:54:37,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:54:37,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:54:37,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:54:37,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 14:54:37,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 14:54:37,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 14:54:37,077 INFO L87 Difference]: Start difference. First operand 191 states. Second operand 2 states. [2019-01-12 14:54:37,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:54:37,123 INFO L93 Difference]: Finished difference Result 376 states and 575 transitions. [2019-01-12 14:54:37,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 14:54:37,125 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-01-12 14:54:37,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:54:37,140 INFO L225 Difference]: With dead ends: 376 [2019-01-12 14:54:37,140 INFO L226 Difference]: Without dead ends: 187 [2019-01-12 14:54:37,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 14:54:37,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-01-12 14:54:37,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2019-01-12 14:54:37,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-01-12 14:54:37,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 279 transitions. [2019-01-12 14:54:37,209 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 279 transitions. Word has length 16 [2019-01-12 14:54:37,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:54:37,209 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 279 transitions. [2019-01-12 14:54:37,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 14:54:37,210 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 279 transitions. [2019-01-12 14:54:37,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-12 14:54:37,211 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:54:37,211 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:54:37,211 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:54:37,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:54:37,212 INFO L82 PathProgramCache]: Analyzing trace with hash 890532739, now seen corresponding path program 1 times [2019-01-12 14:54:37,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:54:37,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:54:37,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:37,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:54:37,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:37,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:54:37,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:54:37,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:54:37,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 14:54:37,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:54:37,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:54:37,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:54:37,401 INFO L87 Difference]: Start difference. First operand 187 states and 279 transitions. Second operand 3 states. [2019-01-12 14:54:37,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:54:37,438 INFO L93 Difference]: Finished difference Result 187 states and 279 transitions. [2019-01-12 14:54:37,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:54:37,439 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-01-12 14:54:37,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:54:37,440 INFO L225 Difference]: With dead ends: 187 [2019-01-12 14:54:37,441 INFO L226 Difference]: Without dead ends: 73 [2019-01-12 14:54:37,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:54:37,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-01-12 14:54:37,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-01-12 14:54:37,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-12 14:54:37,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 108 transitions. [2019-01-12 14:54:37,451 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 108 transitions. Word has length 17 [2019-01-12 14:54:37,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:54:37,451 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 108 transitions. [2019-01-12 14:54:37,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:54:37,452 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 108 transitions. [2019-01-12 14:54:37,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-12 14:54:37,453 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:54:37,453 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:54:37,453 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:54:37,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:54:37,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1577730230, now seen corresponding path program 1 times [2019-01-12 14:54:37,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:54:37,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:54:37,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:37,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:54:37,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:37,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:54:37,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:54:37,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:54:37,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 14:54:37,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:54:37,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:54:37,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:54:37,580 INFO L87 Difference]: Start difference. First operand 73 states and 108 transitions. Second operand 3 states. [2019-01-12 14:54:37,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:54:37,652 INFO L93 Difference]: Finished difference Result 207 states and 312 transitions. [2019-01-12 14:54:37,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:54:37,656 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-01-12 14:54:37,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:54:37,658 INFO L225 Difference]: With dead ends: 207 [2019-01-12 14:54:37,658 INFO L226 Difference]: Without dead ends: 140 [2019-01-12 14:54:37,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:54:37,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-01-12 14:54:37,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 136. [2019-01-12 14:54:37,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-01-12 14:54:37,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 205 transitions. [2019-01-12 14:54:37,693 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 205 transitions. Word has length 22 [2019-01-12 14:54:37,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:54:37,696 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 205 transitions. [2019-01-12 14:54:37,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:54:37,696 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 205 transitions. [2019-01-12 14:54:37,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-12 14:54:37,698 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:54:37,698 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:54:37,698 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:54:37,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:54:37,699 INFO L82 PathProgramCache]: Analyzing trace with hash 792163456, now seen corresponding path program 1 times [2019-01-12 14:54:37,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:54:37,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:54:37,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:37,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:54:37,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:37,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:54:37,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:54:37,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:54:37,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:54:37,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:54:37,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:54:37,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:54:37,843 INFO L87 Difference]: Start difference. First operand 136 states and 205 transitions. Second operand 3 states. [2019-01-12 14:54:37,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:54:37,999 INFO L93 Difference]: Finished difference Result 283 states and 430 transitions. [2019-01-12 14:54:38,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:54:38,000 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-01-12 14:54:38,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:54:38,002 INFO L225 Difference]: With dead ends: 283 [2019-01-12 14:54:38,002 INFO L226 Difference]: Without dead ends: 153 [2019-01-12 14:54:38,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:54:38,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-01-12 14:54:38,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 151. [2019-01-12 14:54:38,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-01-12 14:54:38,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 219 transitions. [2019-01-12 14:54:38,025 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 219 transitions. Word has length 25 [2019-01-12 14:54:38,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:54:38,026 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 219 transitions. [2019-01-12 14:54:38,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:54:38,026 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 219 transitions. [2019-01-12 14:54:38,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-12 14:54:38,027 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:54:38,027 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:54:38,030 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:54:38,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:54:38,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1022954699, now seen corresponding path program 1 times [2019-01-12 14:54:38,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:54:38,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:54:38,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:38,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:54:38,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:38,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:54:38,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:54:38,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:54:38,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:54:38,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:54:38,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:54:38,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:54:38,241 INFO L87 Difference]: Start difference. First operand 151 states and 219 transitions. Second operand 5 states. [2019-01-12 14:54:38,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:54:38,718 INFO L93 Difference]: Finished difference Result 527 states and 769 transitions. [2019-01-12 14:54:38,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 14:54:38,721 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-01-12 14:54:38,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:54:38,724 INFO L225 Difference]: With dead ends: 527 [2019-01-12 14:54:38,724 INFO L226 Difference]: Without dead ends: 382 [2019-01-12 14:54:38,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-12 14:54:38,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-01-12 14:54:38,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 236. [2019-01-12 14:54:38,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-01-12 14:54:38,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 332 transitions. [2019-01-12 14:54:38,752 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 332 transitions. Word has length 25 [2019-01-12 14:54:38,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:54:38,753 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 332 transitions. [2019-01-12 14:54:38,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:54:38,753 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 332 transitions. [2019-01-12 14:54:38,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-12 14:54:38,755 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:54:38,755 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:54:38,755 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:54:38,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:54:38,755 INFO L82 PathProgramCache]: Analyzing trace with hash -936354291, now seen corresponding path program 1 times [2019-01-12 14:54:38,756 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:54:38,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:54:38,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:38,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:54:38,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:38,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:54:39,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:54:39,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:54:39,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:54:39,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:54:39,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:54:39,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:54:39,088 INFO L87 Difference]: Start difference. First operand 236 states and 332 transitions. Second operand 5 states. [2019-01-12 14:54:39,605 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-12 14:54:40,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:54:40,362 INFO L93 Difference]: Finished difference Result 526 states and 754 transitions. [2019-01-12 14:54:40,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 14:54:40,363 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-01-12 14:54:40,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:54:40,366 INFO L225 Difference]: With dead ends: 526 [2019-01-12 14:54:40,366 INFO L226 Difference]: Without dead ends: 524 [2019-01-12 14:54:40,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-12 14:54:40,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2019-01-12 14:54:40,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 236. [2019-01-12 14:54:40,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-01-12 14:54:40,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 330 transitions. [2019-01-12 14:54:40,396 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 330 transitions. Word has length 26 [2019-01-12 14:54:40,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:54:40,397 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 330 transitions. [2019-01-12 14:54:40,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:54:40,397 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 330 transitions. [2019-01-12 14:54:40,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-12 14:54:40,398 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:54:40,399 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:54:40,399 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:54:40,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:54:40,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1821957235, now seen corresponding path program 1 times [2019-01-12 14:54:40,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:54:40,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:54:40,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:40,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:54:40,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:40,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:54:40,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:54:40,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:54:40,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:54:40,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:54:40,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:54:40,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:54:40,528 INFO L87 Difference]: Start difference. First operand 236 states and 330 transitions. Second operand 5 states. [2019-01-12 14:54:41,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:54:41,105 INFO L93 Difference]: Finished difference Result 651 states and 899 transitions. [2019-01-12 14:54:41,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 14:54:41,106 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-01-12 14:54:41,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:54:41,109 INFO L225 Difference]: With dead ends: 651 [2019-01-12 14:54:41,109 INFO L226 Difference]: Without dead ends: 421 [2019-01-12 14:54:41,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-12 14:54:41,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2019-01-12 14:54:41,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 260. [2019-01-12 14:54:41,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-01-12 14:54:41,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 354 transitions. [2019-01-12 14:54:41,134 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 354 transitions. Word has length 32 [2019-01-12 14:54:41,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:54:41,135 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 354 transitions. [2019-01-12 14:54:41,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:54:41,135 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 354 transitions. [2019-01-12 14:54:41,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-12 14:54:41,136 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:54:41,136 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:54:41,137 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:54:41,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:54:41,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1428930225, now seen corresponding path program 1 times [2019-01-12 14:54:41,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:54:41,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:54:41,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:41,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:54:41,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:41,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:54:41,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:54:41,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:54:41,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:54:41,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:54:41,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:54:41,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:54:41,407 INFO L87 Difference]: Start difference. First operand 260 states and 354 transitions. Second operand 5 states. [2019-01-12 14:54:42,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:54:42,066 INFO L93 Difference]: Finished difference Result 643 states and 863 transitions. [2019-01-12 14:54:42,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 14:54:42,067 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-01-12 14:54:42,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:54:42,070 INFO L225 Difference]: With dead ends: 643 [2019-01-12 14:54:42,070 INFO L226 Difference]: Without dead ends: 389 [2019-01-12 14:54:42,071 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-12 14:54:42,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2019-01-12 14:54:42,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 233. [2019-01-12 14:54:42,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-01-12 14:54:42,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 310 transitions. [2019-01-12 14:54:42,100 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 310 transitions. Word has length 32 [2019-01-12 14:54:42,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:54:42,100 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 310 transitions. [2019-01-12 14:54:42,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:54:42,100 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 310 transitions. [2019-01-12 14:54:42,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-12 14:54:42,101 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:54:42,101 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:54:42,102 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:54:42,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:54:42,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1687095663, now seen corresponding path program 1 times [2019-01-12 14:54:42,102 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:54:42,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:54:42,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:42,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:54:42,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:42,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:54:42,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:54:42,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:54:42,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:54:42,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:54:42,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:54:42,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:54:42,367 INFO L87 Difference]: Start difference. First operand 233 states and 310 transitions. Second operand 5 states. [2019-01-12 14:54:42,840 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-12 14:54:43,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:54:43,321 INFO L93 Difference]: Finished difference Result 666 states and 900 transitions. [2019-01-12 14:54:43,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 14:54:43,322 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-01-12 14:54:43,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:54:43,327 INFO L225 Difference]: With dead ends: 666 [2019-01-12 14:54:43,327 INFO L226 Difference]: Without dead ends: 491 [2019-01-12 14:54:43,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-12 14:54:43,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2019-01-12 14:54:43,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 326. [2019-01-12 14:54:43,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2019-01-12 14:54:43,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 427 transitions. [2019-01-12 14:54:43,380 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 427 transitions. Word has length 32 [2019-01-12 14:54:43,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:54:43,380 INFO L480 AbstractCegarLoop]: Abstraction has 326 states and 427 transitions. [2019-01-12 14:54:43,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:54:43,383 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 427 transitions. [2019-01-12 14:54:43,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-12 14:54:43,385 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:54:43,385 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:54:43,386 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:54:43,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:54:43,387 INFO L82 PathProgramCache]: Analyzing trace with hash -735517853, now seen corresponding path program 1 times [2019-01-12 14:54:43,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:54:43,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:54:43,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:43,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:54:43,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:43,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:54:43,488 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-12 14:54:43,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:54:43,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 14:54:43,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:54:43,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:54:43,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:54:43,490 INFO L87 Difference]: Start difference. First operand 326 states and 427 transitions. Second operand 3 states. [2019-01-12 14:54:43,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:54:43,601 INFO L93 Difference]: Finished difference Result 547 states and 717 transitions. [2019-01-12 14:54:43,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:54:43,603 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-01-12 14:54:43,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:54:43,606 INFO L225 Difference]: With dead ends: 547 [2019-01-12 14:54:43,607 INFO L226 Difference]: Without dead ends: 227 [2019-01-12 14:54:43,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:54:43,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-01-12 14:54:43,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 221. [2019-01-12 14:54:43,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-01-12 14:54:43,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 287 transitions. [2019-01-12 14:54:43,642 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 287 transitions. Word has length 50 [2019-01-12 14:54:43,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:54:43,642 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 287 transitions. [2019-01-12 14:54:43,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:54:43,642 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 287 transitions. [2019-01-12 14:54:43,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-12 14:54:43,647 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:54:43,648 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:54:43,648 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:54:43,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:54:43,648 INFO L82 PathProgramCache]: Analyzing trace with hash 2138901984, now seen corresponding path program 1 times [2019-01-12 14:54:43,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:54:43,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:54:43,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:43,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:54:43,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:43,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:54:43,852 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:54:43,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:54:43,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 14:54:43,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 14:54:43,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 14:54:43,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-12 14:54:43,853 INFO L87 Difference]: Start difference. First operand 221 states and 287 transitions. Second operand 6 states. [2019-01-12 14:54:44,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:54:44,955 INFO L93 Difference]: Finished difference Result 1020 states and 1353 transitions. [2019-01-12 14:54:44,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 14:54:44,957 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-01-12 14:54:44,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:54:44,963 INFO L225 Difference]: With dead ends: 1020 [2019-01-12 14:54:44,964 INFO L226 Difference]: Without dead ends: 848 [2019-01-12 14:54:44,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-01-12 14:54:44,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2019-01-12 14:54:45,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 344. [2019-01-12 14:54:45,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-01-12 14:54:45,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 457 transitions. [2019-01-12 14:54:45,031 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 457 transitions. Word has length 57 [2019-01-12 14:54:45,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:54:45,032 INFO L480 AbstractCegarLoop]: Abstraction has 344 states and 457 transitions. [2019-01-12 14:54:45,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 14:54:45,032 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 457 transitions. [2019-01-12 14:54:45,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-12 14:54:45,036 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:54:45,036 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:54:45,037 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:54:45,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:54:45,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1455000734, now seen corresponding path program 1 times [2019-01-12 14:54:45,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:54:45,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:54:45,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:45,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:54:45,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:54:45,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:54:45,430 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-12 14:54:45,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:54:45,432 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:54:45,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:54:45,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:54:45,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:54:46,035 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-12 14:54:46,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 14:54:46,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-01-12 14:54:46,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 14:54:46,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 14:54:46,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-01-12 14:54:46,058 INFO L87 Difference]: Start difference. First operand 344 states and 457 transitions. Second operand 9 states. [2019-01-12 14:54:46,728 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-01-12 14:54:47,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:54:47,204 INFO L93 Difference]: Finished difference Result 772 states and 1019 transitions. [2019-01-12 14:54:47,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 14:54:47,205 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-01-12 14:54:47,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:54:47,205 INFO L225 Difference]: With dead ends: 772 [2019-01-12 14:54:47,205 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 14:54:47,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-01-12 14:54:47,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 14:54:47,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 14:54:47,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 14:54:47,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 14:54:47,208 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 57 [2019-01-12 14:54:47,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:54:47,208 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 14:54:47,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 14:54:47,208 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 14:54:47,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 14:54:47,213 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 14:54:47,263 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:47,267 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:47,279 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:47,280 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:47,374 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:47,374 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:47,388 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:47,392 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:47,397 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:47,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:47,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:47,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:47,404 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:47,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:47,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:47,424 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 66 [2019-01-12 14:54:47,433 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:47,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:47,476 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:47,496 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:47,498 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:47,523 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:47,558 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:47,560 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:47,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:47,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:47,646 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:47,653 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:47,654 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:47,654 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:47,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:47,673 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:47,674 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:47,692 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 68 [2019-01-12 14:54:47,742 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:47,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:47,799 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:47,804 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:47,850 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:47,851 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:47,856 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:47,881 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 70 [2019-01-12 14:54:47,900 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:47,902 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:47,912 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:47,913 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:47,997 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:47,997 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:48,004 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:48,026 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:48,035 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:48,038 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:48,038 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:48,038 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:48,045 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:48,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:48,053 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:48,063 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 66 [2019-01-12 14:54:48,070 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:48,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:48,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:48,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:48,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:48,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:48,149 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:48,201 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:48,201 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:48,215 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 91 [2019-01-12 14:54:48,219 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:48,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:48,226 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:48,228 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:48,228 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:48,284 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:48,284 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:48,306 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:48,307 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:48,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:48,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:48,403 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:48,406 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:48,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:48,431 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:48,471 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 81 [2019-01-12 14:54:48,480 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:48,527 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:48,529 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:48,546 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:48,548 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:48,553 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:48,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:48,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:48,618 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:54:48,619 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 77 [2019-01-12 14:54:50,633 WARN L181 SmtUtils]: Spent 1.98 s on a formula simplification. DAG size of input: 64 DAG size of output: 18 [2019-01-12 14:54:51,155 WARN L181 SmtUtils]: Spent 508.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 17 [2019-01-12 14:54:51,320 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 24 [2019-01-12 14:54:51,612 WARN L181 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 18 [2019-01-12 14:54:51,840 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 25 [2019-01-12 14:54:52,119 WARN L181 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 21 [2019-01-12 14:54:52,384 WARN L181 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 18 [2019-01-12 14:54:52,844 WARN L181 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 15 [2019-01-12 14:54:53,073 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 23 [2019-01-12 14:54:53,370 WARN L181 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 10 [2019-01-12 14:54:53,733 WARN L181 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 18 [2019-01-12 14:54:53,838 INFO L444 ceAbstractionStarter]: At program point L961(lines 952 965) the Hoare annotation is: false [2019-01-12 14:54:53,838 INFO L444 ceAbstractionStarter]: At program point L961-1(lines 952 965) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse1 (= ~pumpRunning~0 0)) (.cse2 (= ~systemActive~0 1))) (or (and (and (and (not (= 0 |ULTIMATE.start_isHighWaterSensorDry_#res|)) .cse0 .cse1) (<= 1 ~waterLevel~0)) .cse2) (and (and (<= 2 ~waterLevel~0) .cse0 .cse1) .cse2))) [2019-01-12 14:54:53,838 INFO L444 ceAbstractionStarter]: At program point L961-2(lines 952 965) the Hoare annotation is: false [2019-01-12 14:54:53,839 INFO L444 ceAbstractionStarter]: At program point L961-3(lines 952 965) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse1 (= ~pumpRunning~0 0)) (.cse2 (= ~systemActive~0 1))) (or (and (and (and (not (= 0 |ULTIMATE.start_isHighWaterSensorDry_#res|)) .cse0 .cse1) (<= 1 ~waterLevel~0)) .cse2) (and (and (<= 2 ~waterLevel~0) .cse0 .cse1) .cse2))) [2019-01-12 14:54:53,839 INFO L444 ceAbstractionStarter]: At program point L961-4(lines 952 965) the Hoare annotation is: false [2019-01-12 14:54:53,839 INFO L444 ceAbstractionStarter]: At program point L961-5(lines 952 965) the Hoare annotation is: false [2019-01-12 14:54:53,839 INFO L444 ceAbstractionStarter]: At program point L961-6(lines 952 965) the Hoare annotation is: false [2019-01-12 14:54:53,839 INFO L444 ceAbstractionStarter]: At program point L961-7(lines 952 965) the Hoare annotation is: false [2019-01-12 14:54:53,839 INFO L444 ceAbstractionStarter]: At program point L961-8(lines 952 965) the Hoare annotation is: false [2019-01-12 14:54:53,839 INFO L444 ceAbstractionStarter]: At program point L961-9(lines 952 965) the Hoare annotation is: false [2019-01-12 14:54:53,839 INFO L444 ceAbstractionStarter]: At program point L961-10(lines 952 965) the Hoare annotation is: false [2019-01-12 14:54:53,839 INFO L444 ceAbstractionStarter]: At program point L961-11(lines 952 965) the Hoare annotation is: false [2019-01-12 14:54:53,839 INFO L448 ceAbstractionStarter]: For program point L698(lines 698 704) no Hoare annotation was computed. [2019-01-12 14:54:53,840 INFO L444 ceAbstractionStarter]: At program point L698-1(lines 698 704) the Hoare annotation is: (let ((.cse1 (= ~systemActive~0 1)) (.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse3 (<= 1 ~waterLevel~0)) (.cse2 (= ~pumpRunning~0 0))) (or (and (<= 2 ~waterLevel~0) .cse0 .cse1) (and (and .cse0 .cse2) .cse3 .cse1) (and (= ~systemActive~0 0) .cse0 .cse3 .cse2))) [2019-01-12 14:54:53,842 INFO L444 ceAbstractionStarter]: At program point L271(lines 256 274) the Hoare annotation is: (and (<= 1 ULTIMATE.start_isLowWaterLevel_~tmp___0~1) (= 0 |ULTIMATE.start_isLowWaterSensorDry_#res|) (= ULTIMATE.start_test_~splverifierCounter~0 0) (<= 1 |ULTIMATE.start_isLowWaterLevel_#res|) (<= 1 ~waterLevel~0) (= 0 ULTIMATE.start_isLowWaterLevel_~tmp~4) (= ~systemActive~0 1)) [2019-01-12 14:54:53,842 INFO L444 ceAbstractionStarter]: At program point L271-1(lines 256 274) the Hoare annotation is: false [2019-01-12 14:54:53,842 INFO L444 ceAbstractionStarter]: At program point L271-2(lines 256 274) the Hoare annotation is: false [2019-01-12 14:54:53,842 INFO L444 ceAbstractionStarter]: At program point L271-3(lines 256 274) the Hoare annotation is: false [2019-01-12 14:54:53,843 INFO L444 ceAbstractionStarter]: At program point L271-4(lines 256 274) the Hoare annotation is: false [2019-01-12 14:54:53,843 INFO L444 ceAbstractionStarter]: At program point L271-5(lines 256 274) the Hoare annotation is: false [2019-01-12 14:54:53,843 INFO L444 ceAbstractionStarter]: At program point L998(lines 1 1009) the Hoare annotation is: (and (= ~waterLevel~0 1) (= ~pumpRunning~0 0) (= ~systemActive~0 1)) [2019-01-12 14:54:53,843 INFO L448 ceAbstractionStarter]: For program point L868(line 868) no Hoare annotation was computed. [2019-01-12 14:54:53,843 INFO L448 ceAbstractionStarter]: For program point L868-1(line 868) no Hoare annotation was computed. [2019-01-12 14:54:53,843 INFO L448 ceAbstractionStarter]: For program point L868-2(line 868) no Hoare annotation was computed. [2019-01-12 14:54:53,843 INFO L448 ceAbstractionStarter]: For program point L903(lines 903 907) no Hoare annotation was computed. [2019-01-12 14:54:53,843 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 868) no Hoare annotation was computed. [2019-01-12 14:54:53,843 INFO L448 ceAbstractionStarter]: For program point L144(lines 144 161) no Hoare annotation was computed. [2019-01-12 14:54:53,844 INFO L448 ceAbstractionStarter]: For program point L144-1(lines 144 161) no Hoare annotation was computed. [2019-01-12 14:54:53,844 INFO L448 ceAbstractionStarter]: For program point L144-2(lines 144 161) no Hoare annotation was computed. [2019-01-12 14:54:53,844 INFO L444 ceAbstractionStarter]: At program point L971(lines 966 974) the Hoare annotation is: (and (= 0 |ULTIMATE.start_isLowWaterSensorDry_#res|) (= ULTIMATE.start_test_~splverifierCounter~0 0) (<= 1 ~waterLevel~0) (= ~systemActive~0 1)) [2019-01-12 14:54:53,844 INFO L444 ceAbstractionStarter]: At program point L971-1(lines 966 974) the Hoare annotation is: false [2019-01-12 14:54:53,844 INFO L444 ceAbstractionStarter]: At program point L971-2(lines 966 974) the Hoare annotation is: false [2019-01-12 14:54:53,844 INFO L444 ceAbstractionStarter]: At program point L971-3(lines 966 974) the Hoare annotation is: false [2019-01-12 14:54:53,844 INFO L444 ceAbstractionStarter]: At program point L971-4(lines 966 974) the Hoare annotation is: false [2019-01-12 14:54:53,844 INFO L444 ceAbstractionStarter]: At program point L971-5(lines 966 974) the Hoare annotation is: false [2019-01-12 14:54:53,844 INFO L448 ceAbstractionStarter]: For program point L708(lines 708 723) no Hoare annotation was computed. [2019-01-12 14:54:53,844 INFO L448 ceAbstractionStarter]: For program point L279(lines 279 285) no Hoare annotation was computed. [2019-01-12 14:54:53,844 INFO L444 ceAbstractionStarter]: At program point L279-1(lines 279 285) the Hoare annotation is: (and (= ULTIMATE.start_test_~splverifierCounter~0 0) (<= 1 ~waterLevel~0) (= ~pumpRunning~0 0)) [2019-01-12 14:54:53,845 INFO L448 ceAbstractionStarter]: For program point L246(lines 246 250) no Hoare annotation was computed. [2019-01-12 14:54:53,845 INFO L448 ceAbstractionStarter]: For program point L246-2(lines 246 250) no Hoare annotation was computed. [2019-01-12 14:54:53,845 INFO L448 ceAbstractionStarter]: For program point L246-3(lines 246 250) no Hoare annotation was computed. [2019-01-12 14:54:53,845 INFO L448 ceAbstractionStarter]: For program point L246-5(lines 246 250) no Hoare annotation was computed. [2019-01-12 14:54:53,845 INFO L448 ceAbstractionStarter]: For program point L246-6(lines 246 250) no Hoare annotation was computed. [2019-01-12 14:54:53,845 INFO L444 ceAbstractionStarter]: At program point L1006(lines 1001 1009) the Hoare annotation is: (and (= ~waterLevel~0 1) (= ~pumpRunning~0 0) (= ~systemActive~0 1)) [2019-01-12 14:54:53,845 INFO L448 ceAbstractionStarter]: For program point L246-8(lines 246 250) no Hoare annotation was computed. [2019-01-12 14:54:53,845 INFO L448 ceAbstractionStarter]: For program point L246-9(lines 246 250) no Hoare annotation was computed. [2019-01-12 14:54:53,845 INFO L448 ceAbstractionStarter]: For program point L246-11(lines 246 250) no Hoare annotation was computed. [2019-01-12 14:54:53,845 INFO L448 ceAbstractionStarter]: For program point L246-12(lines 246 250) no Hoare annotation was computed. [2019-01-12 14:54:53,845 INFO L448 ceAbstractionStarter]: For program point L246-14(lines 246 250) no Hoare annotation was computed. [2019-01-12 14:54:53,846 INFO L448 ceAbstractionStarter]: For program point L246-15(lines 246 250) no Hoare annotation was computed. [2019-01-12 14:54:53,846 INFO L448 ceAbstractionStarter]: For program point L246-17(lines 246 250) no Hoare annotation was computed. [2019-01-12 14:54:53,846 INFO L448 ceAbstractionStarter]: For program point L246-18(lines 246 250) no Hoare annotation was computed. [2019-01-12 14:54:53,846 INFO L448 ceAbstractionStarter]: For program point L246-20(lines 246 250) no Hoare annotation was computed. [2019-01-12 14:54:53,846 INFO L448 ceAbstractionStarter]: For program point L246-21(lines 246 250) no Hoare annotation was computed. [2019-01-12 14:54:53,846 INFO L448 ceAbstractionStarter]: For program point L246-23(lines 246 250) no Hoare annotation was computed. [2019-01-12 14:54:53,846 INFO L448 ceAbstractionStarter]: For program point L246-24(lines 246 250) no Hoare annotation was computed. [2019-01-12 14:54:53,846 INFO L448 ceAbstractionStarter]: For program point L246-26(lines 246 250) no Hoare annotation was computed. [2019-01-12 14:54:53,846 INFO L448 ceAbstractionStarter]: For program point L246-27(lines 246 250) no Hoare annotation was computed. [2019-01-12 14:54:53,846 INFO L448 ceAbstractionStarter]: For program point L246-29(lines 246 250) no Hoare annotation was computed. [2019-01-12 14:54:53,847 INFO L448 ceAbstractionStarter]: For program point L246-30(lines 246 250) no Hoare annotation was computed. [2019-01-12 14:54:53,847 INFO L448 ceAbstractionStarter]: For program point L246-32(lines 246 250) no Hoare annotation was computed. [2019-01-12 14:54:53,847 INFO L448 ceAbstractionStarter]: For program point L246-33(lines 246 250) no Hoare annotation was computed. [2019-01-12 14:54:53,847 INFO L448 ceAbstractionStarter]: For program point L148(lines 148 156) no Hoare annotation was computed. [2019-01-12 14:54:53,847 INFO L448 ceAbstractionStarter]: For program point L148-1(lines 148 156) no Hoare annotation was computed. [2019-01-12 14:54:53,847 INFO L448 ceAbstractionStarter]: For program point L246-35(lines 246 250) no Hoare annotation was computed. [2019-01-12 14:54:53,847 INFO L448 ceAbstractionStarter]: For program point L148-2(lines 148 156) no Hoare annotation was computed. [2019-01-12 14:54:53,847 INFO L444 ceAbstractionStarter]: At program point L776-2(lines 776 790) the Hoare annotation is: false [2019-01-12 14:54:53,847 INFO L448 ceAbstractionStarter]: For program point L777(line 777) no Hoare annotation was computed. [2019-01-12 14:54:53,848 INFO L448 ceAbstractionStarter]: For program point L679(lines 678 727) no Hoare annotation was computed. [2019-01-12 14:54:53,848 INFO L448 ceAbstractionStarter]: For program point L118(lines 118 135) no Hoare annotation was computed. [2019-01-12 14:54:53,848 INFO L448 ceAbstractionStarter]: For program point L118-1(lines 118 135) no Hoare annotation was computed. [2019-01-12 14:54:53,848 INFO L448 ceAbstractionStarter]: For program point L118-2(lines 118 135) no Hoare annotation was computed. [2019-01-12 14:54:53,848 INFO L448 ceAbstractionStarter]: For program point L118-3(lines 118 135) no Hoare annotation was computed. [2019-01-12 14:54:53,848 INFO L448 ceAbstractionStarter]: For program point L118-4(lines 118 135) no Hoare annotation was computed. [2019-01-12 14:54:53,848 INFO L448 ceAbstractionStarter]: For program point L118-5(lines 118 135) no Hoare annotation was computed. [2019-01-12 14:54:53,848 INFO L448 ceAbstractionStarter]: For program point L680(lines 680 684) no Hoare annotation was computed. [2019-01-12 14:54:53,848 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 14:54:53,848 INFO L448 ceAbstractionStarter]: For program point L879(lines 879 883) no Hoare annotation was computed. [2019-01-12 14:54:53,848 INFO L448 ceAbstractionStarter]: For program point L879-3(lines 879 883) no Hoare annotation was computed. [2019-01-12 14:54:53,849 INFO L448 ceAbstractionStarter]: For program point L780(lines 780 784) no Hoare annotation was computed. [2019-01-12 14:54:53,849 INFO L448 ceAbstractionStarter]: For program point L747(lines 747 760) no Hoare annotation was computed. [2019-01-12 14:54:53,849 INFO L448 ceAbstractionStarter]: For program point L780-1(lines 60 66) no Hoare annotation was computed. [2019-01-12 14:54:53,849 INFO L444 ceAbstractionStarter]: At program point L747-1(lines 1 1009) the Hoare annotation is: (let ((.cse1 (= ~systemActive~0 1)) (.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse3 (<= 1 ~waterLevel~0)) (.cse2 (= ~pumpRunning~0 0))) (or (and (<= 2 ~waterLevel~0) (<= 2 ULTIMATE.start___utac_acc__Specification4_spec__1_~tmp~9) .cse0 (<= 2 |ULTIMATE.start_getWaterLevel_#res|) .cse1) (and .cse1 (and (and .cse0 .cse2) .cse3)) (and (= ~systemActive~0 0) .cse0 .cse3 .cse2))) [2019-01-12 14:54:53,849 INFO L448 ceAbstractionStarter]: For program point L747-2(lines 747 760) no Hoare annotation was computed. [2019-01-12 14:54:53,849 INFO L448 ceAbstractionStarter]: For program point L879-6(lines 879 883) no Hoare annotation was computed. [2019-01-12 14:54:53,849 INFO L444 ceAbstractionStarter]: At program point L747-3(lines 1 1009) the Hoare annotation is: false [2019-01-12 14:54:53,849 INFO L448 ceAbstractionStarter]: For program point L747-4(lines 747 760) no Hoare annotation was computed. [2019-01-12 14:54:53,849 INFO L444 ceAbstractionStarter]: At program point L747-5(lines 1 1009) the Hoare annotation is: false [2019-01-12 14:54:53,849 INFO L444 ceAbstractionStarter]: At program point L252(lines 237 255) the Hoare annotation is: false [2019-01-12 14:54:53,850 INFO L444 ceAbstractionStarter]: At program point L252-1(lines 237 255) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse1 (= ~pumpRunning~0 0)) (.cse2 (= ~systemActive~0 1))) (or (and (<= 1 ~waterLevel~0) (and (= 0 |ULTIMATE.start_isHighWaterLevel_#res|) .cse0 (= 0 ULTIMATE.start_isHighWaterLevel_~tmp___0~0) (not (= 0 ULTIMATE.start_isHighWaterLevel_~tmp~3)) .cse1) .cse2) (and (and (<= 2 ~waterLevel~0) .cse0 .cse1) .cse2))) [2019-01-12 14:54:53,850 INFO L444 ceAbstractionStarter]: At program point L252-2(lines 237 255) the Hoare annotation is: false [2019-01-12 14:54:53,850 INFO L444 ceAbstractionStarter]: At program point L252-3(lines 237 255) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse1 (= ~pumpRunning~0 0)) (.cse2 (= ~systemActive~0 1))) (or (and (and (<= 1 ~waterLevel~0) (and (= 0 |ULTIMATE.start_isHighWaterLevel_#res|) .cse0 (= 0 ULTIMATE.start_isHighWaterLevel_~tmp___0~0) (not (= 0 ULTIMATE.start_isHighWaterLevel_~tmp~3)) .cse1)) .cse2) (and (and (<= 2 ~waterLevel~0) .cse0 .cse1) .cse2))) [2019-01-12 14:54:53,850 INFO L444 ceAbstractionStarter]: At program point L252-4(lines 237 255) the Hoare annotation is: false [2019-01-12 14:54:53,850 INFO L444 ceAbstractionStarter]: At program point L252-5(lines 237 255) the Hoare annotation is: false [2019-01-12 14:54:53,850 INFO L444 ceAbstractionStarter]: At program point L252-6(lines 237 255) the Hoare annotation is: false [2019-01-12 14:54:53,850 INFO L444 ceAbstractionStarter]: At program point L252-7(lines 237 255) the Hoare annotation is: false [2019-01-12 14:54:53,850 INFO L444 ceAbstractionStarter]: At program point L252-8(lines 237 255) the Hoare annotation is: false [2019-01-12 14:54:53,850 INFO L444 ceAbstractionStarter]: At program point L252-9(lines 237 255) the Hoare annotation is: false [2019-01-12 14:54:53,850 INFO L444 ceAbstractionStarter]: At program point L252-10(lines 237 255) the Hoare annotation is: false [2019-01-12 14:54:53,851 INFO L444 ceAbstractionStarter]: At program point L252-11(lines 237 255) the Hoare annotation is: false [2019-01-12 14:54:53,851 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 868) no Hoare annotation was computed. [2019-01-12 14:54:53,851 INFO L448 ceAbstractionStarter]: For program point L716(lines 716 722) no Hoare annotation was computed. [2019-01-12 14:54:53,851 INFO L444 ceAbstractionStarter]: At program point L716-1(lines 60 66) the Hoare annotation is: (let ((.cse2 (= ULTIMATE.start_test_~splverifierCounter~0 0))) (let ((.cse0 (and .cse2 (= ~pumpRunning~0 0))) (.cse1 (<= 1 ~waterLevel~0)) (.cse3 (= ~systemActive~0 1))) (or (and (= ~systemActive~0 0) .cse0 .cse1) (and (<= 2 ~waterLevel~0) .cse2 .cse3) (and .cse0 .cse1 .cse3)))) [2019-01-12 14:54:53,851 INFO L444 ceAbstractionStarter]: At program point L188(lines 181 191) the Hoare annotation is: (and (= ULTIMATE.start_test_~splverifierCounter~0 0) (<= 1 ~waterLevel~0) (= ~systemActive~0 1)) [2019-01-12 14:54:53,851 INFO L444 ceAbstractionStarter]: At program point L188-1(lines 181 191) the Hoare annotation is: false [2019-01-12 14:54:53,851 INFO L448 ceAbstractionStarter]: For program point L122(lines 122 130) no Hoare annotation was computed. [2019-01-12 14:54:53,851 INFO L444 ceAbstractionStarter]: At program point L188-2(lines 181 191) the Hoare annotation is: false [2019-01-12 14:54:53,851 INFO L448 ceAbstractionStarter]: For program point L122-1(lines 122 130) no Hoare annotation was computed. [2019-01-12 14:54:53,852 INFO L448 ceAbstractionStarter]: For program point L122-2(lines 122 130) no Hoare annotation was computed. [2019-01-12 14:54:53,852 INFO L448 ceAbstractionStarter]: For program point L122-3(lines 122 130) no Hoare annotation was computed. [2019-01-12 14:54:53,852 INFO L448 ceAbstractionStarter]: For program point L122-4(lines 122 130) no Hoare annotation was computed. [2019-01-12 14:54:53,852 INFO L448 ceAbstractionStarter]: For program point L122-5(lines 122 130) no Hoare annotation was computed. [2019-01-12 14:54:53,852 INFO L444 ceAbstractionStarter]: At program point L948(lines 943 951) the Hoare annotation is: (let ((.cse1 (= ~systemActive~0 1)) (.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse3 (<= 1 ~waterLevel~0)) (.cse2 (= ~pumpRunning~0 0))) (or (and (<= 2 ~waterLevel~0) .cse0 (<= 2 |ULTIMATE.start_getWaterLevel_#res|) .cse1) (and (and (and .cse0 .cse2) .cse1) .cse3) (and (= ~systemActive~0 0) .cse0 .cse3 .cse2))) [2019-01-12 14:54:53,852 INFO L444 ceAbstractionStarter]: At program point L948-1(lines 943 951) the Hoare annotation is: false [2019-01-12 14:54:53,852 INFO L444 ceAbstractionStarter]: At program point L948-2(lines 943 951) the Hoare annotation is: false [2019-01-12 14:54:53,852 INFO L444 ceAbstractionStarter]: At program point L916(lines 911 919) the Hoare annotation is: (and (= ULTIMATE.start_test_~splverifierCounter~0 0) (<= 1 ~waterLevel~0) (= ~systemActive~0 1)) [2019-01-12 14:54:53,852 INFO L444 ceAbstractionStarter]: At program point L916-1(lines 911 919) the Hoare annotation is: false [2019-01-12 14:54:53,852 INFO L448 ceAbstractionStarter]: For program point L850(lines 850 857) no Hoare annotation was computed. [2019-01-12 14:54:53,853 INFO L444 ceAbstractionStarter]: At program point L916-2(lines 911 919) the Hoare annotation is: false [2019-01-12 14:54:53,853 INFO L451 ceAbstractionStarter]: At program point L850-1(lines 850 857) the Hoare annotation is: true [2019-01-12 14:54:53,853 INFO L448 ceAbstractionStarter]: For program point L751(lines 751 757) no Hoare annotation was computed. [2019-01-12 14:54:53,853 INFO L448 ceAbstractionStarter]: For program point L751-2(lines 751 757) no Hoare annotation was computed. [2019-01-12 14:54:53,853 INFO L448 ceAbstractionStarter]: For program point L751-4(lines 751 757) no Hoare annotation was computed. [2019-01-12 14:54:53,853 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 14:54:53,853 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 868) no Hoare annotation was computed. [2019-01-12 14:54:53,853 INFO L448 ceAbstractionStarter]: For program point L92(lines 92 109) no Hoare annotation was computed. [2019-01-12 14:54:53,853 INFO L448 ceAbstractionStarter]: For program point L92-1(lines 92 109) no Hoare annotation was computed. [2019-01-12 14:54:53,853 INFO L448 ceAbstractionStarter]: For program point L92-2(lines 92 109) no Hoare annotation was computed. [2019-01-12 14:54:53,853 INFO L448 ceAbstractionStarter]: For program point L92-3(lines 92 109) no Hoare annotation was computed. [2019-01-12 14:54:53,853 INFO L448 ceAbstractionStarter]: For program point L92-4(lines 92 109) no Hoare annotation was computed. [2019-01-12 14:54:53,854 INFO L448 ceAbstractionStarter]: For program point L92-5(lines 92 109) no Hoare annotation was computed. [2019-01-12 14:54:53,854 INFO L448 ceAbstractionStarter]: For program point L92-6(lines 92 109) no Hoare annotation was computed. [2019-01-12 14:54:53,854 INFO L448 ceAbstractionStarter]: For program point L92-7(lines 92 109) no Hoare annotation was computed. [2019-01-12 14:54:53,854 INFO L448 ceAbstractionStarter]: For program point L92-8(lines 92 109) no Hoare annotation was computed. [2019-01-12 14:54:53,854 INFO L448 ceAbstractionStarter]: For program point L92-9(lines 92 109) no Hoare annotation was computed. [2019-01-12 14:54:53,854 INFO L448 ceAbstractionStarter]: For program point L92-10(lines 92 109) no Hoare annotation was computed. [2019-01-12 14:54:53,854 INFO L448 ceAbstractionStarter]: For program point L92-11(lines 92 109) no Hoare annotation was computed. [2019-01-12 14:54:53,854 INFO L444 ceAbstractionStarter]: At program point L60(lines 59 78) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse1 (<= 1 ~waterLevel~0))) (or (and (= ~systemActive~0 0) (and .cse0 (= ~pumpRunning~0 0)) .cse1) (and .cse0 .cse1 (= ~systemActive~0 1)))) [2019-01-12 14:54:53,854 INFO L448 ceAbstractionStarter]: For program point L60-1(lines 60 66) no Hoare annotation was computed. [2019-01-12 14:54:53,854 INFO L444 ceAbstractionStarter]: At program point L60-2(lines 59 78) the Hoare annotation is: false [2019-01-12 14:54:53,855 INFO L444 ceAbstractionStarter]: At program point L60-3(lines 59 78) the Hoare annotation is: false [2019-01-12 14:54:53,855 INFO L448 ceAbstractionStarter]: For program point L688(lines 688 694) no Hoare annotation was computed. [2019-01-12 14:54:53,855 INFO L444 ceAbstractionStarter]: At program point L688-1(lines 688 694) the Hoare annotation is: (let ((.cse1 (= ~systemActive~0 1)) (.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse3 (<= 1 ~waterLevel~0)) (.cse2 (= ~pumpRunning~0 0))) (or (and (<= 2 ~waterLevel~0) .cse0 .cse1) (and (and .cse0 .cse2) .cse3 .cse1) (and (= ~systemActive~0 0) .cse0 .cse3 .cse2))) [2019-01-12 14:54:53,855 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 14:54:53,855 INFO L448 ceAbstractionStarter]: For program point L96(lines 96 104) no Hoare annotation was computed. [2019-01-12 14:54:53,855 INFO L448 ceAbstractionStarter]: For program point L96-1(lines 96 104) no Hoare annotation was computed. [2019-01-12 14:54:53,855 INFO L448 ceAbstractionStarter]: For program point L96-2(lines 96 104) no Hoare annotation was computed. [2019-01-12 14:54:53,855 INFO L448 ceAbstractionStarter]: For program point L96-3(lines 96 104) no Hoare annotation was computed. [2019-01-12 14:54:53,855 INFO L448 ceAbstractionStarter]: For program point L96-4(lines 96 104) no Hoare annotation was computed. [2019-01-12 14:54:53,855 INFO L448 ceAbstractionStarter]: For program point L96-5(lines 96 104) no Hoare annotation was computed. [2019-01-12 14:54:53,856 INFO L448 ceAbstractionStarter]: For program point L96-6(lines 96 104) no Hoare annotation was computed. [2019-01-12 14:54:53,856 INFO L448 ceAbstractionStarter]: For program point L96-7(lines 96 104) no Hoare annotation was computed. [2019-01-12 14:54:53,856 INFO L448 ceAbstractionStarter]: For program point L96-8(lines 96 104) no Hoare annotation was computed. [2019-01-12 14:54:53,856 INFO L448 ceAbstractionStarter]: For program point L96-9(lines 96 104) no Hoare annotation was computed. [2019-01-12 14:54:53,856 INFO L448 ceAbstractionStarter]: For program point L96-10(lines 96 104) no Hoare annotation was computed. [2019-01-12 14:54:53,856 INFO L448 ceAbstractionStarter]: For program point L96-11(lines 96 104) no Hoare annotation was computed. [2019-01-12 14:54:53,856 INFO L448 ceAbstractionStarter]: For program point L956(lines 956 962) no Hoare annotation was computed. [2019-01-12 14:54:53,856 INFO L448 ceAbstractionStarter]: For program point L956-1(lines 956 962) no Hoare annotation was computed. [2019-01-12 14:54:53,856 INFO L448 ceAbstractionStarter]: For program point L956-2(lines 956 962) no Hoare annotation was computed. [2019-01-12 14:54:53,856 INFO L448 ceAbstractionStarter]: For program point L956-3(lines 956 962) no Hoare annotation was computed. [2019-01-12 14:54:53,856 INFO L444 ceAbstractionStarter]: At program point L824(lines 820 826) the Hoare annotation is: (and (= ~waterLevel~0 1) (= ~pumpRunning~0 0) (= ~systemActive~0 1)) [2019-01-12 14:54:53,857 INFO L448 ceAbstractionStarter]: For program point L956-4(lines 956 962) no Hoare annotation was computed. [2019-01-12 14:54:53,857 INFO L448 ceAbstractionStarter]: For program point L956-5(lines 956 962) no Hoare annotation was computed. [2019-01-12 14:54:53,857 INFO L448 ceAbstractionStarter]: For program point L956-6(lines 956 962) no Hoare annotation was computed. [2019-01-12 14:54:53,857 INFO L448 ceAbstractionStarter]: For program point L956-7(lines 956 962) no Hoare annotation was computed. [2019-01-12 14:54:53,857 INFO L448 ceAbstractionStarter]: For program point L956-8(lines 956 962) no Hoare annotation was computed. [2019-01-12 14:54:53,857 INFO L448 ceAbstractionStarter]: For program point L956-9(lines 956 962) no Hoare annotation was computed. [2019-01-12 14:54:53,857 INFO L448 ceAbstractionStarter]: For program point L956-10(lines 956 962) no Hoare annotation was computed. [2019-01-12 14:54:53,857 INFO L448 ceAbstractionStarter]: For program point L956-11(lines 956 962) no Hoare annotation was computed. [2019-01-12 14:54:53,857 INFO L444 ceAbstractionStarter]: At program point L197(lines 192 200) the Hoare annotation is: (let ((.cse0 (= 0 |ULTIMATE.start_isPumpRunning_#res|)) (.cse1 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse2 (<= 1 ~waterLevel~0)) (.cse3 (= ~pumpRunning~0 0))) (or (and (and .cse0 .cse1 .cse2 .cse3) (= ~systemActive~0 1)) (and (= ~systemActive~0 0) .cse0 .cse1 .cse2 .cse3))) [2019-01-12 14:54:53,857 INFO L444 ceAbstractionStarter]: At program point L197-1(lines 192 200) the Hoare annotation is: false [2019-01-12 14:54:53,858 INFO L444 ceAbstractionStarter]: At program point L197-2(lines 192 200) the Hoare annotation is: false [2019-01-12 14:54:53,858 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 14:54:53,858 INFO L448 ceAbstractionStarter]: For program point L891(lines 891 895) no Hoare annotation was computed. [2019-01-12 14:54:53,858 INFO L451 ceAbstractionStarter]: At program point L859(lines 840 862) the Hoare annotation is: true [2019-01-12 14:54:53,858 INFO L448 ceAbstractionStarter]: For program point L265(lines 265 269) no Hoare annotation was computed. [2019-01-12 14:54:53,858 INFO L448 ceAbstractionStarter]: For program point L265-2(lines 265 269) no Hoare annotation was computed. [2019-01-12 14:54:53,858 INFO L448 ceAbstractionStarter]: For program point L265-3(lines 265 269) no Hoare annotation was computed. [2019-01-12 14:54:53,858 INFO L448 ceAbstractionStarter]: For program point L265-5(lines 265 269) no Hoare annotation was computed. [2019-01-12 14:54:53,858 INFO L444 ceAbstractionStarter]: At program point L67(lines 67 73) the Hoare annotation is: (let ((.cse3 (= ULTIMATE.start_test_~splverifierCounter~0 0))) (let ((.cse2 (= ~systemActive~0 1)) (.cse0 (and .cse3 (= ~pumpRunning~0 0))) (.cse1 (<= 1 ~waterLevel~0))) (or (and .cse0 .cse1 .cse2) (and (<= 2 ~waterLevel~0) .cse3 .cse2) (and (= ~systemActive~0 0) .cse0 .cse1)))) [2019-01-12 14:54:53,858 INFO L448 ceAbstractionStarter]: For program point L265-6(lines 265 269) no Hoare annotation was computed. [2019-01-12 14:54:53,859 INFO L444 ceAbstractionStarter]: At program point L67-1(lines 67 73) the Hoare annotation is: false [2019-01-12 14:54:53,859 INFO L448 ceAbstractionStarter]: For program point L265-8(lines 265 269) no Hoare annotation was computed. [2019-01-12 14:54:53,859 INFO L444 ceAbstractionStarter]: At program point L67-2(lines 67 73) the Hoare annotation is: false [2019-01-12 14:54:53,859 INFO L448 ceAbstractionStarter]: For program point L265-9(lines 265 269) no Hoare annotation was computed. [2019-01-12 14:54:53,859 INFO L448 ceAbstractionStarter]: For program point L265-11(lines 265 269) no Hoare annotation was computed. [2019-01-12 14:54:53,859 INFO L448 ceAbstractionStarter]: For program point L265-12(lines 265 269) no Hoare annotation was computed. [2019-01-12 14:54:53,859 INFO L448 ceAbstractionStarter]: For program point L265-14(lines 265 269) no Hoare annotation was computed. [2019-01-12 14:54:53,859 INFO L448 ceAbstractionStarter]: For program point L265-15(lines 265 269) no Hoare annotation was computed. [2019-01-12 14:54:53,859 INFO L444 ceAbstractionStarter]: At program point L728(lines 677 729) the Hoare annotation is: false [2019-01-12 14:54:53,859 INFO L448 ceAbstractionStarter]: For program point L265-17(lines 265 269) no Hoare annotation was computed. [2019-01-12 14:54:53,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 02:54:53 BoogieIcfgContainer [2019-01-12 14:54:53,918 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 14:54:53,919 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 14:54:53,919 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 14:54:53,920 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 14:54:53,920 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:54:36" (3/4) ... [2019-01-12 14:54:53,931 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 14:54:53,960 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 38 nodes and edges [2019-01-12 14:54:53,962 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2019-01-12 14:54:53,964 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-01-12 14:54:53,966 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-12 14:54:53,968 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 14:54:53,969 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-12 14:54:54,008 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((2 <= waterLevel && 2 <= tmp) && splverifierCounter == 0) && 2 <= \result) && systemActive == 1) || (systemActive == 1 && (splverifierCounter == 0 && pumpRunning == 0) && 1 <= waterLevel)) || (((systemActive == 0 && splverifierCounter == 0) && 1 <= waterLevel) && pumpRunning == 0) [2019-01-12 14:54:54,012 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((2 <= waterLevel && splverifierCounter == 0) && 2 <= \result) && systemActive == 1) || (((splverifierCounter == 0 && pumpRunning == 0) && systemActive == 1) && 1 <= waterLevel)) || (((systemActive == 0 && splverifierCounter == 0) && 1 <= waterLevel) && pumpRunning == 0) [2019-01-12 14:54:54,015 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((0 == \result && splverifierCounter == 0) && 1 <= waterLevel) && pumpRunning == 0) && systemActive == 1) || ((((systemActive == 0 && 0 == \result) && splverifierCounter == 0) && 1 <= waterLevel) && pumpRunning == 0) [2019-01-12 14:54:54,015 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(0 == \result) && splverifierCounter == 0) && pumpRunning == 0) && 1 <= waterLevel) && systemActive == 1) || (((2 <= waterLevel && splverifierCounter == 0) && pumpRunning == 0) && systemActive == 1) [2019-01-12 14:54:54,018 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((1 <= waterLevel && (((0 == \result && splverifierCounter == 0) && 0 == tmp___0) && !(0 == tmp)) && pumpRunning == 0) && systemActive == 1) || (((2 <= waterLevel && splverifierCounter == 0) && pumpRunning == 0) && systemActive == 1) [2019-01-12 14:54:54,019 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((0 == \result && splverifierCounter == 0) && 1 <= waterLevel) && systemActive == 1 [2019-01-12 14:54:54,020 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(0 == \result) && splverifierCounter == 0) && pumpRunning == 0) && 1 <= waterLevel) && systemActive == 1) || (((2 <= waterLevel && splverifierCounter == 0) && pumpRunning == 0) && systemActive == 1) [2019-01-12 14:54:54,021 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((1 <= tmp___0 && 0 == \result) && splverifierCounter == 0) && 1 <= \result) && 1 <= waterLevel) && 0 == tmp) && systemActive == 1 [2019-01-12 14:54:54,021 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((1 <= waterLevel && (((0 == \result && splverifierCounter == 0) && 0 == tmp___0) && !(0 == tmp)) && pumpRunning == 0) && systemActive == 1) || (((2 <= waterLevel && splverifierCounter == 0) && pumpRunning == 0) && systemActive == 1) [2019-01-12 14:54:54,173 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 14:54:54,173 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 14:54:54,174 INFO L168 Benchmark]: Toolchain (without parser) took 20565.02 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 295.7 MB). Free memory was 952.7 MB in the beginning and 1.2 GB in the end (delta: -203.9 MB). Peak memory consumption was 91.8 MB. Max. memory is 11.5 GB. [2019-01-12 14:54:54,176 INFO L168 Benchmark]: CDTParser took 0.15 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. [2019-01-12 14:54:54,176 INFO L168 Benchmark]: CACSL2BoogieTranslator took 703.19 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.3 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -146.8 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. [2019-01-12 14:54:54,177 INFO L168 Benchmark]: Boogie Procedure Inliner took 97.57 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-01-12 14:54:54,179 INFO L168 Benchmark]: Boogie Preprocessor took 85.93 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-01-12 14:54:54,179 INFO L168 Benchmark]: RCFGBuilder took 2174.77 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 81.0 MB). Peak memory consumption was 81.0 MB. Max. memory is 11.5 GB. [2019-01-12 14:54:54,181 INFO L168 Benchmark]: TraceAbstraction took 17243.05 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 181.4 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -180.5 MB). Peak memory consumption was 390.8 MB. Max. memory is 11.5 GB. [2019-01-12 14:54:54,181 INFO L168 Benchmark]: Witness Printer took 254.21 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 28.7 MB). Peak memory consumption was 28.7 MB. Max. memory is 11.5 GB. [2019-01-12 14:54:54,186 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.15 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 703.19 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.3 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -146.8 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 97.57 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 85.93 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2174.77 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 81.0 MB). Peak memory consumption was 81.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 17243.05 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 181.4 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -180.5 MB). Peak memory consumption was 390.8 MB. Max. memory is 11.5 GB. * Witness Printer took 254.21 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 28.7 MB). Peak memory consumption was 28.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 868]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 868]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 868]: 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: 698]: Loop Invariant Derived loop invariant: (((2 <= waterLevel && splverifierCounter == 0) && systemActive == 1) || (((splverifierCounter == 0 && pumpRunning == 0) && 1 <= waterLevel) && systemActive == 1)) || (((systemActive == 0 && splverifierCounter == 0) && 1 <= waterLevel) && pumpRunning == 0) - InvariantResult [Line: 237]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: ((((0 == \result && splverifierCounter == 0) && 1 <= waterLevel) && pumpRunning == 0) && systemActive == 1) || ((((systemActive == 0 && 0 == \result) && splverifierCounter == 0) && 1 <= waterLevel) && pumpRunning == 0) - InvariantResult [Line: 237]: Loop Invariant Derived loop invariant: ((1 <= waterLevel && (((0 == \result && splverifierCounter == 0) && 0 == tmp___0) && !(0 == tmp)) && pumpRunning == 0) && systemActive == 1) || (((2 <= waterLevel && splverifierCounter == 0) && pumpRunning == 0) && systemActive == 1) - InvariantResult [Line: 237]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 952]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 60]: Loop Invariant Derived loop invariant: (((systemActive == 0 && splverifierCounter == 0 && pumpRunning == 0) && 1 <= waterLevel) || ((2 <= waterLevel && splverifierCounter == 0) && systemActive == 1)) || (((splverifierCounter == 0 && pumpRunning == 0) && 1 <= waterLevel) && systemActive == 1) - InvariantResult [Line: 952]: Loop Invariant Derived loop invariant: ((((!(0 == \result) && splverifierCounter == 0) && pumpRunning == 0) && 1 <= waterLevel) && systemActive == 1) || (((2 <= waterLevel && splverifierCounter == 0) && pumpRunning == 0) && systemActive == 1) - InvariantResult [Line: 952]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 237]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 237]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 237]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (waterLevel == 1 && pumpRunning == 0) && systemActive == 1 - InvariantResult [Line: 840]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 237]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 237]: Loop Invariant Derived loop invariant: ((1 <= waterLevel && (((0 == \result && splverifierCounter == 0) && 0 == tmp___0) && !(0 == tmp)) && pumpRunning == 0) && systemActive == 1) || (((2 <= waterLevel && splverifierCounter == 0) && pumpRunning == 0) && systemActive == 1) - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 256]: Loop Invariant Derived loop invariant: (((((1 <= tmp___0 && 0 == \result) && splverifierCounter == 0) && 1 <= \result) && 1 <= waterLevel) && 0 == tmp) && systemActive == 1 - InvariantResult [Line: 1001]: Loop Invariant Derived loop invariant: (waterLevel == 1 && pumpRunning == 0) && systemActive == 1 - InvariantResult [Line: 677]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 943]: Loop Invariant Derived loop invariant: ((((2 <= waterLevel && splverifierCounter == 0) && 2 <= \result) && systemActive == 1) || (((splverifierCounter == 0 && pumpRunning == 0) && systemActive == 1) && 1 <= waterLevel)) || (((systemActive == 0 && splverifierCounter == 0) && 1 <= waterLevel) && pumpRunning == 0) - InvariantResult [Line: 256]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 943]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 256]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 943]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 256]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 256]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 776]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 256]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 688]: Loop Invariant Derived loop invariant: (((2 <= waterLevel && splverifierCounter == 0) && systemActive == 1) || (((splverifierCounter == 0 && pumpRunning == 0) && 1 <= waterLevel) && systemActive == 1)) || (((systemActive == 0 && splverifierCounter == 0) && 1 <= waterLevel) && pumpRunning == 0) - InvariantResult [Line: 59]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 181]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 820]: Loop Invariant Derived loop invariant: (waterLevel == 1 && pumpRunning == 0) && systemActive == 1 - InvariantResult [Line: 181]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 59]: Loop Invariant Derived loop invariant: ((systemActive == 0 && splverifierCounter == 0 && pumpRunning == 0) && 1 <= waterLevel) || ((splverifierCounter == 0 && 1 <= waterLevel) && systemActive == 1) - InvariantResult [Line: 181]: Loop Invariant Derived loop invariant: (splverifierCounter == 0 && 1 <= waterLevel) && systemActive == 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((2 <= waterLevel && 2 <= tmp) && splverifierCounter == 0) && 2 <= \result) && systemActive == 1) || (systemActive == 1 && (splverifierCounter == 0 && pumpRunning == 0) && 1 <= waterLevel)) || (((systemActive == 0 && splverifierCounter == 0) && 1 <= waterLevel) && pumpRunning == 0) - InvariantResult [Line: 911]: Loop Invariant Derived loop invariant: (splverifierCounter == 0 && 1 <= waterLevel) && systemActive == 1 - InvariantResult [Line: 966]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 911]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 966]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 279]: Loop Invariant Derived loop invariant: (splverifierCounter == 0 && 1 <= waterLevel) && pumpRunning == 0 - InvariantResult [Line: 67]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 911]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 966]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 850]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 67]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 966]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 67]: Loop Invariant Derived loop invariant: ((((splverifierCounter == 0 && pumpRunning == 0) && 1 <= waterLevel) && systemActive == 1) || ((2 <= waterLevel && splverifierCounter == 0) && systemActive == 1)) || ((systemActive == 0 && splverifierCounter == 0 && pumpRunning == 0) && 1 <= waterLevel) - InvariantResult [Line: 59]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 952]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 952]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 237]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 952]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 237]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 952]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 966]: Loop Invariant Derived loop invariant: ((0 == \result && splverifierCounter == 0) && 1 <= waterLevel) && systemActive == 1 - InvariantResult [Line: 237]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 966]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 237]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 952]: Loop Invariant Derived loop invariant: ((((!(0 == \result) && splverifierCounter == 0) && pumpRunning == 0) && 1 <= waterLevel) && systemActive == 1) || (((2 <= waterLevel && splverifierCounter == 0) && pumpRunning == 0) && systemActive == 1) - InvariantResult [Line: 952]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 952]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 952]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 952]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 191 locations, 3 error locations. SAFE Result, 17.1s OverallTime, 12 OverallIterations, 2 TraceHistogramMax, 6.7s AutomataDifference, 0.0s DeadEndRemovalTime, 6.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 1703 SDtfs, 2394 SDslu, 2796 SDs, 0 SdLazy, 369 SolverSat, 92 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 150 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=344occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 1432 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 68 LocationsWithAnnotation, 68 PreInvPairs, 263 NumberOfFragments, 591 HoareAnnotationTreeSize, 68 FomulaSimplifications, 883893 FormulaSimplificationTreeSizeReduction, 1.4s HoareSimplificationTime, 68 FomulaSimplificationsInter, 49336 FormulaSimplificationTreeSizeReductionInter, 5.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 448 NumberOfCodeBlocks, 448 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 435 ConstructedInterpolants, 0 QuantifiedInterpolants, 25775 SizeOfPredicates, 4 NumberOfNonLiveVariables, 422 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 13 InterpolantComputations, 12 PerfectInterpolantSequences, 54/56 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...