./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec2_product41_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_spec2_product41_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 fa3516ef35b9a868c2359cecbd34fc3153ca14ae .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:47:05,017 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 14:47:05,020 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 14:47:05,032 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 14:47:05,032 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 14:47:05,033 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 14:47:05,034 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 14:47:05,043 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 14:47:05,045 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 14:47:05,046 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 14:47:05,047 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 14:47:05,048 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 14:47:05,049 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 14:47:05,049 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 14:47:05,051 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 14:47:05,051 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 14:47:05,052 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 14:47:05,054 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 14:47:05,056 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 14:47:05,058 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 14:47:05,059 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 14:47:05,060 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 14:47:05,065 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 14:47:05,067 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 14:47:05,067 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 14:47:05,068 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 14:47:05,069 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 14:47:05,073 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 14:47:05,076 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 14:47:05,077 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 14:47:05,078 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 14:47:05,078 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 14:47:05,078 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 14:47:05,079 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 14:47:05,080 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 14:47:05,080 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 14:47:05,080 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:47:05,096 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 14:47:05,099 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 14:47:05,100 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 14:47:05,100 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 14:47:05,100 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 14:47:05,102 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 14:47:05,102 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 14:47:05,102 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 14:47:05,102 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 14:47:05,102 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 14:47:05,103 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 14:47:05,103 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 14:47:05,103 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 14:47:05,103 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 14:47:05,103 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 14:47:05,103 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 14:47:05,104 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 14:47:05,104 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 14:47:05,104 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 14:47:05,104 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 14:47:05,104 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 14:47:05,104 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 14:47:05,106 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 14:47:05,106 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 14:47:05,106 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 14:47:05,106 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 14:47:05,106 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 14:47:05,106 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 14:47:05,107 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 -> fa3516ef35b9a868c2359cecbd34fc3153ca14ae [2019-01-12 14:47:05,145 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 14:47:05,165 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 14:47:05,172 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 14:47:05,174 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 14:47:05,174 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 14:47:05,176 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec2_product41_false-unreach-call_false-termination.cil.c [2019-01-12 14:47:05,234 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7ff124ad/6154e1677e3d4bf8bb55247b1e4f9b88/FLAGab9af29b2 [2019-01-12 14:47:05,690 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 14:47:05,691 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec2_product41_false-unreach-call_false-termination.cil.c [2019-01-12 14:47:05,702 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7ff124ad/6154e1677e3d4bf8bb55247b1e4f9b88/FLAGab9af29b2 [2019-01-12 14:47:06,011 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7ff124ad/6154e1677e3d4bf8bb55247b1e4f9b88 [2019-01-12 14:47:06,015 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 14:47:06,017 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 14:47:06,018 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 14:47:06,018 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 14:47:06,022 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 14:47:06,023 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:47:06" (1/1) ... [2019-01-12 14:47:06,026 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5329403d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:47:06, skipping insertion in model container [2019-01-12 14:47:06,026 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:47:06" (1/1) ... [2019-01-12 14:47:06,034 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 14:47:06,105 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 14:47:06,536 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:47:06,558 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 14:47:06,714 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:47:06,758 INFO L195 MainTranslator]: Completed translation [2019-01-12 14:47:06,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:47:06 WrapperNode [2019-01-12 14:47:06,759 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 14:47:06,759 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 14:47:06,760 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 14:47:06,760 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 14:47:06,769 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:47:06" (1/1) ... [2019-01-12 14:47:06,810 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:47:06" (1/1) ... [2019-01-12 14:47:06,889 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 14:47:06,890 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 14:47:06,890 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 14:47:06,890 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 14:47:06,905 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:47:06" (1/1) ... [2019-01-12 14:47:06,905 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:47:06" (1/1) ... [2019-01-12 14:47:06,917 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:47:06" (1/1) ... [2019-01-12 14:47:06,921 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:47:06" (1/1) ... [2019-01-12 14:47:06,941 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:47:06" (1/1) ... [2019-01-12 14:47:06,962 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:47:06" (1/1) ... [2019-01-12 14:47:06,968 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:47:06" (1/1) ... [2019-01-12 14:47:06,973 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 14:47:06,974 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 14:47:06,974 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 14:47:06,974 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 14:47:06,975 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:47:06" (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:47:07,067 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 14:47:07,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-12 14:47:07,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 14:47:07,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 14:47:08,229 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 14:47:08,230 INFO L286 CfgBuilder]: Removed 116 assue(true) statements. [2019-01-12 14:47:08,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:47:08 BoogieIcfgContainer [2019-01-12 14:47:08,232 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 14:47:08,233 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 14:47:08,233 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 14:47:08,236 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 14:47:08,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 02:47:06" (1/3) ... [2019-01-12 14:47:08,238 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a042027 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:47:08, skipping insertion in model container [2019-01-12 14:47:08,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:47:06" (2/3) ... [2019-01-12 14:47:08,239 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a042027 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:47:08, skipping insertion in model container [2019-01-12 14:47:08,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:47:08" (3/3) ... [2019-01-12 14:47:08,242 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec2_product41_false-unreach-call_false-termination.cil.c [2019-01-12 14:47:08,252 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 14:47:08,261 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-12 14:47:08,279 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-12 14:47:08,311 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 14:47:08,312 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 14:47:08,312 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 14:47:08,312 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 14:47:08,313 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 14:47:08,313 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 14:47:08,313 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 14:47:08,313 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 14:47:08,313 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 14:47:08,330 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states. [2019-01-12 14:47:08,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-12 14:47:08,337 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:47:08,338 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:47:08,340 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:47:08,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:47:08,346 INFO L82 PathProgramCache]: Analyzing trace with hash -466361678, now seen corresponding path program 1 times [2019-01-12 14:47:08,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:47:08,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:47:08,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:08,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:47:08,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:08,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:47:08,607 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:47:08,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:47:08,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:47:08,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 14:47:08,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 14:47:08,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 14:47:08,633 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 2 states. [2019-01-12 14:47:08,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:47:08,660 INFO L93 Difference]: Finished difference Result 175 states and 264 transitions. [2019-01-12 14:47:08,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 14:47:08,661 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2019-01-12 14:47:08,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:47:08,674 INFO L225 Difference]: With dead ends: 175 [2019-01-12 14:47:08,675 INFO L226 Difference]: Without dead ends: 87 [2019-01-12 14:47:08,678 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:47:08,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-01-12 14:47:08,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-01-12 14:47:08,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-01-12 14:47:08,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 124 transitions. [2019-01-12 14:47:08,718 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 124 transitions. Word has length 18 [2019-01-12 14:47:08,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:47:08,718 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 124 transitions. [2019-01-12 14:47:08,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 14:47:08,718 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 124 transitions. [2019-01-12 14:47:08,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-12 14:47:08,720 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:47:08,720 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:47:08,720 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:47:08,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:47:08,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1078824867, now seen corresponding path program 1 times [2019-01-12 14:47:08,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:47:08,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:47:08,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:08,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:47:08,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:08,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:47:08,912 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:47:08,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:47:08,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 14:47:08,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:47:08,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:47:08,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:47:08,918 INFO L87 Difference]: Start difference. First operand 87 states and 124 transitions. Second operand 3 states. [2019-01-12 14:47:08,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:47:08,941 INFO L93 Difference]: Finished difference Result 87 states and 124 transitions. [2019-01-12 14:47:08,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:47:08,942 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-01-12 14:47:08,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:47:08,944 INFO L225 Difference]: With dead ends: 87 [2019-01-12 14:47:08,944 INFO L226 Difference]: Without dead ends: 39 [2019-01-12 14:47:08,945 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:47:08,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-12 14:47:08,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-01-12 14:47:08,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-12 14:47:08,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 55 transitions. [2019-01-12 14:47:08,953 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 55 transitions. Word has length 19 [2019-01-12 14:47:08,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:47:08,953 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 55 transitions. [2019-01-12 14:47:08,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:47:08,953 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 55 transitions. [2019-01-12 14:47:08,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-12 14:47:08,955 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:47:08,955 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] [2019-01-12 14:47:08,956 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:47:08,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:47:08,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1959799754, now seen corresponding path program 1 times [2019-01-12 14:47:08,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:47:08,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:47:08,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:08,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:47:08,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:08,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:47:09,121 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:47:09,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:47:09,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:47:09,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 14:47:09,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 14:47:09,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-12 14:47:09,123 INFO L87 Difference]: Start difference. First operand 39 states and 55 transitions. Second operand 6 states. [2019-01-12 14:47:09,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:47:09,307 INFO L93 Difference]: Finished difference Result 71 states and 103 transitions. [2019-01-12 14:47:09,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 14:47:09,309 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-01-12 14:47:09,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:47:09,310 INFO L225 Difference]: With dead ends: 71 [2019-01-12 14:47:09,310 INFO L226 Difference]: Without dead ends: 39 [2019-01-12 14:47:09,311 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-12 14:47:09,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-12 14:47:09,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-01-12 14:47:09,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-12 14:47:09,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 54 transitions. [2019-01-12 14:47:09,319 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 54 transitions. Word has length 24 [2019-01-12 14:47:09,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:47:09,320 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 54 transitions. [2019-01-12 14:47:09,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 14:47:09,320 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2019-01-12 14:47:09,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-12 14:47:09,321 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:47:09,321 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:47:09,321 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:47:09,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:47:09,323 INFO L82 PathProgramCache]: Analyzing trace with hash -2070782503, now seen corresponding path program 1 times [2019-01-12 14:47:09,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:47:09,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:47:09,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:09,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:47:09,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:09,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:47:09,423 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:47:09,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:47:09,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:47:09,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:47:09,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:47:09,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:47:09,424 INFO L87 Difference]: Start difference. First operand 39 states and 54 transitions. Second operand 3 states. [2019-01-12 14:47:09,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:47:09,544 INFO L93 Difference]: Finished difference Result 93 states and 133 transitions. [2019-01-12 14:47:09,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:47:09,544 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-01-12 14:47:09,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:47:09,545 INFO L225 Difference]: With dead ends: 93 [2019-01-12 14:47:09,546 INFO L226 Difference]: Without dead ends: 61 [2019-01-12 14:47:09,546 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:47:09,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-12 14:47:09,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2019-01-12 14:47:09,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-12 14:47:09,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 83 transitions. [2019-01-12 14:47:09,555 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 83 transitions. Word has length 25 [2019-01-12 14:47:09,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:47:09,556 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 83 transitions. [2019-01-12 14:47:09,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:47:09,556 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 83 transitions. [2019-01-12 14:47:09,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-12 14:47:09,557 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:47:09,557 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] [2019-01-12 14:47:09,558 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:47:09,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:47:09,558 INFO L82 PathProgramCache]: Analyzing trace with hash -576163675, now seen corresponding path program 1 times [2019-01-12 14:47:09,558 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:47:09,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:47:09,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:09,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:47:09,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:09,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:47:09,792 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:47:09,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:47:09,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:47:09,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:47:09,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:47:09,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:47:09,794 INFO L87 Difference]: Start difference. First operand 59 states and 83 transitions. Second operand 5 states. [2019-01-12 14:47:10,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:47:10,107 INFO L93 Difference]: Finished difference Result 271 states and 394 transitions. [2019-01-12 14:47:10,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 14:47:10,108 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-01-12 14:47:10,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:47:10,111 INFO L225 Difference]: With dead ends: 271 [2019-01-12 14:47:10,114 INFO L226 Difference]: Without dead ends: 219 [2019-01-12 14:47:10,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 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:47:10,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-01-12 14:47:10,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 103. [2019-01-12 14:47:10,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-12 14:47:10,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 144 transitions. [2019-01-12 14:47:10,157 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 144 transitions. Word has length 31 [2019-01-12 14:47:10,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:47:10,160 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 144 transitions. [2019-01-12 14:47:10,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:47:10,161 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 144 transitions. [2019-01-12 14:47:10,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-12 14:47:10,162 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:47:10,162 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:47:10,163 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:47:10,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:47:10,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1086399261, now seen corresponding path program 1 times [2019-01-12 14:47:10,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:47:10,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:47:10,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:10,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:47:10,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:10,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:47:10,496 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:47:10,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:47:10,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:47:10,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:47:10,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:47:10,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:47:10,498 INFO L87 Difference]: Start difference. First operand 103 states and 144 transitions. Second operand 5 states. [2019-01-12 14:47:11,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:47:11,171 INFO L93 Difference]: Finished difference Result 376 states and 533 transitions. [2019-01-12 14:47:11,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 14:47:11,172 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-01-12 14:47:11,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:47:11,174 INFO L225 Difference]: With dead ends: 376 [2019-01-12 14:47:11,174 INFO L226 Difference]: Without dead ends: 280 [2019-01-12 14:47:11,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 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:47:11,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-01-12 14:47:11,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 102. [2019-01-12 14:47:11,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-01-12 14:47:11,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 141 transitions. [2019-01-12 14:47:11,203 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 141 transitions. Word has length 32 [2019-01-12 14:47:11,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:47:11,203 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 141 transitions. [2019-01-12 14:47:11,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:47:11,204 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 141 transitions. [2019-01-12 14:47:11,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-12 14:47:11,206 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:47:11,206 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:47:11,207 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:47:11,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:47:11,208 INFO L82 PathProgramCache]: Analyzing trace with hash 477559900, now seen corresponding path program 1 times [2019-01-12 14:47:11,208 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:47:11,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:47:11,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:11,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:47:11,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:11,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:47:11,482 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:47:11,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:47:11,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:47:11,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:47:11,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:47:11,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:47:11,491 INFO L87 Difference]: Start difference. First operand 102 states and 141 transitions. Second operand 5 states. [2019-01-12 14:47:11,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:47:11,966 INFO L93 Difference]: Finished difference Result 273 states and 377 transitions. [2019-01-12 14:47:11,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 14:47:11,967 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-01-12 14:47:11,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:47:11,969 INFO L225 Difference]: With dead ends: 273 [2019-01-12 14:47:11,970 INFO L226 Difference]: Without dead ends: 178 [2019-01-12 14:47:11,971 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:47:11,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-01-12 14:47:12,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 108. [2019-01-12 14:47:12,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-12 14:47:12,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 147 transitions. [2019-01-12 14:47:12,006 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 147 transitions. Word has length 35 [2019-01-12 14:47:12,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:47:12,006 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 147 transitions. [2019-01-12 14:47:12,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:47:12,006 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 147 transitions. [2019-01-12 14:47:12,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-12 14:47:12,012 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:47:12,012 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:47:12,013 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:47:12,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:47:12,013 INFO L82 PathProgramCache]: Analyzing trace with hash -533557350, now seen corresponding path program 1 times [2019-01-12 14:47:12,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:47:12,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:47:12,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:12,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:47:12,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:12,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:47:12,172 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:47:12,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:47:12,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 14:47:12,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 14:47:12,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 14:47:12,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 14:47:12,174 INFO L87 Difference]: Start difference. First operand 108 states and 147 transitions. Second operand 6 states. [2019-01-12 14:47:12,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:47:12,415 INFO L93 Difference]: Finished difference Result 291 states and 395 transitions. [2019-01-12 14:47:12,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 14:47:12,417 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2019-01-12 14:47:12,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:47:12,419 INFO L225 Difference]: With dead ends: 291 [2019-01-12 14:47:12,419 INFO L226 Difference]: Without dead ends: 190 [2019-01-12 14:47:12,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-01-12 14:47:12,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-01-12 14:47:12,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 112. [2019-01-12 14:47:12,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-01-12 14:47:12,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 151 transitions. [2019-01-12 14:47:12,442 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 151 transitions. Word has length 35 [2019-01-12 14:47:12,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:47:12,443 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 151 transitions. [2019-01-12 14:47:12,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 14:47:12,443 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 151 transitions. [2019-01-12 14:47:12,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-12 14:47:12,446 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:47:12,446 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:47:12,446 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:47:12,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:47:12,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1554625704, now seen corresponding path program 1 times [2019-01-12 14:47:12,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:47:12,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:47:12,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:12,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:47:12,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:12,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:47:12,547 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:47:12,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:47:12,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:47:12,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:47:12,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:47:12,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:47:12,549 INFO L87 Difference]: Start difference. First operand 112 states and 151 transitions. Second operand 3 states. [2019-01-12 14:47:12,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:47:12,698 INFO L93 Difference]: Finished difference Result 265 states and 357 transitions. [2019-01-12 14:47:12,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:47:12,699 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-01-12 14:47:12,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:47:12,701 INFO L225 Difference]: With dead ends: 265 [2019-01-12 14:47:12,701 INFO L226 Difference]: Without dead ends: 160 [2019-01-12 14:47:12,701 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:47:12,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-01-12 14:47:12,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2019-01-12 14:47:12,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-01-12 14:47:12,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 209 transitions. [2019-01-12 14:47:12,726 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 209 transitions. Word has length 35 [2019-01-12 14:47:12,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:47:12,728 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 209 transitions. [2019-01-12 14:47:12,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:47:12,728 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 209 transitions. [2019-01-12 14:47:12,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-12 14:47:12,729 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:47:12,730 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:47:12,730 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:47:12,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:47:12,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1879284200, now seen corresponding path program 1 times [2019-01-12 14:47:12,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:47:12,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:47:12,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:12,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:47:12,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:12,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:47:12,843 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:47:12,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:47:12,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 14:47:12,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 14:47:12,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 14:47:12,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 14:47:12,845 INFO L87 Difference]: Start difference. First operand 160 states and 209 transitions. Second operand 6 states. [2019-01-12 14:47:14,223 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-12 14:47:14,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:47:14,232 INFO L93 Difference]: Finished difference Result 485 states and 635 transitions. [2019-01-12 14:47:14,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 14:47:14,232 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2019-01-12 14:47:14,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:47:14,235 INFO L225 Difference]: With dead ends: 485 [2019-01-12 14:47:14,236 INFO L226 Difference]: Without dead ends: 332 [2019-01-12 14:47:14,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-01-12 14:47:14,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-01-12 14:47:14,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 160. [2019-01-12 14:47:14,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-01-12 14:47:14,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 205 transitions. [2019-01-12 14:47:14,268 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 205 transitions. Word has length 36 [2019-01-12 14:47:14,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:47:14,269 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 205 transitions. [2019-01-12 14:47:14,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 14:47:14,269 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 205 transitions. [2019-01-12 14:47:14,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-12 14:47:14,271 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:47:14,271 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:47:14,271 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:47:14,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:47:14,272 INFO L82 PathProgramCache]: Analyzing trace with hash 749013372, now seen corresponding path program 1 times [2019-01-12 14:47:14,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:47:14,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:47:14,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:14,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:47:14,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:14,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:47:14,398 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:47:14,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:47:14,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 14:47:14,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:47:14,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:47:14,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:47:14,400 INFO L87 Difference]: Start difference. First operand 160 states and 205 transitions. Second operand 3 states. [2019-01-12 14:47:14,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:47:14,539 INFO L93 Difference]: Finished difference Result 233 states and 301 transitions. [2019-01-12 14:47:14,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:47:14,540 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-01-12 14:47:14,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:47:14,543 INFO L225 Difference]: With dead ends: 233 [2019-01-12 14:47:14,543 INFO L226 Difference]: Without dead ends: 231 [2019-01-12 14:47:14,544 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:47:14,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2019-01-12 14:47:14,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 180. [2019-01-12 14:47:14,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-01-12 14:47:14,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 235 transitions. [2019-01-12 14:47:14,586 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 235 transitions. Word has length 51 [2019-01-12 14:47:14,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:47:14,586 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 235 transitions. [2019-01-12 14:47:14,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:47:14,589 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 235 transitions. [2019-01-12 14:47:14,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-12 14:47:14,591 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:47:14,591 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-01-12 14:47:14,592 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:47:14,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:47:14,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1849817445, now seen corresponding path program 1 times [2019-01-12 14:47:14,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:47:14,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:47:14,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:14,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:47:14,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:15,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 14:47:15,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 14:47:15,596 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 14:47:15,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 02:47:15 BoogieIcfgContainer [2019-01-12 14:47:15,761 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 14:47:15,762 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 14:47:15,763 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 14:47:15,763 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 14:47:15,764 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:47:08" (3/4) ... [2019-01-12 14:47:15,768 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-12 14:47:16,053 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 14:47:16,054 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 14:47:16,055 INFO L168 Benchmark]: Toolchain (without parser) took 10039.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 205.0 MB). Free memory was 952.7 MB in the beginning and 903.5 MB in the end (delta: 49.2 MB). Peak memory consumption was 254.2 MB. Max. memory is 11.5 GB. [2019-01-12 14:47:16,058 INFO L168 Benchmark]: CDTParser took 0.19 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:47:16,058 INFO L168 Benchmark]: CACSL2BoogieTranslator took 741.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -161.2 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. [2019-01-12 14:47:16,058 INFO L168 Benchmark]: Boogie Procedure Inliner took 129.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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-12 14:47:16,059 INFO L168 Benchmark]: Boogie Preprocessor took 84.00 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:47:16,059 INFO L168 Benchmark]: RCFGBuilder took 1257.88 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: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 11.5 GB. [2019-01-12 14:47:16,060 INFO L168 Benchmark]: TraceAbstraction took 7528.64 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 71.3 MB). Free memory was 1.1 GB in the beginning and 935.0 MB in the end (delta: 119.4 MB). Peak memory consumption was 190.7 MB. Max. memory is 11.5 GB. [2019-01-12 14:47:16,063 INFO L168 Benchmark]: Witness Printer took 291.19 ms. Allocated memory is still 1.2 GB. Free memory was 935.0 MB in the beginning and 903.5 MB in the end (delta: 31.6 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. [2019-01-12 14:47:16,066 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.19 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 741.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -161.2 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 129.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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 84.00 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 1257.88 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: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7528.64 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 71.3 MB). Free memory was 1.1 GB in the beginning and 935.0 MB in the end (delta: 119.4 MB). Peak memory consumption was 190.7 MB. Max. memory is 11.5 GB. * Witness Printer took 291.19 ms. Allocated memory is still 1.2 GB. Free memory was 935.0 MB in the beginning and 903.5 MB in the end (delta: 31.6 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 830]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L43] int methAndRunningLastTime ; [L251] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L455] int pumpRunning = 0; [L456] int systemActive = 1; [L628] int waterLevel = 1; [L629] int methaneLevelCritical = 0; [L835] int cleanupTimeShifts = 4; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L909] int retValue_acc ; [L910] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L817] int retValue_acc ; [L820] retValue_acc = 1 [L821] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L916] tmp = valid_product() [L918] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L48] methAndRunningLastTime = 0 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L724] int splverifierCounter ; [L725] int tmp ; [L726] int tmp___0 ; [L727] int tmp___1 ; [L728] int tmp___2 ; [L731] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L733] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L735] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L741] tmp = __VERIFIER_nondet_int() [L743] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L646] COND TRUE waterLevel < 2 [L647] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L751] tmp___0 = __VERIFIER_nondet_int() [L753] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L761] tmp___2 = __VERIFIER_nondet_int() [L763] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L462] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L469] COND TRUE \read(systemActive) [L491] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L494] COND TRUE ! pumpRunning [L606] int retValue_acc ; [L607] int tmp ; [L608] int tmp___0 ; [L708] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L711] COND FALSE !(waterLevel < 2) [L715] retValue_acc = 0 [L716] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L612] tmp = isHighWaterSensorDry() [L614] COND FALSE !(\read(tmp)) [L617] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L619] retValue_acc = tmp___0 [L620] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L496] tmp = isHighWaterLevel() [L498] COND TRUE \read(tmp) [L525] int tmp ; [L550] int retValue_acc ; [L667] int retValue_acc ; [L670] retValue_acc = methaneLevelCritical [L671] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L554] retValue_acc = isMethaneLevelCritical() [L556] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L529] tmp = isMethaneAlarm() [L531] COND FALSE !(\read(tmp)) [L519] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L53] int tmp ; [L54] int tmp___0 ; [L667] int retValue_acc ; [L670] retValue_acc = methaneLevelCritical [L671] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L58] tmp = isMethaneLevelCritical() [L60] COND FALSE !(\read(tmp)) [L76] methAndRunningLastTime = 0 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L733] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L735] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L741] tmp = __VERIFIER_nondet_int() [L743] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L751] tmp___0 = __VERIFIER_nondet_int() [L753] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L658] COND FALSE !(\read(methaneLevelCritical)) [L661] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L761] tmp___2 = __VERIFIER_nondet_int() [L763] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L462] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L634] COND TRUE waterLevel > 0 [L635] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L469] COND TRUE \read(systemActive) [L491] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L494] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L53] int tmp ; [L54] int tmp___0 ; [L667] int retValue_acc ; [L670] retValue_acc = methaneLevelCritical [L671] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L58] tmp = isMethaneLevelCritical() [L60] COND TRUE \read(tmp) [L561] int retValue_acc ; [L564] retValue_acc = pumpRunning [L565] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L62] tmp___0 = isPumpRunning() [L64] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L65] COND FALSE !(\read(methAndRunningLastTime)) [L70] methAndRunningLastTime = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L733] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L735] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L741] tmp = __VERIFIER_nondet_int() [L743] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L751] tmp___0 = __VERIFIER_nondet_int() [L753] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L761] tmp___2 = __VERIFIER_nondet_int() [L763] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L462] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L634] COND TRUE waterLevel > 0 [L635] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L469] COND TRUE \read(systemActive) [L491] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L494] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L53] int tmp ; [L54] int tmp___0 ; [L667] int retValue_acc ; [L670] retValue_acc = methaneLevelCritical [L671] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L58] tmp = isMethaneLevelCritical() [L60] COND TRUE \read(tmp) [L561] int retValue_acc ; [L564] retValue_acc = pumpRunning [L565] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L62] tmp___0 = isPumpRunning() [L64] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L65] COND TRUE \read(methAndRunningLastTime) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L830] __VERIFIER_error() VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 91 locations, 3 error locations. UNSAFE Result, 7.4s OverallTime, 12 OverallIterations, 3 TraceHistogramMax, 3.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 833 SDtfs, 1218 SDslu, 1300 SDs, 0 SdLazy, 182 SolverSat, 29 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=180occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 667 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 410 NumberOfCodeBlocks, 410 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 330 ConstructedInterpolants, 0 QuantifiedInterpolants, 20746 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 14/14 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...