./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec4_product44_false-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/product-lines/minepump_spec4_product44_false-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 cd9d3373e3670d73493569b1c43b551709fc0f6c .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 14:48:56,330 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 14:48:56,332 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 14:48:56,343 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 14:48:56,344 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 14:48:56,345 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 14:48:56,346 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 14:48:56,348 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 14:48:56,350 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 14:48:56,351 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 14:48:56,352 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 14:48:56,352 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 14:48:56,353 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 14:48:56,354 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 14:48:56,356 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 14:48:56,357 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 14:48:56,358 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 14:48:56,360 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 14:48:56,362 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 14:48:56,364 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 14:48:56,365 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 14:48:56,366 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 14:48:56,369 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 14:48:56,369 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 14:48:56,369 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 14:48:56,370 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 14:48:56,372 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 14:48:56,373 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 14:48:56,374 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 14:48:56,375 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 14:48:56,375 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 14:48:56,376 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 14:48:56,376 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 14:48:56,377 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 14:48:56,378 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 14:48:56,379 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 14:48:56,379 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:48:56,395 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 14:48:56,396 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 14:48:56,398 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 14:48:56,398 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 14:48:56,399 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 14:48:56,399 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 14:48:56,400 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 14:48:56,400 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 14:48:56,400 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 14:48:56,400 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 14:48:56,400 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 14:48:56,400 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 14:48:56,401 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 14:48:56,401 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 14:48:56,401 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 14:48:56,401 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 14:48:56,401 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 14:48:56,402 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 14:48:56,402 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 14:48:56,402 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 14:48:56,402 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 14:48:56,402 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 14:48:56,402 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 14:48:56,403 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 14:48:56,403 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 14:48:56,403 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 14:48:56,404 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 14:48:56,404 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 14:48:56,404 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 -> cd9d3373e3670d73493569b1c43b551709fc0f6c [2019-01-12 14:48:56,456 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 14:48:56,468 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 14:48:56,472 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 14:48:56,473 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 14:48:56,473 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 14:48:56,474 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec4_product44_false-unreach-call_false-termination.cil.c [2019-01-12 14:48:56,532 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af142aa5e/496efa65c42d4f329175651978570101/FLAG8642f2ab3 [2019-01-12 14:48:57,004 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 14:48:57,007 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec4_product44_false-unreach-call_false-termination.cil.c [2019-01-12 14:48:57,022 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af142aa5e/496efa65c42d4f329175651978570101/FLAG8642f2ab3 [2019-01-12 14:48:57,327 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af142aa5e/496efa65c42d4f329175651978570101 [2019-01-12 14:48:57,331 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 14:48:57,332 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 14:48:57,334 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 14:48:57,334 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 14:48:57,338 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 14:48:57,339 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:48:57" (1/1) ... [2019-01-12 14:48:57,343 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34e0b752 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:48:57, skipping insertion in model container [2019-01-12 14:48:57,343 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:48:57" (1/1) ... [2019-01-12 14:48:57,353 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 14:48:57,399 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 14:48:57,739 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:48:57,758 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 14:48:57,938 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:48:57,978 INFO L195 MainTranslator]: Completed translation [2019-01-12 14:48:57,979 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:48:57 WrapperNode [2019-01-12 14:48:57,979 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 14:48:57,980 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 14:48:57,980 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 14:48:57,980 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 14:48:57,990 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:48:57" (1/1) ... [2019-01-12 14:48:58,026 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:48:57" (1/1) ... [2019-01-12 14:48:58,096 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 14:48:58,097 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 14:48:58,099 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 14:48:58,099 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 14:48:58,109 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:48:57" (1/1) ... [2019-01-12 14:48:58,110 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:48:57" (1/1) ... [2019-01-12 14:48:58,116 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:48:57" (1/1) ... [2019-01-12 14:48:58,116 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:48:57" (1/1) ... [2019-01-12 14:48:58,136 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:48:57" (1/1) ... [2019-01-12 14:48:58,155 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:48:57" (1/1) ... [2019-01-12 14:48:58,162 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:48:57" (1/1) ... [2019-01-12 14:48:58,168 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 14:48:58,168 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 14:48:58,168 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 14:48:58,168 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 14:48:58,172 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:48:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 14:48:58,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 14:48:58,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-12 14:48:58,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 14:48:58,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 14:48:59,606 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 14:48:59,606 INFO L286 CfgBuilder]: Removed 120 assue(true) statements. [2019-01-12 14:48:59,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:48:59 BoogieIcfgContainer [2019-01-12 14:48:59,608 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 14:48:59,609 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 14:48:59,609 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 14:48:59,612 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 14:48:59,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 02:48:57" (1/3) ... [2019-01-12 14:48:59,614 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@97f2488 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:48:59, skipping insertion in model container [2019-01-12 14:48:59,614 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:48:57" (2/3) ... [2019-01-12 14:48:59,614 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@97f2488 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:48:59, skipping insertion in model container [2019-01-12 14:48:59,614 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:48:59" (3/3) ... [2019-01-12 14:48:59,616 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec4_product44_false-unreach-call_false-termination.cil.c [2019-01-12 14:48:59,626 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 14:48:59,635 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-12 14:48:59,653 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-12 14:48:59,686 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 14:48:59,687 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 14:48:59,687 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 14:48:59,687 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 14:48:59,688 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 14:48:59,688 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 14:48:59,688 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 14:48:59,688 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 14:48:59,688 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 14:48:59,707 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states. [2019-01-12 14:48:59,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-12 14:48:59,716 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:48:59,717 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:48:59,719 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:48:59,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:48:59,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1782116946, now seen corresponding path program 1 times [2019-01-12 14:48:59,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:48:59,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:48:59,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:48:59,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:48:59,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:48:59,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:49:00,006 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:49:00,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:49:00,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:49:00,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 14:49:00,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 14:49:00,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 14:49:00,035 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 2 states. [2019-01-12 14:49:00,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:49:00,075 INFO L93 Difference]: Finished difference Result 172 states and 257 transitions. [2019-01-12 14:49:00,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 14:49:00,077 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-01-12 14:49:00,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:49:00,093 INFO L225 Difference]: With dead ends: 172 [2019-01-12 14:49:00,093 INFO L226 Difference]: Without dead ends: 85 [2019-01-12 14:49:00,098 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:49:00,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-12 14:49:00,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-01-12 14:49:00,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-01-12 14:49:00,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 120 transitions. [2019-01-12 14:49:00,158 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 120 transitions. Word has length 16 [2019-01-12 14:49:00,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:49:00,161 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 120 transitions. [2019-01-12 14:49:00,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 14:49:00,161 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 120 transitions. [2019-01-12 14:49:00,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-12 14:49:00,162 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:49:00,162 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:49:00,163 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:49:00,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:49:00,163 INFO L82 PathProgramCache]: Analyzing trace with hash 735360049, now seen corresponding path program 1 times [2019-01-12 14:49:00,163 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:49:00,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:49:00,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:00,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:49:00,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:00,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:49:00,373 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:49:00,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:49:00,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 14:49:00,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:49:00,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:49:00,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:49:00,380 INFO L87 Difference]: Start difference. First operand 85 states and 120 transitions. Second operand 3 states. [2019-01-12 14:49:00,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:49:00,406 INFO L93 Difference]: Finished difference Result 85 states and 120 transitions. [2019-01-12 14:49:00,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:49:00,407 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-01-12 14:49:00,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:49:00,408 INFO L225 Difference]: With dead ends: 85 [2019-01-12 14:49:00,409 INFO L226 Difference]: Without dead ends: 39 [2019-01-12 14:49:00,410 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:49:00,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-12 14:49:00,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-01-12 14:49:00,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-12 14:49:00,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 55 transitions. [2019-01-12 14:49:00,416 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 55 transitions. Word has length 17 [2019-01-12 14:49:00,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:49:00,419 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 55 transitions. [2019-01-12 14:49:00,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:49:00,419 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 55 transitions. [2019-01-12 14:49:00,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-12 14:49:00,421 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:49:00,421 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:49:00,421 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:49:00,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:49:00,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1297648259, now seen corresponding path program 1 times [2019-01-12 14:49:00,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:49:00,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:49:00,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:00,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:49:00,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:00,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:49:00,548 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:49:00,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:49:00,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 14:49:00,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:49:00,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:49:00,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:49:00,551 INFO L87 Difference]: Start difference. First operand 39 states and 55 transitions. Second operand 3 states. [2019-01-12 14:49:00,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:49:00,639 INFO L93 Difference]: Finished difference Result 105 states and 153 transitions. [2019-01-12 14:49:00,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:49:00,641 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-01-12 14:49:00,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:49:00,643 INFO L225 Difference]: With dead ends: 105 [2019-01-12 14:49:00,643 INFO L226 Difference]: Without dead ends: 72 [2019-01-12 14:49:00,644 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:49:00,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-01-12 14:49:00,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2019-01-12 14:49:00,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-12 14:49:00,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 99 transitions. [2019-01-12 14:49:00,659 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 99 transitions. Word has length 22 [2019-01-12 14:49:00,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:49:00,659 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 99 transitions. [2019-01-12 14:49:00,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:49:00,660 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 99 transitions. [2019-01-12 14:49:00,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-12 14:49:00,661 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:49:00,661 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] [2019-01-12 14:49:00,661 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:49:00,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:49:00,662 INFO L82 PathProgramCache]: Analyzing trace with hash -372126526, now seen corresponding path program 1 times [2019-01-12 14:49:00,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:49:00,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:49:00,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:00,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:49:00,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:00,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:49:00,751 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:49:00,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:49:00,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:49:00,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:49:00,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:49:00,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:49:00,752 INFO L87 Difference]: Start difference. First operand 68 states and 99 transitions. Second operand 3 states. [2019-01-12 14:49:00,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:49:00,888 INFO L93 Difference]: Finished difference Result 171 states and 254 transitions. [2019-01-12 14:49:00,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:49:00,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-01-12 14:49:00,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:49:00,890 INFO L225 Difference]: With dead ends: 171 [2019-01-12 14:49:00,891 INFO L226 Difference]: Without dead ends: 109 [2019-01-12 14:49:00,891 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:49:00,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-12 14:49:00,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2019-01-12 14:49:00,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-12 14:49:00,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 155 transitions. [2019-01-12 14:49:00,906 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 155 transitions. Word has length 23 [2019-01-12 14:49:00,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:49:00,907 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 155 transitions. [2019-01-12 14:49:00,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:49:00,907 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 155 transitions. [2019-01-12 14:49:00,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-12 14:49:00,908 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:49:00,908 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:49:00,909 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:49:00,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:49:00,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1852423790, now seen corresponding path program 1 times [2019-01-12 14:49:00,909 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:49:00,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:49:00,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:00,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:49:00,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:00,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:49:01,008 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:49:01,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:49:01,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:49:01,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:49:01,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:49:01,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:49:01,011 INFO L87 Difference]: Start difference. First operand 107 states and 155 transitions. Second operand 5 states. [2019-01-12 14:49:01,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:49:01,295 INFO L93 Difference]: Finished difference Result 399 states and 585 transitions. [2019-01-12 14:49:01,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 14:49:01,296 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-01-12 14:49:01,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:49:01,299 INFO L225 Difference]: With dead ends: 399 [2019-01-12 14:49:01,299 INFO L226 Difference]: Without dead ends: 298 [2019-01-12 14:49:01,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-12 14:49:01,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-01-12 14:49:01,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 194. [2019-01-12 14:49:01,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-01-12 14:49:01,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 272 transitions. [2019-01-12 14:49:01,329 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 272 transitions. Word has length 25 [2019-01-12 14:49:01,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:49:01,330 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 272 transitions. [2019-01-12 14:49:01,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:49:01,330 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 272 transitions. [2019-01-12 14:49:01,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-12 14:49:01,332 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:49:01,332 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:49:01,332 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:49:01,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:49:01,333 INFO L82 PathProgramCache]: Analyzing trace with hash 483234516, now seen corresponding path program 1 times [2019-01-12 14:49:01,333 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:49:01,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:49:01,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:01,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:49:01,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:01,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:49:01,441 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:49:01,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:49:01,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:49:01,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:49:01,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:49:01,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:49:01,446 INFO L87 Difference]: Start difference. First operand 194 states and 272 transitions. Second operand 5 states. [2019-01-12 14:49:02,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:49:02,216 INFO L93 Difference]: Finished difference Result 398 states and 570 transitions. [2019-01-12 14:49:02,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 14:49:02,217 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-01-12 14:49:02,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:49:02,220 INFO L225 Difference]: With dead ends: 398 [2019-01-12 14:49:02,221 INFO L226 Difference]: Without dead ends: 396 [2019-01-12 14:49:02,221 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-12 14:49:02,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2019-01-12 14:49:02,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 194. [2019-01-12 14:49:02,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-01-12 14:49:02,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 270 transitions. [2019-01-12 14:49:02,274 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 270 transitions. Word has length 26 [2019-01-12 14:49:02,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:49:02,275 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 270 transitions. [2019-01-12 14:49:02,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:49:02,275 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 270 transitions. [2019-01-12 14:49:02,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-12 14:49:02,279 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:49:02,279 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] [2019-01-12 14:49:02,279 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:49:02,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:49:02,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1957615203, now seen corresponding path program 1 times [2019-01-12 14:49:02,280 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:49:02,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:49:02,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:02,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:49:02,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:02,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:49:02,580 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:49:02,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:49:02,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:49:02,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:49:02,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:49:02,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:49:02,584 INFO L87 Difference]: Start difference. First operand 194 states and 270 transitions. Second operand 5 states. [2019-01-12 14:49:03,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:49:03,107 INFO L93 Difference]: Finished difference Result 542 states and 750 transitions. [2019-01-12 14:49:03,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 14:49:03,109 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-01-12 14:49:03,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:49:03,113 INFO L225 Difference]: With dead ends: 542 [2019-01-12 14:49:03,120 INFO L226 Difference]: Without dead ends: 354 [2019-01-12 14:49:03,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-12 14:49:03,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-01-12 14:49:03,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 206. [2019-01-12 14:49:03,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-01-12 14:49:03,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 282 transitions. [2019-01-12 14:49:03,169 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 282 transitions. Word has length 33 [2019-01-12 14:49:03,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:49:03,170 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 282 transitions. [2019-01-12 14:49:03,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:49:03,170 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 282 transitions. [2019-01-12 14:49:03,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-12 14:49:03,181 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:49:03,181 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] [2019-01-12 14:49:03,181 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:49:03,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:49:03,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1750546079, now seen corresponding path program 1 times [2019-01-12 14:49:03,182 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:49:03,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:49:03,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:03,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:49:03,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:03,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:49:03,315 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:49:03,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:49:03,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:49:03,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 14:49:03,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 14:49:03,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 14:49:03,317 INFO L87 Difference]: Start difference. First operand 206 states and 282 transitions. Second operand 4 states. [2019-01-12 14:49:03,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:49:03,494 INFO L93 Difference]: Finished difference Result 444 states and 607 transitions. [2019-01-12 14:49:03,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 14:49:03,494 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-01-12 14:49:03,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:49:03,496 INFO L225 Difference]: With dead ends: 444 [2019-01-12 14:49:03,496 INFO L226 Difference]: Without dead ends: 244 [2019-01-12 14:49:03,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:49:03,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2019-01-12 14:49:03,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 165. [2019-01-12 14:49:03,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-01-12 14:49:03,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 222 transitions. [2019-01-12 14:49:03,527 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 222 transitions. Word has length 33 [2019-01-12 14:49:03,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:49:03,527 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 222 transitions. [2019-01-12 14:49:03,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 14:49:03,528 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 222 transitions. [2019-01-12 14:49:03,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-12 14:49:03,529 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:49:03,529 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] [2019-01-12 14:49:03,529 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:49:03,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:49:03,530 INFO L82 PathProgramCache]: Analyzing trace with hash 470682401, now seen corresponding path program 1 times [2019-01-12 14:49:03,530 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:49:03,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:49:03,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:03,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:49:03,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:03,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:49:03,816 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:49:03,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:49:03,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:49:03,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:49:03,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:49:03,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:49:03,817 INFO L87 Difference]: Start difference. First operand 165 states and 222 transitions. Second operand 5 states. [2019-01-12 14:49:04,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:49:04,404 INFO L93 Difference]: Finished difference Result 613 states and 858 transitions. [2019-01-12 14:49:04,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 14:49:04,405 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-01-12 14:49:04,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:49:04,408 INFO L225 Difference]: With dead ends: 613 [2019-01-12 14:49:04,408 INFO L226 Difference]: Without dead ends: 502 [2019-01-12 14:49:04,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-12 14:49:04,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2019-01-12 14:49:04,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 242. [2019-01-12 14:49:04,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-01-12 14:49:04,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 323 transitions. [2019-01-12 14:49:04,463 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 323 transitions. Word has length 33 [2019-01-12 14:49:04,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:49:04,463 INFO L480 AbstractCegarLoop]: Abstraction has 242 states and 323 transitions. [2019-01-12 14:49:04,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:49:04,464 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 323 transitions. [2019-01-12 14:49:04,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-12 14:49:04,465 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:49:04,466 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:49:04,466 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:49:04,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:49:04,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1853071629, now seen corresponding path program 1 times [2019-01-12 14:49:04,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:49:04,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:49:04,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:04,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:49:04,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:04,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:49:04,753 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:49:04,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:49:04,753 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:49:04,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:49:04,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:49:04,903 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:49:05,014 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:49:05,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:49:05,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2019-01-12 14:49:05,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 14:49:05,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 14:49:05,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-01-12 14:49:05,046 INFO L87 Difference]: Start difference. First operand 242 states and 323 transitions. Second operand 8 states. [2019-01-12 14:49:05,887 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-12 14:49:06,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:49:06,902 INFO L93 Difference]: Finished difference Result 879 states and 1211 transitions. [2019-01-12 14:49:06,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-12 14:49:06,903 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 48 [2019-01-12 14:49:06,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:49:06,907 INFO L225 Difference]: With dead ends: 879 [2019-01-12 14:49:06,907 INFO L226 Difference]: Without dead ends: 691 [2019-01-12 14:49:06,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-01-12 14:49:06,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2019-01-12 14:49:06,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 327. [2019-01-12 14:49:06,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2019-01-12 14:49:06,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 441 transitions. [2019-01-12 14:49:06,964 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 441 transitions. Word has length 48 [2019-01-12 14:49:06,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:49:06,964 INFO L480 AbstractCegarLoop]: Abstraction has 327 states and 441 transitions. [2019-01-12 14:49:06,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 14:49:06,964 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 441 transitions. [2019-01-12 14:49:06,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-12 14:49:06,965 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:49:06,966 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-01-12 14:49:06,966 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:49:06,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:49:06,966 INFO L82 PathProgramCache]: Analyzing trace with hash 82160865, now seen corresponding path program 2 times [2019-01-12 14:49:06,967 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:49:06,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:49:06,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:06,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:49:06,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:07,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 14:49:07,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 14:49:07,643 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 14:49:07,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 02:49:07 BoogieIcfgContainer [2019-01-12 14:49:07,799 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 14:49:07,799 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 14:49:07,799 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 14:49:07,799 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 14:49:07,800 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:48:59" (3/4) ... [2019-01-12 14:49:07,804 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-12 14:49:07,973 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 14:49:07,973 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 14:49:07,975 INFO L168 Benchmark]: Toolchain (without parser) took 10643.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 208.1 MB). Free memory was 948.6 MB in the beginning and 915.2 MB in the end (delta: 33.4 MB). Peak memory consumption was 241.5 MB. Max. memory is 11.5 GB. [2019-01-12 14:49:07,975 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 14:49:07,977 INFO L168 Benchmark]: CACSL2BoogieTranslator took 645.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 948.6 MB in the beginning and 1.1 GB in the end (delta: -160.0 MB). Peak memory consumption was 30.8 MB. Max. memory is 11.5 GB. [2019-01-12 14:49:07,978 INFO L168 Benchmark]: Boogie Procedure Inliner took 116.65 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:49:07,978 INFO L168 Benchmark]: Boogie Preprocessor took 70.90 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:49:07,978 INFO L168 Benchmark]: RCFGBuilder took 1439.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 59.8 MB). Peak memory consumption was 59.8 MB. Max. memory is 11.5 GB. [2019-01-12 14:49:07,979 INFO L168 Benchmark]: TraceAbstraction took 8190.04 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 78.6 MB). Free memory was 1.0 GB in the beginning and 939.0 MB in the end (delta: 109.8 MB). Peak memory consumption was 188.5 MB. Max. memory is 11.5 GB. [2019-01-12 14:49:07,984 INFO L168 Benchmark]: Witness Printer took 174.53 ms. Allocated memory is still 1.2 GB. Free memory was 939.0 MB in the beginning and 915.2 MB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. [2019-01-12 14:49:07,986 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 645.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 948.6 MB in the beginning and 1.1 GB in the end (delta: -160.0 MB). Peak memory consumption was 30.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 116.65 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 70.90 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. * RCFGBuilder took 1439.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 59.8 MB). Peak memory consumption was 59.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8190.04 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 78.6 MB). Free memory was 1.0 GB in the beginning and 939.0 MB in the end (delta: 109.8 MB). Peak memory consumption was 188.5 MB. Max. memory is 11.5 GB. * Witness Printer took 174.53 ms. Allocated memory is still 1.2 GB. Free memory was 939.0 MB in the beginning and 915.2 MB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 752]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L238] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L555] int pumpRunning = 0; [L556] int systemActive = 1; [L757] int cleanupTimeShifts = 4; [L853] int waterLevel = 1; [L854] int methaneLevelCritical = 0; [L830] int retValue_acc ; [L831] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L464] int retValue_acc ; [L467] retValue_acc = 1 [L468] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L837] tmp = valid_product() [L839] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L480] int splverifierCounter ; [L481] int tmp ; [L482] int tmp___0 ; [L483] int tmp___1 ; [L484] int tmp___2 ; [L487] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L489] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L491] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L497] tmp = __VERIFIER_nondet_int() [L499] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L871] COND TRUE waterLevel < 2 [L872] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L507] tmp___0 = __VERIFIER_nondet_int() [L509] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L517] tmp___2 = __VERIFIER_nondet_int() [L519] COND TRUE \read(tmp___2) [L743] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L562] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L569] COND TRUE \read(systemActive) [L591] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L594] COND TRUE ! pumpRunning [L706] int retValue_acc ; [L707] int tmp ; [L708] int tmp___0 ; [L933] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L936] COND FALSE !(waterLevel < 2) [L940] retValue_acc = 0 [L941] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L712] tmp = isHighWaterSensorDry() [L714] COND FALSE !(\read(tmp)) [L717] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L719] retValue_acc = tmp___0 [L720] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L596] tmp = isHighWaterLevel() [L598] COND TRUE \read(tmp) [L625] int tmp ; [L650] int retValue_acc ; [L892] int retValue_acc ; [L895] retValue_acc = methaneLevelCritical [L896] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L654] retValue_acc = isMethaneLevelCritical() [L656] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L629] tmp = isMethaneAlarm() [L631] COND FALSE !(\read(tmp)) [L619] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L44] int tmp ; [L45] int tmp___0 ; [L924] int retValue_acc ; [L927] retValue_acc = waterLevel [L928] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L49] tmp = getWaterLevel() [L51] COND FALSE !(tmp == 0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L489] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L491] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L497] tmp = __VERIFIER_nondet_int() [L499] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L507] tmp___0 = __VERIFIER_nondet_int() [L509] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L517] tmp___2 = __VERIFIER_nondet_int() [L519] COND TRUE \read(tmp___2) [L743] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L562] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L859] COND TRUE waterLevel > 0 [L860] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L569] COND TRUE \read(systemActive) [L591] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L594] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L44] int tmp ; [L45] int tmp___0 ; [L924] int retValue_acc ; [L927] retValue_acc = waterLevel [L928] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L49] tmp = getWaterLevel() [L51] COND FALSE !(tmp == 0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L489] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L491] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L497] tmp = __VERIFIER_nondet_int() [L499] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L507] tmp___0 = __VERIFIER_nondet_int() [L509] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L517] tmp___2 = __VERIFIER_nondet_int() [L519] COND TRUE \read(tmp___2) [L743] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L562] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L859] COND TRUE waterLevel > 0 [L860] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L569] COND TRUE \read(systemActive) [L591] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L594] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L44] int tmp ; [L45] int tmp___0 ; [L924] int retValue_acc ; [L927] retValue_acc = waterLevel [L928] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L49] tmp = getWaterLevel() [L51] COND TRUE tmp == 0 [L661] int retValue_acc ; [L664] retValue_acc = pumpRunning [L665] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L53] tmp___0 = isPumpRunning() [L55] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L752] __VERIFIER_error() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 89 locations, 3 error locations. UNSAFE Result, 8.1s OverallTime, 11 OverallIterations, 3 TraceHistogramMax, 4.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 900 SDtfs, 1160 SDslu, 1447 SDs, 0 SdLazy, 201 SolverSat, 55 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 118 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=327occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 1163 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 387 NumberOfCodeBlocks, 387 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 313 ConstructedInterpolants, 0 QuantifiedInterpolants, 19227 SizeOfPredicates, 4 NumberOfNonLiveVariables, 394 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 11 InterpolantComputations, 9 PerfectInterpolantSequences, 22/28 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...