./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec5_product50_true-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/product-lines/minepump_spec5_product50_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 c6fd2ec47fce99d621bc8e726cd390df6cdcdca1 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 14:55:45,938 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 14:55:45,939 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 14:55:45,952 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 14:55:45,952 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 14:55:45,953 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 14:55:45,955 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 14:55:45,957 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 14:55:45,958 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 14:55:45,959 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 14:55:45,960 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 14:55:45,960 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 14:55:45,961 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 14:55:45,963 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 14:55:45,964 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 14:55:45,965 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 14:55:45,966 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 14:55:45,968 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 14:55:45,970 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 14:55:45,971 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 14:55:45,973 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 14:55:45,974 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 14:55:45,977 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 14:55:45,977 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 14:55:45,977 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 14:55:45,978 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 14:55:45,980 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 14:55:45,981 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 14:55:45,981 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 14:55:45,983 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 14:55:45,983 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 14:55:45,984 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 14:55:45,984 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 14:55:45,984 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 14:55:45,986 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 14:55:45,987 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 14:55:45,987 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 14:55:46,003 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 14:55:46,003 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 14:55:46,004 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 14:55:46,004 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 14:55:46,004 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 14:55:46,005 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 14:55:46,005 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 14:55:46,005 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 14:55:46,005 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 14:55:46,005 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 14:55:46,006 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 14:55:46,007 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 14:55:46,007 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 14:55:46,007 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 14:55:46,007 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 14:55:46,007 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 14:55:46,008 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 14:55:46,008 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 14:55:46,009 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 14:55:46,009 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 14:55:46,009 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 14:55:46,009 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 14:55:46,009 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 14:55:46,009 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 14:55:46,010 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 14:55:46,010 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 14:55:46,010 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 14:55:46,010 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 14:55:46,010 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 -> c6fd2ec47fce99d621bc8e726cd390df6cdcdca1 [2019-01-12 14:55:46,051 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 14:55:46,073 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 14:55:46,079 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 14:55:46,081 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 14:55:46,081 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 14:55:46,082 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec5_product50_true-unreach-call_false-termination.cil.c [2019-01-12 14:55:46,153 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/373c75ec5/3e46e4bd08a44384bd2c106e743a9c2b/FLAGf996a71fe [2019-01-12 14:55:46,664 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 14:55:46,665 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec5_product50_true-unreach-call_false-termination.cil.c [2019-01-12 14:55:46,678 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/373c75ec5/3e46e4bd08a44384bd2c106e743a9c2b/FLAGf996a71fe [2019-01-12 14:55:46,951 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/373c75ec5/3e46e4bd08a44384bd2c106e743a9c2b [2019-01-12 14:55:46,955 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 14:55:46,956 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 14:55:46,958 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 14:55:46,958 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 14:55:46,962 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 14:55:46,963 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:55:46" (1/1) ... [2019-01-12 14:55:46,966 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c81f530 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:55:46, skipping insertion in model container [2019-01-12 14:55:46,966 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:55:46" (1/1) ... [2019-01-12 14:55:46,974 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 14:55:47,038 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 14:55:47,377 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:55:47,395 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 14:55:47,579 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:55:47,619 INFO L195 MainTranslator]: Completed translation [2019-01-12 14:55:47,619 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:55:47 WrapperNode [2019-01-12 14:55:47,619 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 14:55:47,620 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 14:55:47,620 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 14:55:47,621 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 14:55:47,628 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:55:47" (1/1) ... [2019-01-12 14:55:47,652 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:55:47" (1/1) ... [2019-01-12 14:55:47,699 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 14:55:47,699 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 14:55:47,699 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 14:55:47,699 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 14:55:47,710 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:55:47" (1/1) ... [2019-01-12 14:55:47,710 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:55:47" (1/1) ... [2019-01-12 14:55:47,716 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:55:47" (1/1) ... [2019-01-12 14:55:47,716 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:55:47" (1/1) ... [2019-01-12 14:55:47,731 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:55:47" (1/1) ... [2019-01-12 14:55:47,741 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:55:47" (1/1) ... [2019-01-12 14:55:47,752 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:55:47" (1/1) ... [2019-01-12 14:55:47,762 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 14:55:47,762 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 14:55:47,762 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 14:55:47,762 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 14:55:47,765 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:55:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 14:55:47,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 14:55:47,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-12 14:55:47,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 14:55:47,838 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 14:55:49,454 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 14:55:49,455 INFO L286 CfgBuilder]: Removed 172 assue(true) statements. [2019-01-12 14:55:49,456 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:55:49 BoogieIcfgContainer [2019-01-12 14:55:49,456 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 14:55:49,457 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 14:55:49,457 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 14:55:49,460 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 14:55:49,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 02:55:46" (1/3) ... [2019-01-12 14:55:49,461 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a922293 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:55:49, skipping insertion in model container [2019-01-12 14:55:49,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:55:47" (2/3) ... [2019-01-12 14:55:49,462 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a922293 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:55:49, skipping insertion in model container [2019-01-12 14:55:49,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:55:49" (3/3) ... [2019-01-12 14:55:49,464 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec5_product50_true-unreach-call_false-termination.cil.c [2019-01-12 14:55:49,474 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 14:55:49,482 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-12 14:55:49,499 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-12 14:55:49,532 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 14:55:49,533 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 14:55:49,533 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 14:55:49,533 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 14:55:49,533 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 14:55:49,534 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 14:55:49,534 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 14:55:49,534 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 14:55:49,534 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 14:55:49,553 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states. [2019-01-12 14:55:49,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-12 14:55:49,560 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:55:49,561 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:55:49,563 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:55:49,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:55:49,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1143595135, now seen corresponding path program 1 times [2019-01-12 14:55:49,570 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:55:49,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:55:49,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:49,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:55:49,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:49,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:55:49,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:55:49,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:55:49,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:55:49,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 14:55:49,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 14:55:49,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 14:55:49,840 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 2 states. [2019-01-12 14:55:49,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:55:49,881 INFO L93 Difference]: Finished difference Result 245 states and 370 transitions. [2019-01-12 14:55:49,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 14:55:49,883 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2019-01-12 14:55:49,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:55:49,897 INFO L225 Difference]: With dead ends: 245 [2019-01-12 14:55:49,897 INFO L226 Difference]: Without dead ends: 122 [2019-01-12 14:55:49,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 14:55:49,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-01-12 14:55:49,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2019-01-12 14:55:49,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-01-12 14:55:49,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 177 transitions. [2019-01-12 14:55:49,983 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 177 transitions. Word has length 19 [2019-01-12 14:55:49,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:55:49,983 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 177 transitions. [2019-01-12 14:55:49,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 14:55:49,984 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 177 transitions. [2019-01-12 14:55:49,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-12 14:55:49,985 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:55:49,987 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:55:49,987 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:55:49,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:55:49,988 INFO L82 PathProgramCache]: Analyzing trace with hash 662424418, now seen corresponding path program 1 times [2019-01-12 14:55:49,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:55:49,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:55:49,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:49,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:55:49,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:50,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:55:50,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:55:50,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:55:50,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 14:55:50,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:55:50,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:55:50,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:55:50,175 INFO L87 Difference]: Start difference. First operand 122 states and 177 transitions. Second operand 3 states. [2019-01-12 14:55:50,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:55:50,205 INFO L93 Difference]: Finished difference Result 122 states and 177 transitions. [2019-01-12 14:55:50,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:55:50,206 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-01-12 14:55:50,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:55:50,208 INFO L225 Difference]: With dead ends: 122 [2019-01-12 14:55:50,208 INFO L226 Difference]: Without dead ends: 51 [2019-01-12 14:55:50,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:55:50,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-12 14:55:50,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-01-12 14:55:50,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-12 14:55:50,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 73 transitions. [2019-01-12 14:55:50,217 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 73 transitions. Word has length 20 [2019-01-12 14:55:50,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:55:50,218 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 73 transitions. [2019-01-12 14:55:50,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:55:50,219 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 73 transitions. [2019-01-12 14:55:50,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-12 14:55:50,220 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:55:50,221 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:55:50,222 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:55:50,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:55:50,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1983331463, now seen corresponding path program 1 times [2019-01-12 14:55:50,222 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:55:50,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:55:50,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:50,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:55:50,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:50,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:55:50,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:55:50,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:55:50,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 14:55:50,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:55:50,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:55:50,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:55:50,378 INFO L87 Difference]: Start difference. First operand 51 states and 73 transitions. Second operand 3 states. [2019-01-12 14:55:50,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:55:50,432 INFO L93 Difference]: Finished difference Result 95 states and 139 transitions. [2019-01-12 14:55:50,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:55:50,435 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-01-12 14:55:50,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:55:50,436 INFO L225 Difference]: With dead ends: 95 [2019-01-12 14:55:50,438 INFO L226 Difference]: Without dead ends: 51 [2019-01-12 14:55:50,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:55:50,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-12 14:55:50,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-01-12 14:55:50,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-12 14:55:50,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 72 transitions. [2019-01-12 14:55:50,457 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 72 transitions. Word has length 26 [2019-01-12 14:55:50,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:55:50,457 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 72 transitions. [2019-01-12 14:55:50,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:55:50,458 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 72 transitions. [2019-01-12 14:55:50,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-12 14:55:50,462 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:55:50,462 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:55:50,462 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:55:50,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:55:50,463 INFO L82 PathProgramCache]: Analyzing trace with hash -630940105, now seen corresponding path program 1 times [2019-01-12 14:55:50,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:55:50,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:55:50,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:50,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:55:50,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:50,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:55:50,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:55:50,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:55:50,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:55:50,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:55:50,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:55:50,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:55:50,562 INFO L87 Difference]: Start difference. First operand 51 states and 72 transitions. Second operand 3 states. [2019-01-12 14:55:50,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:55:50,768 INFO L93 Difference]: Finished difference Result 119 states and 171 transitions. [2019-01-12 14:55:50,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:55:50,770 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-01-12 14:55:50,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:55:50,772 INFO L225 Difference]: With dead ends: 119 [2019-01-12 14:55:50,772 INFO L226 Difference]: Without dead ends: 75 [2019-01-12 14:55:50,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:55:50,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-12 14:55:50,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2019-01-12 14:55:50,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-12 14:55:50,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 102 transitions. [2019-01-12 14:55:50,788 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 102 transitions. Word has length 28 [2019-01-12 14:55:50,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:55:50,789 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 102 transitions. [2019-01-12 14:55:50,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:55:50,789 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 102 transitions. [2019-01-12 14:55:50,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-12 14:55:50,790 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:55:50,790 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:55:50,791 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:55:50,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:55:50,791 INFO L82 PathProgramCache]: Analyzing trace with hash -351362712, now seen corresponding path program 1 times [2019-01-12 14:55:50,791 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:55:50,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:55:50,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:50,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:55:50,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:50,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:55:50,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:55:50,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:55:50,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:55:50,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:55:50,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:55:50,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:55:50,974 INFO L87 Difference]: Start difference. First operand 73 states and 102 transitions. Second operand 5 states. [2019-01-12 14:55:51,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:55:51,341 INFO L93 Difference]: Finished difference Result 263 states and 373 transitions. [2019-01-12 14:55:51,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 14:55:51,342 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-01-12 14:55:51,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:55:51,343 INFO L225 Difference]: With dead ends: 263 [2019-01-12 14:55:51,344 INFO L226 Difference]: Without dead ends: 197 [2019-01-12 14:55:51,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 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:55:51,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-01-12 14:55:51,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 77. [2019-01-12 14:55:51,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-12 14:55:51,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 106 transitions. [2019-01-12 14:55:51,371 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 106 transitions. Word has length 34 [2019-01-12 14:55:51,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:55:51,372 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 106 transitions. [2019-01-12 14:55:51,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:55:51,372 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 106 transitions. [2019-01-12 14:55:51,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-12 14:55:51,373 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:55:51,373 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:55:51,373 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:55:51,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:55:51,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1052427290, now seen corresponding path program 1 times [2019-01-12 14:55:51,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:55:51,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:55:51,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:51,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:55:51,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:51,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:55:51,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:55:51,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:55:51,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:55:51,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:55:51,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:55:51,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:55:51,506 INFO L87 Difference]: Start difference. First operand 77 states and 106 transitions. Second operand 5 states. [2019-01-12 14:55:51,697 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-12 14:55:51,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:55:51,928 INFO L93 Difference]: Finished difference Result 202 states and 278 transitions. [2019-01-12 14:55:51,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 14:55:51,929 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-01-12 14:55:51,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:55:51,931 INFO L225 Difference]: With dead ends: 202 [2019-01-12 14:55:51,931 INFO L226 Difference]: Without dead ends: 132 [2019-01-12 14:55:51,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-12 14:55:51,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-01-12 14:55:51,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 83. [2019-01-12 14:55:51,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-01-12 14:55:51,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 112 transitions. [2019-01-12 14:55:51,944 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 112 transitions. Word has length 34 [2019-01-12 14:55:51,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:55:51,945 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 112 transitions. [2019-01-12 14:55:51,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:55:51,945 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 112 transitions. [2019-01-12 14:55:51,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-12 14:55:51,946 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:55:51,946 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:55:51,946 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:55:51,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:55:51,947 INFO L82 PathProgramCache]: Analyzing trace with hash -118963581, now seen corresponding path program 1 times [2019-01-12 14:55:51,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:55:51,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:55:51,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:51,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:55:51,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:51,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:55:52,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:55:52,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:55:52,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:55:52,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:55:52,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:55:52,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:55:52,213 INFO L87 Difference]: Start difference. First operand 83 states and 112 transitions. Second operand 5 states. [2019-01-12 14:55:53,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:55:53,153 INFO L93 Difference]: Finished difference Result 282 states and 383 transitions. [2019-01-12 14:55:53,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 14:55:53,154 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-01-12 14:55:53,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:55:53,156 INFO L225 Difference]: With dead ends: 282 [2019-01-12 14:55:53,156 INFO L226 Difference]: Without dead ends: 206 [2019-01-12 14:55:53,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-12 14:55:53,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-01-12 14:55:53,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 82. [2019-01-12 14:55:53,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-01-12 14:55:53,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 109 transitions. [2019-01-12 14:55:53,173 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 109 transitions. Word has length 34 [2019-01-12 14:55:53,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:55:53,173 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 109 transitions. [2019-01-12 14:55:53,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:55:53,174 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 109 transitions. [2019-01-12 14:55:53,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-12 14:55:53,176 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:55:53,176 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:55:53,177 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:55:53,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:55:53,178 INFO L82 PathProgramCache]: Analyzing trace with hash -938168726, now seen corresponding path program 1 times [2019-01-12 14:55:53,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:55:53,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:55:53,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:53,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:55:53,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:53,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:55:53,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:55:53,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:55:53,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:55:53,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:55:53,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:55:53,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:55:53,287 INFO L87 Difference]: Start difference. First operand 82 states and 109 transitions. Second operand 3 states. [2019-01-12 14:55:53,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:55:53,392 INFO L93 Difference]: Finished difference Result 185 states and 247 transitions. [2019-01-12 14:55:53,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:55:53,392 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-01-12 14:55:53,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:55:53,393 INFO L225 Difference]: With dead ends: 185 [2019-01-12 14:55:53,393 INFO L226 Difference]: Without dead ends: 110 [2019-01-12 14:55:53,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:55:53,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-01-12 14:55:53,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-01-12 14:55:53,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-01-12 14:55:53,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 143 transitions. [2019-01-12 14:55:53,412 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 143 transitions. Word has length 34 [2019-01-12 14:55:53,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:55:53,412 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 143 transitions. [2019-01-12 14:55:53,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:55:53,413 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 143 transitions. [2019-01-12 14:55:53,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-12 14:55:53,414 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:55:53,414 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:55:53,414 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:55:53,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:55:53,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1960852394, now seen corresponding path program 1 times [2019-01-12 14:55:53,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:55:53,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:55:53,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:53,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:55:53,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:53,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:55:53,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:55:53,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:55:53,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 14:55:53,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 14:55:53,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 14:55:53,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-12 14:55:53,587 INFO L87 Difference]: Start difference. First operand 110 states and 143 transitions. Second operand 6 states. [2019-01-12 14:55:54,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:55:54,219 INFO L93 Difference]: Finished difference Result 413 states and 551 transitions. [2019-01-12 14:55:54,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 14:55:54,219 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2019-01-12 14:55:54,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:55:54,222 INFO L225 Difference]: With dead ends: 413 [2019-01-12 14:55:54,222 INFO L226 Difference]: Without dead ends: 338 [2019-01-12 14:55:54,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-12 14:55:54,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-01-12 14:55:54,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 155. [2019-01-12 14:55:54,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-01-12 14:55:54,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 199 transitions. [2019-01-12 14:55:54,251 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 199 transitions. Word has length 35 [2019-01-12 14:55:54,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:55:54,252 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 199 transitions. [2019-01-12 14:55:54,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 14:55:54,252 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 199 transitions. [2019-01-12 14:55:54,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-12 14:55:54,254 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:55:54,254 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:55:54,255 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:55:54,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:55:54,255 INFO L82 PathProgramCache]: Analyzing trace with hash -503867042, now seen corresponding path program 1 times [2019-01-12 14:55:54,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:55:54,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:55:54,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:54,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:55:54,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:55:54,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:55:54,531 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:55:54,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:55:54,532 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:55:54,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:55:54,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:55:54,693 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:55:55,106 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:55:55,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:55:55,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-01-12 14:55:55,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 14:55:55,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 14:55:55,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-01-12 14:55:55,137 INFO L87 Difference]: Start difference. First operand 155 states and 199 transitions. Second operand 8 states. [2019-01-12 14:55:56,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:55:56,202 INFO L93 Difference]: Finished difference Result 312 states and 417 transitions. [2019-01-12 14:55:56,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 14:55:56,203 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2019-01-12 14:55:56,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:55:56,203 INFO L225 Difference]: With dead ends: 312 [2019-01-12 14:55:56,204 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 14:55:56,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-01-12 14:55:56,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 14:55:56,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 14:55:56,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 14:55:56,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 14:55:56,211 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58 [2019-01-12 14:55:56,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:55:56,212 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 14:55:56,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 14:55:56,212 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 14:55:56,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 14:55:56,222 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 14:55:56,387 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:56,463 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:56,532 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:56,533 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:56,540 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:56,574 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:56,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:56,607 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:56,608 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:56,610 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:56,619 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:56,622 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:56,625 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:56,627 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:56,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:56,700 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:56,706 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:56,714 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:56,794 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:55:58,437 WARN L181 SmtUtils]: Spent 1.63 s on a formula simplification. DAG size of input: 55 DAG size of output: 30 [2019-01-12 14:55:58,597 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 26 [2019-01-12 14:55:58,885 WARN L181 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 25 [2019-01-12 14:55:59,137 WARN L181 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 25 [2019-01-12 14:55:59,262 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 22 [2019-01-12 14:55:59,541 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 24 [2019-01-12 14:56:00,187 WARN L181 SmtUtils]: Spent 568.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 25 [2019-01-12 14:56:00,619 WARN L181 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 25 [2019-01-12 14:56:00,799 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 21 [2019-01-12 14:56:00,823 INFO L448 ceAbstractionStarter]: For program point L104(lines 104 121) no Hoare annotation was computed. [2019-01-12 14:56:00,823 INFO L448 ceAbstractionStarter]: For program point L104-1(lines 104 121) no Hoare annotation was computed. [2019-01-12 14:56:00,823 INFO L448 ceAbstractionStarter]: For program point L104-2(lines 104 121) no Hoare annotation was computed. [2019-01-12 14:56:00,823 INFO L448 ceAbstractionStarter]: For program point L104-3(lines 104 121) no Hoare annotation was computed. [2019-01-12 14:56:00,823 INFO L448 ceAbstractionStarter]: For program point L104-4(lines 104 121) no Hoare annotation was computed. [2019-01-12 14:56:00,823 INFO L448 ceAbstractionStarter]: For program point L104-5(lines 104 121) no Hoare annotation was computed. [2019-01-12 14:56:00,823 INFO L448 ceAbstractionStarter]: For program point L303(lines 303 309) no Hoare annotation was computed. [2019-01-12 14:56:00,824 INFO L444 ceAbstractionStarter]: At program point L303-1(lines 303 309) the Hoare annotation is: (let ((.cse1 (and (= ULTIMATE.start_test_~splverifierCounter~0 0) (= ~systemActive~0 1))) (.cse0 (<= ~waterLevel~0 2)) (.cse2 (= 1 ~pumpRunning~0))) (or (and .cse0 (and .cse1 (= 0 ~pumpRunning~0))) (and (and .cse1 .cse0) (= ~switchedOnBeforeTS~0 1) .cse2 (= 1 |ULTIMATE.start_isPumpRunning_#res|)) (and (and .cse1 (<= 2 ~waterLevel~0) .cse0) .cse2))) [2019-01-12 14:56:00,824 INFO L444 ceAbstractionStarter]: At program point L72(lines 68 90) the Hoare annotation is: (let ((.cse1 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse0 (<= ~waterLevel~0 2)) (.cse2 (= ~systemActive~0 1))) (or (and .cse0 (and (and .cse1 .cse2) (= 0 ~pumpRunning~0))) (and .cse1 (= ~switchedOnBeforeTS~0 1) .cse0 (= 1 ~pumpRunning~0) (= 1 |ULTIMATE.start_isPumpRunning_#res|) .cse2))) [2019-01-12 14:56:00,824 INFO L444 ceAbstractionStarter]: At program point L72-1(lines 68 90) the Hoare annotation is: false [2019-01-12 14:56:00,824 INFO L444 ceAbstractionStarter]: At program point L72-2(lines 68 90) the Hoare annotation is: false [2019-01-12 14:56:00,824 INFO L444 ceAbstractionStarter]: At program point L238(lines 223 241) the Hoare annotation is: false [2019-01-12 14:56:00,824 INFO L444 ceAbstractionStarter]: At program point L238-1(lines 223 241) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse1 (<= ~waterLevel~0 2)) (.cse2 (= ~pumpRunning~0 0)) (.cse3 (= ~systemActive~0 1))) (or (and (<= 2 ~waterLevel~0) .cse0 .cse1 .cse2 .cse3) (and (= 0 |ULTIMATE.start_isHighWaterLevel_#res|) .cse0 .cse1 (= 0 ULTIMATE.start_isHighWaterLevel_~tmp___0~0) .cse2 .cse3))) [2019-01-12 14:56:00,825 INFO L444 ceAbstractionStarter]: At program point L238-2(lines 223 241) the Hoare annotation is: false [2019-01-12 14:56:00,825 INFO L444 ceAbstractionStarter]: At program point L238-3(lines 223 241) the Hoare annotation is: false [2019-01-12 14:56:00,825 INFO L444 ceAbstractionStarter]: At program point L238-4(lines 223 241) the Hoare annotation is: false [2019-01-12 14:56:00,825 INFO L444 ceAbstractionStarter]: At program point L238-5(lines 223 241) the Hoare annotation is: false [2019-01-12 14:56:00,825 INFO L448 ceAbstractionStarter]: For program point L371(lines 371 375) no Hoare annotation was computed. [2019-01-12 14:56:00,825 INFO L448 ceAbstractionStarter]: For program point L108(lines 108 116) no Hoare annotation was computed. [2019-01-12 14:56:00,825 INFO L448 ceAbstractionStarter]: For program point L108-1(lines 108 116) no Hoare annotation was computed. [2019-01-12 14:56:00,825 INFO L448 ceAbstractionStarter]: For program point L108-2(lines 108 116) no Hoare annotation was computed. [2019-01-12 14:56:00,825 INFO L448 ceAbstractionStarter]: For program point L108-3(lines 108 116) no Hoare annotation was computed. [2019-01-12 14:56:00,825 INFO L448 ceAbstractionStarter]: For program point L108-4(lines 108 116) no Hoare annotation was computed. [2019-01-12 14:56:00,825 INFO L448 ceAbstractionStarter]: For program point L108-5(lines 108 116) no Hoare annotation was computed. [2019-01-12 14:56:00,826 INFO L444 ceAbstractionStarter]: At program point L439(lines 434 442) the Hoare annotation is: (and (= ULTIMATE.start_test_~splverifierCounter~0 0) (= ~switchedOnBeforeTS~0 1) (<= ~waterLevel~0 2) (= 1 ~pumpRunning~0) (= 1 |ULTIMATE.start_isPumpRunning_#res|) (= ~systemActive~0 1)) [2019-01-12 14:56:00,826 INFO L444 ceAbstractionStarter]: At program point L439-1(lines 434 442) the Hoare annotation is: false [2019-01-12 14:56:00,826 INFO L444 ceAbstractionStarter]: At program point L439-2(lines 434 442) the Hoare annotation is: false [2019-01-12 14:56:00,826 INFO L448 ceAbstractionStarter]: For program point L44(line 44) no Hoare annotation was computed. [2019-01-12 14:56:00,826 INFO L448 ceAbstractionStarter]: For program point L44-1(line 44) no Hoare annotation was computed. [2019-01-12 14:56:00,826 INFO L448 ceAbstractionStarter]: For program point L44-2(line 44) no Hoare annotation was computed. [2019-01-12 14:56:00,826 INFO L448 ceAbstractionStarter]: For program point L837(lines 837 854) no Hoare annotation was computed. [2019-01-12 14:56:00,826 INFO L444 ceAbstractionStarter]: At program point L837-1(lines 1 992) the Hoare annotation is: (let ((.cse2 (= 1 ~pumpRunning~0)) (.cse1 (<= ~waterLevel~0 2)) (.cse0 (and (= ULTIMATE.start_test_~splverifierCounter~0 0) (= ~systemActive~0 1)))) (or (and (and .cse0 .cse1) (= ~switchedOnBeforeTS~0 1) .cse2 (= 1 |ULTIMATE.start_isPumpRunning_#res|)) (and .cse0 (<= 2 ~waterLevel~0) (< 1 ULTIMATE.start___utac_acc__Specification5_spec__3_~tmp~8) (<= ULTIMATE.start___utac_acc__Specification5_spec__3_~tmp~8 2) .cse1 .cse2 (<= |ULTIMATE.start_getWaterLevel_#res| 2) (<= 2 |ULTIMATE.start_getWaterLevel_#res|)) (and .cse1 (and .cse0 (= 0 ~pumpRunning~0))))) [2019-01-12 14:56:00,826 INFO L448 ceAbstractionStarter]: For program point L837-2(lines 837 854) no Hoare annotation was computed. [2019-01-12 14:56:00,827 INFO L444 ceAbstractionStarter]: At program point L837-3(lines 1 992) the Hoare annotation is: false [2019-01-12 14:56:00,827 INFO L448 ceAbstractionStarter]: For program point L837-4(lines 837 854) no Hoare annotation was computed. [2019-01-12 14:56:00,827 INFO L444 ceAbstractionStarter]: At program point L837-5(lines 1 992) the Hoare annotation is: false [2019-01-12 14:56:00,827 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 44) no Hoare annotation was computed. [2019-01-12 14:56:00,827 INFO L444 ceAbstractionStarter]: At program point L79(lines 79 85) the Hoare annotation is: (let ((.cse2 (= 1 ~pumpRunning~0)) (.cse1 (<= ~waterLevel~0 2)) (.cse0 (and (= ULTIMATE.start_test_~splverifierCounter~0 0) (= ~systemActive~0 1)))) (or (and (and .cse0 .cse1) (= ~switchedOnBeforeTS~0 1) .cse2 (= 1 |ULTIMATE.start_isPumpRunning_#res|)) (and (and .cse0 (<= 2 ~waterLevel~0) .cse1) .cse2) (and .cse1 (and .cse0 (= 0 ~pumpRunning~0))))) [2019-01-12 14:56:00,827 INFO L444 ceAbstractionStarter]: At program point L79-1(lines 79 85) the Hoare annotation is: false [2019-01-12 14:56:00,827 INFO L444 ceAbstractionStarter]: At program point L79-2(lines 79 85) the Hoare annotation is: false [2019-01-12 14:56:00,828 INFO L448 ceAbstractionStarter]: For program point L841(lines 841 851) no Hoare annotation was computed. [2019-01-12 14:56:00,828 INFO L448 ceAbstractionStarter]: For program point L841-2(lines 841 851) no Hoare annotation was computed. [2019-01-12 14:56:00,828 INFO L448 ceAbstractionStarter]: For program point L841-4(lines 841 851) no Hoare annotation was computed. [2019-01-12 14:56:00,828 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 44) no Hoare annotation was computed. [2019-01-12 14:56:00,828 INFO L448 ceAbstractionStarter]: For program point L313(lines 313 326) no Hoare annotation was computed. [2019-01-12 14:56:00,828 INFO L448 ceAbstractionStarter]: For program point L842(lines 842 848) no Hoare annotation was computed. [2019-01-12 14:56:00,828 INFO L444 ceAbstractionStarter]: At program point L908-2(lines 908 922) the Hoare annotation is: false [2019-01-12 14:56:00,828 INFO L448 ceAbstractionStarter]: For program point L842-2(lines 842 848) no Hoare annotation was computed. [2019-01-12 14:56:00,828 INFO L448 ceAbstractionStarter]: For program point L842-4(lines 842 848) no Hoare annotation was computed. [2019-01-12 14:56:00,828 INFO L448 ceAbstractionStarter]: For program point L347(lines 347 351) no Hoare annotation was computed. [2019-01-12 14:56:00,829 INFO L448 ceAbstractionStarter]: For program point L347-3(lines 347 351) no Hoare annotation was computed. [2019-01-12 14:56:00,829 INFO L448 ceAbstractionStarter]: For program point L347-6(lines 347 351) no Hoare annotation was computed. [2019-01-12 14:56:00,829 INFO L448 ceAbstractionStarter]: For program point L909(line 909) no Hoare annotation was computed. [2019-01-12 14:56:00,829 INFO L444 ceAbstractionStarter]: At program point L183(lines 178 186) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse2 (<= ~waterLevel~0 2)) (.cse3 (= 1 ~pumpRunning~0)) (.cse4 (= 1 |ULTIMATE.start_isPumpRunning_#res|)) (.cse1 (= ~systemActive~0 1))) (or (and (and (= 0 |ULTIMATE.start_isPumpRunning_#res|) (and .cse0 .cse1) (= 0 ~pumpRunning~0)) .cse2) (and .cse0 (= ~switchedOnBeforeTS~0 1) .cse2 .cse3 .cse4 .cse1) (and (<= 2 ~waterLevel~0) .cse0 .cse2 .cse3 .cse4 .cse1))) [2019-01-12 14:56:00,829 INFO L444 ceAbstractionStarter]: At program point L183-1(lines 178 186) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse2 (<= ~waterLevel~0 2)) (.cse1 (= ~systemActive~0 1))) (or (and (= 0 |ULTIMATE.start_isPumpRunning_#res|) (and .cse0 .cse1) (= 0 ~pumpRunning~0) .cse2) (and .cse0 (= ~switchedOnBeforeTS~0 1) .cse2 (= 1 ~pumpRunning~0) (= 1 |ULTIMATE.start_isPumpRunning_#res|) .cse1))) [2019-01-12 14:56:00,829 INFO L444 ceAbstractionStarter]: At program point L183-2(lines 178 186) the Hoare annotation is: false [2019-01-12 14:56:00,829 INFO L444 ceAbstractionStarter]: At program point L183-3(lines 178 186) the Hoare annotation is: false [2019-01-12 14:56:00,829 INFO L444 ceAbstractionStarter]: At program point L183-4(lines 178 186) the Hoare annotation is: false [2019-01-12 14:56:00,829 INFO L444 ceAbstractionStarter]: At program point L183-5(lines 178 186) the Hoare annotation is: false [2019-01-12 14:56:00,830 INFO L444 ceAbstractionStarter]: At program point L416(lines 411 419) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse1 (<= ~waterLevel~0 2)) (.cse2 (= 1 ~pumpRunning~0)) (.cse3 (= ~systemActive~0 1))) (or (and (<= 2 ~waterLevel~0) .cse0 .cse1 .cse2 (<= |ULTIMATE.start_getWaterLevel_#res| 2) (<= 2 |ULTIMATE.start_getWaterLevel_#res|) .cse3) (and (and (and .cse0 .cse3) (= 0 ~pumpRunning~0)) .cse1) (and .cse0 (= ~switchedOnBeforeTS~0 1) .cse1 .cse2 (= 1 |ULTIMATE.start_isPumpRunning_#res|) .cse3))) [2019-01-12 14:56:00,830 INFO L444 ceAbstractionStarter]: At program point L416-1(lines 411 419) the Hoare annotation is: false [2019-01-12 14:56:00,830 INFO L444 ceAbstractionStarter]: At program point L416-2(lines 411 419) the Hoare annotation is: false [2019-01-12 14:56:00,830 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 14:56:00,830 INFO L448 ceAbstractionStarter]: For program point L284(lines 283 330) no Hoare annotation was computed. [2019-01-12 14:56:00,830 INFO L448 ceAbstractionStarter]: For program point L251(lines 251 255) no Hoare annotation was computed. [2019-01-12 14:56:00,830 INFO L448 ceAbstractionStarter]: For program point L251-2(lines 251 255) no Hoare annotation was computed. [2019-01-12 14:56:00,830 INFO L448 ceAbstractionStarter]: For program point L251-3(lines 251 255) no Hoare annotation was computed. [2019-01-12 14:56:00,830 INFO L448 ceAbstractionStarter]: For program point L251-5(lines 251 255) no Hoare annotation was computed. [2019-01-12 14:56:00,830 INFO L448 ceAbstractionStarter]: For program point L251-6(lines 251 255) no Hoare annotation was computed. [2019-01-12 14:56:00,830 INFO L448 ceAbstractionStarter]: For program point L251-8(lines 251 255) no Hoare annotation was computed. [2019-01-12 14:56:00,831 INFO L448 ceAbstractionStarter]: For program point L912(lines 912 916) no Hoare annotation was computed. [2019-01-12 14:56:00,831 INFO L448 ceAbstractionStarter]: For program point L912-1(lines 912 916) no Hoare annotation was computed. [2019-01-12 14:56:00,831 INFO L448 ceAbstractionStarter]: For program point L285(lines 285 289) no Hoare annotation was computed. [2019-01-12 14:56:00,831 INFO L448 ceAbstractionStarter]: For program point L980(lines 980 987) no Hoare annotation was computed. [2019-01-12 14:56:00,831 INFO L451 ceAbstractionStarter]: At program point L980-1(lines 980 987) the Hoare annotation is: true [2019-01-12 14:56:00,831 INFO L444 ceAbstractionStarter]: At program point L816(lines 811 818) the Hoare annotation is: (and (= ~waterLevel~0 1) (= ~pumpRunning~0 0) (= ~systemActive~0 1)) [2019-01-12 14:56:00,831 INFO L448 ceAbstractionStarter]: For program point L321(lines 321 325) no Hoare annotation was computed. [2019-01-12 14:56:00,831 INFO L444 ceAbstractionStarter]: At program point L321-2(lines 321 325) the Hoare annotation is: (let ((.cse1 (and (= ULTIMATE.start_test_~splverifierCounter~0 0) (= ~systemActive~0 1))) (.cse0 (<= ~waterLevel~0 2)) (.cse2 (= 1 ~pumpRunning~0))) (or (and .cse0 (and .cse1 (= 0 ~pumpRunning~0))) (and (and .cse1 .cse0) (= ~switchedOnBeforeTS~0 1) .cse2 (= 1 |ULTIMATE.start_isPumpRunning_#res|)) (and (and .cse1 (<= 2 ~waterLevel~0) .cse0) .cse2))) [2019-01-12 14:56:00,831 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 44) no Hoare annotation was computed. [2019-01-12 14:56:00,831 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 14:56:00,832 INFO L444 ceAbstractionStarter]: At program point L884(lines 1 992) the Hoare annotation is: (and (= ~waterLevel~0 1) (= ~pumpRunning~0 0) (= ~systemActive~0 1)) [2019-01-12 14:56:00,832 INFO L444 ceAbstractionStarter]: At program point L257(lines 242 260) the Hoare annotation is: (and (= ULTIMATE.start_test_~splverifierCounter~0 0) (= ~switchedOnBeforeTS~0 1) (<= ~waterLevel~0 2) (= 1 ~pumpRunning~0) (= 1 |ULTIMATE.start_isPumpRunning_#res|) (= ~systemActive~0 1)) [2019-01-12 14:56:00,832 INFO L444 ceAbstractionStarter]: At program point L257-1(lines 242 260) the Hoare annotation is: false [2019-01-12 14:56:00,832 INFO L444 ceAbstractionStarter]: At program point L257-2(lines 242 260) the Hoare annotation is: false [2019-01-12 14:56:00,832 INFO L448 ceAbstractionStarter]: For program point L424(lines 424 430) no Hoare annotation was computed. [2019-01-12 14:56:00,832 INFO L448 ceAbstractionStarter]: For program point L424-1(lines 424 430) no Hoare annotation was computed. [2019-01-12 14:56:00,832 INFO L448 ceAbstractionStarter]: For program point L424-2(lines 424 430) no Hoare annotation was computed. [2019-01-12 14:56:00,832 INFO L448 ceAbstractionStarter]: For program point L424-3(lines 424 430) no Hoare annotation was computed. [2019-01-12 14:56:00,832 INFO L448 ceAbstractionStarter]: For program point L424-4(lines 424 430) no Hoare annotation was computed. [2019-01-12 14:56:00,832 INFO L448 ceAbstractionStarter]: For program point L424-5(lines 424 430) no Hoare annotation was computed. [2019-01-12 14:56:00,833 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 14:56:00,833 INFO L448 ceAbstractionStarter]: For program point L359(lines 359 363) no Hoare annotation was computed. [2019-01-12 14:56:00,833 INFO L448 ceAbstractionStarter]: For program point L293(lines 293 299) no Hoare annotation was computed. [2019-01-12 14:56:00,833 INFO L444 ceAbstractionStarter]: At program point L293-1(lines 293 299) the Hoare annotation is: (let ((.cse1 (and (= ULTIMATE.start_test_~splverifierCounter~0 0) (= ~systemActive~0 1))) (.cse0 (<= ~waterLevel~0 2)) (.cse2 (= 1 ~pumpRunning~0))) (or (and .cse0 (and .cse1 (= 0 ~pumpRunning~0))) (and (and .cse1 .cse0) (= ~switchedOnBeforeTS~0 1) .cse2 (= 1 |ULTIMATE.start_isPumpRunning_#res|)) (and (and .cse1 (<= 2 ~waterLevel~0) .cse0) .cse2))) [2019-01-12 14:56:00,833 INFO L448 ceAbstractionStarter]: For program point L130(lines 130 147) no Hoare annotation was computed. [2019-01-12 14:56:00,833 INFO L448 ceAbstractionStarter]: For program point L130-1(lines 130 147) no Hoare annotation was computed. [2019-01-12 14:56:00,833 INFO L448 ceAbstractionStarter]: For program point L130-2(lines 130 147) no Hoare annotation was computed. [2019-01-12 14:56:00,833 INFO L451 ceAbstractionStarter]: At program point L989(lines 970 992) the Hoare annotation is: true [2019-01-12 14:56:00,833 INFO L444 ceAbstractionStarter]: At program point L956(lines 952 958) the Hoare annotation is: (and (= ~waterLevel~0 1) (= ~pumpRunning~0 0) (= ~systemActive~0 1)) [2019-01-12 14:56:00,833 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 14:56:00,834 INFO L444 ceAbstractionStarter]: At program point L429(lines 420 433) the Hoare annotation is: false [2019-01-12 14:56:00,834 INFO L444 ceAbstractionStarter]: At program point L429-1(lines 420 433) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse1 (<= ~waterLevel~0 2)) (.cse2 (= ~pumpRunning~0 0)) (.cse3 (= ~systemActive~0 1))) (or (and (<= 2 ~waterLevel~0) .cse0 .cse1 .cse2 .cse3) (and (not (= 0 |ULTIMATE.start_isHighWaterSensorDry_#res|)) .cse0 .cse1 .cse2 .cse3))) [2019-01-12 14:56:00,834 INFO L444 ceAbstractionStarter]: At program point L429-2(lines 420 433) the Hoare annotation is: false [2019-01-12 14:56:00,834 INFO L444 ceAbstractionStarter]: At program point L429-3(lines 420 433) the Hoare annotation is: false [2019-01-12 14:56:00,834 INFO L444 ceAbstractionStarter]: At program point L429-4(lines 420 433) the Hoare annotation is: false [2019-01-12 14:56:00,834 INFO L444 ceAbstractionStarter]: At program point L429-5(lines 420 433) the Hoare annotation is: false [2019-01-12 14:56:00,834 INFO L444 ceAbstractionStarter]: At program point L892(lines 887 895) the Hoare annotation is: (and (= ~waterLevel~0 1) (= ~pumpRunning~0 0) (= ~systemActive~0 1)) [2019-01-12 14:56:00,834 INFO L444 ceAbstractionStarter]: At program point L826(lines 72 78) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_test_~splverifierCounter~0 0)) (.cse2 (<= ~waterLevel~0 2)) (.cse1 (= ~systemActive~0 1))) (or (and (and (= 0 |ULTIMATE.start_isPumpRunning_#res|) (and .cse0 .cse1) (= 0 ~pumpRunning~0)) .cse2) (and .cse0 (= ~switchedOnBeforeTS~0 1) .cse2 (= 1 ~pumpRunning~0) (= 1 |ULTIMATE.start_isPumpRunning_#res|) .cse1))) [2019-01-12 14:56:00,834 INFO L444 ceAbstractionStarter]: At program point L826-1(lines 72 78) the Hoare annotation is: false [2019-01-12 14:56:00,834 INFO L444 ceAbstractionStarter]: At program point L826-2(lines 72 78) the Hoare annotation is: false [2019-01-12 14:56:00,835 INFO L444 ceAbstractionStarter]: At program point L331(lines 282 332) the Hoare annotation is: false [2019-01-12 14:56:00,835 INFO L448 ceAbstractionStarter]: For program point L232(lines 232 236) no Hoare annotation was computed. [2019-01-12 14:56:00,835 INFO L448 ceAbstractionStarter]: For program point L232-2(lines 232 236) no Hoare annotation was computed. [2019-01-12 14:56:00,835 INFO L448 ceAbstractionStarter]: For program point L232-3(lines 232 236) no Hoare annotation was computed. [2019-01-12 14:56:00,835 INFO L448 ceAbstractionStarter]: For program point L232-5(lines 232 236) no Hoare annotation was computed. [2019-01-12 14:56:00,835 INFO L448 ceAbstractionStarter]: For program point L232-6(lines 232 236) no Hoare annotation was computed. [2019-01-12 14:56:00,835 INFO L448 ceAbstractionStarter]: For program point L232-8(lines 232 236) no Hoare annotation was computed. [2019-01-12 14:56:00,835 INFO L448 ceAbstractionStarter]: For program point L232-9(lines 232 236) no Hoare annotation was computed. [2019-01-12 14:56:00,835 INFO L448 ceAbstractionStarter]: For program point L232-11(lines 232 236) no Hoare annotation was computed. [2019-01-12 14:56:00,835 INFO L448 ceAbstractionStarter]: For program point L232-12(lines 232 236) no Hoare annotation was computed. [2019-01-12 14:56:00,835 INFO L448 ceAbstractionStarter]: For program point L232-14(lines 232 236) no Hoare annotation was computed. [2019-01-12 14:56:00,836 INFO L448 ceAbstractionStarter]: For program point L232-15(lines 232 236) no Hoare annotation was computed. [2019-01-12 14:56:00,836 INFO L448 ceAbstractionStarter]: For program point L232-17(lines 232 236) no Hoare annotation was computed. [2019-01-12 14:56:00,836 INFO L448 ceAbstractionStarter]: For program point L134(lines 134 142) no Hoare annotation was computed. [2019-01-12 14:56:00,836 INFO L448 ceAbstractionStarter]: For program point L134-1(lines 134 142) no Hoare annotation was computed. [2019-01-12 14:56:00,836 INFO L448 ceAbstractionStarter]: For program point L134-2(lines 134 142) no Hoare annotation was computed. [2019-01-12 14:56:00,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 02:56:00 BoogieIcfgContainer [2019-01-12 14:56:00,866 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 14:56:00,867 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 14:56:00,867 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 14:56:00,867 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 14:56:00,867 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:55:49" (3/4) ... [2019-01-12 14:56:00,871 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 14:56:00,892 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 38 nodes and edges [2019-01-12 14:56:00,894 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2019-01-12 14:56:00,895 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-01-12 14:56:00,896 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-12 14:56:00,897 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 14:56:00,897 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-12 14:56:00,930 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((splverifierCounter == 0 && systemActive == 1) && waterLevel <= 2) && switchedOnBeforeTS == 1) && 1 == pumpRunning) && 1 == \result) || ((((((((splverifierCounter == 0 && systemActive == 1) && 2 <= waterLevel) && 1 < tmp) && tmp <= 2) && waterLevel <= 2) && 1 == pumpRunning) && \result <= 2) && 2 <= \result)) || (waterLevel <= 2 && (splverifierCounter == 0 && systemActive == 1) && 0 == pumpRunning) [2019-01-12 14:56:00,931 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((waterLevel <= 2 && (splverifierCounter == 0 && systemActive == 1) && 0 == pumpRunning) || (((((splverifierCounter == 0 && systemActive == 1) && waterLevel <= 2) && switchedOnBeforeTS == 1) && 1 == pumpRunning) && 1 == \result)) || ((((splverifierCounter == 0 && systemActive == 1) && 2 <= waterLevel) && waterLevel <= 2) && 1 == pumpRunning) [2019-01-12 14:56:00,931 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((waterLevel <= 2 && (splverifierCounter == 0 && systemActive == 1) && 0 == pumpRunning) || (((((splverifierCounter == 0 && systemActive == 1) && waterLevel <= 2) && switchedOnBeforeTS == 1) && 1 == pumpRunning) && 1 == \result)) || ((((splverifierCounter == 0 && systemActive == 1) && 2 <= waterLevel) && waterLevel <= 2) && 1 == pumpRunning) [2019-01-12 14:56:00,932 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((waterLevel <= 2 && (splverifierCounter == 0 && systemActive == 1) && 0 == pumpRunning) || (((((splverifierCounter == 0 && systemActive == 1) && waterLevel <= 2) && switchedOnBeforeTS == 1) && 1 == pumpRunning) && 1 == \result)) || ((((splverifierCounter == 0 && systemActive == 1) && 2 <= waterLevel) && waterLevel <= 2) && 1 == pumpRunning) [2019-01-12 14:56:00,932 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((0 == \result && splverifierCounter == 0 && systemActive == 1) && 0 == pumpRunning) && waterLevel <= 2) || (((((splverifierCounter == 0 && switchedOnBeforeTS == 1) && waterLevel <= 2) && 1 == pumpRunning) && 1 == \result) && systemActive == 1)) || (((((2 <= waterLevel && splverifierCounter == 0) && waterLevel <= 2) && 1 == pumpRunning) && 1 == \result) && systemActive == 1) [2019-01-12 14:56:00,933 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 == \result && splverifierCounter == 0 && systemActive == 1) && 0 == pumpRunning) && waterLevel <= 2) || (((((splverifierCounter == 0 && switchedOnBeforeTS == 1) && waterLevel <= 2) && 1 == pumpRunning) && 1 == \result) && systemActive == 1) [2019-01-12 14:56:00,933 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (waterLevel <= 2 && (splverifierCounter == 0 && systemActive == 1) && 0 == pumpRunning) || (((((splverifierCounter == 0 && switchedOnBeforeTS == 1) && waterLevel <= 2) && 1 == pumpRunning) && 1 == \result) && systemActive == 1) [2019-01-12 14:56:00,934 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((splverifierCounter == 0 && systemActive == 1) && waterLevel <= 2) && switchedOnBeforeTS == 1) && 1 == pumpRunning) && 1 == \result) || ((((splverifierCounter == 0 && systemActive == 1) && 2 <= waterLevel) && waterLevel <= 2) && 1 == pumpRunning)) || (waterLevel <= 2 && (splverifierCounter == 0 && systemActive == 1) && 0 == pumpRunning) [2019-01-12 14:56:00,935 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((2 <= waterLevel && splverifierCounter == 0) && waterLevel <= 2) && 1 == pumpRunning) && \result <= 2) && 2 <= \result) && systemActive == 1) || (((splverifierCounter == 0 && systemActive == 1) && 0 == pumpRunning) && waterLevel <= 2)) || (((((splverifierCounter == 0 && switchedOnBeforeTS == 1) && waterLevel <= 2) && 1 == pumpRunning) && 1 == \result) && systemActive == 1) [2019-01-12 14:56:00,936 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((splverifierCounter == 0 && switchedOnBeforeTS == 1) && waterLevel <= 2) && 1 == pumpRunning) && 1 == \result) && systemActive == 1 [2019-01-12 14:56:00,938 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((2 <= waterLevel && splverifierCounter == 0) && waterLevel <= 2) && pumpRunning == 0) && systemActive == 1) || ((((!(0 == \result) && splverifierCounter == 0) && waterLevel <= 2) && pumpRunning == 0) && systemActive == 1) [2019-01-12 14:56:00,938 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 == \result && splverifierCounter == 0 && systemActive == 1) && 0 == pumpRunning) && waterLevel <= 2) || (((((splverifierCounter == 0 && switchedOnBeforeTS == 1) && waterLevel <= 2) && 1 == pumpRunning) && 1 == \result) && systemActive == 1) [2019-01-12 14:56:00,939 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((splverifierCounter == 0 && switchedOnBeforeTS == 1) && waterLevel <= 2) && 1 == pumpRunning) && 1 == \result) && systemActive == 1 [2019-01-12 14:56:00,939 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((2 <= waterLevel && splverifierCounter == 0) && waterLevel <= 2) && pumpRunning == 0) && systemActive == 1) || (((((0 == \result && splverifierCounter == 0) && waterLevel <= 2) && 0 == tmp___0) && pumpRunning == 0) && systemActive == 1) [2019-01-12 14:56:01,084 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 14:56:01,084 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 14:56:01,085 INFO L168 Benchmark]: Toolchain (without parser) took 14129.43 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 307.8 MB). Free memory was 952.7 MB in the beginning and 1.2 GB in the end (delta: -279.1 MB). Peak memory consumption was 28.7 MB. Max. memory is 11.5 GB. [2019-01-12 14:56:01,086 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:56:01,086 INFO L168 Benchmark]: CACSL2BoogieTranslator took 661.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -172.2 MB). Peak memory consumption was 35.9 MB. Max. memory is 11.5 GB. [2019-01-12 14:56:01,087 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.52 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 14:56:01,087 INFO L168 Benchmark]: Boogie Preprocessor took 62.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-12 14:56:01,088 INFO L168 Benchmark]: RCFGBuilder took 1693.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 64.6 MB). Peak memory consumption was 64.6 MB. Max. memory is 11.5 GB. [2019-01-12 14:56:01,088 INFO L168 Benchmark]: TraceAbstraction took 11409.35 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 162.5 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -199.4 MB). Peak memory consumption was 319.6 MB. Max. memory is 11.5 GB. [2019-01-12 14:56:01,088 INFO L168 Benchmark]: Witness Printer took 217.46 ms. Allocated memory is still 1.3 GB. Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 21.3 MB). Peak memory consumption was 21.3 MB. Max. memory is 11.5 GB. [2019-01-12 14:56:01,092 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 661.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -172.2 MB). Peak memory consumption was 35.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 78.52 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 62.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1693.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 64.6 MB). Peak memory consumption was 64.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11409.35 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 162.5 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -199.4 MB). Peak memory consumption was 319.6 MB. Max. memory is 11.5 GB. * Witness Printer took 217.46 ms. Allocated memory is still 1.3 GB. Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 21.3 MB). Peak memory consumption was 21.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 44]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 44]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 44]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((splverifierCounter == 0 && systemActive == 1) && waterLevel <= 2) && switchedOnBeforeTS == 1) && 1 == pumpRunning) && 1 == \result) || ((((((((splverifierCounter == 0 && systemActive == 1) && 2 <= waterLevel) && 1 < tmp) && tmp <= 2) && waterLevel <= 2) && 1 == pumpRunning) && \result <= 2) && 2 <= \result)) || (waterLevel <= 2 && (splverifierCounter == 0 && systemActive == 1) && 0 == pumpRunning) - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 178]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 178]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 411]: Loop Invariant Derived loop invariant: (((((((2 <= waterLevel && splverifierCounter == 0) && waterLevel <= 2) && 1 == pumpRunning) && \result <= 2) && 2 <= \result) && systemActive == 1) || (((splverifierCounter == 0 && systemActive == 1) && 0 == pumpRunning) && waterLevel <= 2)) || (((((splverifierCounter == 0 && switchedOnBeforeTS == 1) && waterLevel <= 2) && 1 == pumpRunning) && 1 == \result) && systemActive == 1) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 223]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 411]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 178]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 321]: Loop Invariant Derived loop invariant: ((waterLevel <= 2 && (splverifierCounter == 0 && systemActive == 1) && 0 == pumpRunning) || (((((splverifierCounter == 0 && systemActive == 1) && waterLevel <= 2) && switchedOnBeforeTS == 1) && 1 == pumpRunning) && 1 == \result)) || ((((splverifierCounter == 0 && systemActive == 1) && 2 <= waterLevel) && waterLevel <= 2) && 1 == pumpRunning) - InvariantResult [Line: 980]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 887]: Loop Invariant Derived loop invariant: (waterLevel == 1 && pumpRunning == 0) && systemActive == 1 - InvariantResult [Line: 303]: Loop Invariant Derived loop invariant: ((waterLevel <= 2 && (splverifierCounter == 0 && systemActive == 1) && 0 == pumpRunning) || (((((splverifierCounter == 0 && systemActive == 1) && waterLevel <= 2) && switchedOnBeforeTS == 1) && 1 == pumpRunning) && 1 == \result)) || ((((splverifierCounter == 0 && systemActive == 1) && 2 <= waterLevel) && waterLevel <= 2) && 1 == pumpRunning) - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: (((0 == \result && splverifierCounter == 0 && systemActive == 1) && 0 == pumpRunning) && waterLevel <= 2) || (((((splverifierCounter == 0 && switchedOnBeforeTS == 1) && waterLevel <= 2) && 1 == pumpRunning) && 1 == \result) && systemActive == 1) - InvariantResult [Line: 434]: Loop Invariant Derived loop invariant: ((((splverifierCounter == 0 && switchedOnBeforeTS == 1) && waterLevel <= 2) && 1 == pumpRunning) && 1 == \result) && systemActive == 1 - InvariantResult [Line: 434]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 434]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 420]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 223]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 178]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 223]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 420]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 178]: Loop Invariant Derived loop invariant: (((0 == \result && splverifierCounter == 0 && systemActive == 1) && 0 == pumpRunning) && waterLevel <= 2) || (((((splverifierCounter == 0 && switchedOnBeforeTS == 1) && waterLevel <= 2) && 1 == pumpRunning) && 1 == \result) && systemActive == 1) - InvariantResult [Line: 223]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 178]: Loop Invariant Derived loop invariant: ((((0 == \result && splverifierCounter == 0 && systemActive == 1) && 0 == pumpRunning) && waterLevel <= 2) || (((((splverifierCounter == 0 && switchedOnBeforeTS == 1) && waterLevel <= 2) && 1 == pumpRunning) && 1 == \result) && systemActive == 1)) || (((((2 <= waterLevel && splverifierCounter == 0) && waterLevel <= 2) && 1 == pumpRunning) && 1 == \result) && systemActive == 1) - InvariantResult [Line: 223]: Loop Invariant Derived loop invariant: ((((2 <= waterLevel && splverifierCounter == 0) && waterLevel <= 2) && pumpRunning == 0) && systemActive == 1) || (((((0 == \result && splverifierCounter == 0) && waterLevel <= 2) && 0 == tmp___0) && pumpRunning == 0) && systemActive == 1) - InvariantResult [Line: 811]: Loop Invariant Derived loop invariant: (waterLevel == 1 && pumpRunning == 0) && systemActive == 1 - InvariantResult [Line: 223]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 293]: Loop Invariant Derived loop invariant: ((waterLevel <= 2 && (splverifierCounter == 0 && systemActive == 1) && 0 == pumpRunning) || (((((splverifierCounter == 0 && systemActive == 1) && waterLevel <= 2) && switchedOnBeforeTS == 1) && 1 == pumpRunning) && 1 == \result)) || ((((splverifierCounter == 0 && systemActive == 1) && 2 <= waterLevel) && waterLevel <= 2) && 1 == pumpRunning) - InvariantResult [Line: 420]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 420]: Loop Invariant Derived loop invariant: ((((2 <= waterLevel && splverifierCounter == 0) && waterLevel <= 2) && pumpRunning == 0) && systemActive == 1) || ((((!(0 == \result) && splverifierCounter == 0) && waterLevel <= 2) && pumpRunning == 0) && systemActive == 1) - InvariantResult [Line: 420]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 420]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 908]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 242]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 242]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 970]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 242]: Loop Invariant Derived loop invariant: ((((splverifierCounter == 0 && switchedOnBeforeTS == 1) && waterLevel <= 2) && 1 == pumpRunning) && 1 == \result) && systemActive == 1 - InvariantResult [Line: 952]: Loop Invariant Derived loop invariant: (waterLevel == 1 && pumpRunning == 0) && systemActive == 1 - InvariantResult [Line: 79]: Loop Invariant Derived loop invariant: ((((((splverifierCounter == 0 && systemActive == 1) && waterLevel <= 2) && switchedOnBeforeTS == 1) && 1 == pumpRunning) && 1 == \result) || ((((splverifierCounter == 0 && systemActive == 1) && 2 <= waterLevel) && waterLevel <= 2) && 1 == pumpRunning)) || (waterLevel <= 2 && (splverifierCounter == 0 && systemActive == 1) && 0 == pumpRunning) - InvariantResult [Line: 68]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 68]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 282]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 68]: Loop Invariant Derived loop invariant: (waterLevel <= 2 && (splverifierCounter == 0 && systemActive == 1) && 0 == pumpRunning) || (((((splverifierCounter == 0 && switchedOnBeforeTS == 1) && waterLevel <= 2) && 1 == pumpRunning) && 1 == \result) && systemActive == 1) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (waterLevel == 1 && pumpRunning == 0) && systemActive == 1 - InvariantResult [Line: 411]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 79]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 79]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 126 locations, 3 error locations. SAFE Result, 11.3s OverallTime, 10 OverallIterations, 2 TraceHistogramMax, 3.9s AutomataDifference, 0.0s DeadEndRemovalTime, 4.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 1029 SDtfs, 1265 SDslu, 1335 SDs, 0 SdLazy, 238 SolverSat, 55 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 121 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=155occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 478 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 50 LocationsWithAnnotation, 50 PreInvPairs, 131 NumberOfFragments, 690 HoareAnnotationTreeSize, 50 FomulaSimplifications, 40559 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 50 FomulaSimplificationsInter, 11635 FormulaSimplificationTreeSizeReductionInter, 4.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 380 NumberOfCodeBlocks, 380 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 369 ConstructedInterpolants, 0 QuantifiedInterpolants, 28489 SizeOfPredicates, 4 NumberOfNonLiveVariables, 424 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 11 InterpolantComputations, 9 PerfectInterpolantSequences, 26/32 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...