./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec4_product45_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_product45_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 a9369a06c8d4df60e49baaf177cf32aba3e52d93 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:57,333 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 14:48:57,335 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 14:48:57,347 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 14:48:57,347 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 14:48:57,348 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 14:48:57,350 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 14:48:57,354 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 14:48:57,357 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 14:48:57,358 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 14:48:57,359 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 14:48:57,359 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 14:48:57,360 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 14:48:57,361 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 14:48:57,362 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 14:48:57,363 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 14:48:57,364 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 14:48:57,366 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 14:48:57,368 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 14:48:57,370 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 14:48:57,371 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 14:48:57,372 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 14:48:57,375 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 14:48:57,376 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 14:48:57,376 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 14:48:57,377 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 14:48:57,378 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 14:48:57,379 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 14:48:57,380 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 14:48:57,381 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 14:48:57,381 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 14:48:57,382 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 14:48:57,382 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 14:48:57,383 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 14:48:57,384 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 14:48:57,385 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 14:48:57,385 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:57,413 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 14:48:57,413 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 14:48:57,416 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 14:48:57,417 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 14:48:57,417 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 14:48:57,418 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 14:48:57,418 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 14:48:57,418 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 14:48:57,419 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 14:48:57,419 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 14:48:57,419 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 14:48:57,419 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 14:48:57,419 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 14:48:57,419 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 14:48:57,420 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 14:48:57,422 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 14:48:57,422 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 14:48:57,422 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 14:48:57,422 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 14:48:57,422 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 14:48:57,423 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 14:48:57,425 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 14:48:57,425 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 14:48:57,425 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 14:48:57,425 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 14:48:57,425 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 14:48:57,426 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 14:48:57,426 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 14:48:57,427 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 -> a9369a06c8d4df60e49baaf177cf32aba3e52d93 [2019-01-12 14:48:57,469 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 14:48:57,484 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 14:48:57,490 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 14:48:57,492 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 14:48:57,492 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 14:48:57,493 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec4_product45_false-unreach-call_false-termination.cil.c [2019-01-12 14:48:57,558 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06165efba/5fbabd826ac3464fa499a3a836b9736f/FLAGc875c5499 [2019-01-12 14:48:58,048 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 14:48:58,049 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec4_product45_false-unreach-call_false-termination.cil.c [2019-01-12 14:48:58,072 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06165efba/5fbabd826ac3464fa499a3a836b9736f/FLAGc875c5499 [2019-01-12 14:48:58,345 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06165efba/5fbabd826ac3464fa499a3a836b9736f [2019-01-12 14:48:58,349 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 14:48:58,351 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 14:48:58,352 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 14:48:58,352 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 14:48:58,355 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 14:48:58,356 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:48:58" (1/1) ... [2019-01-12 14:48:58,359 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@672937de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:48:58, skipping insertion in model container [2019-01-12 14:48:58,359 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:48:58" (1/1) ... [2019-01-12 14:48:58,368 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 14:48:58,432 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 14:48:58,866 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:48:58,891 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 14:48:59,065 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:48:59,102 INFO L195 MainTranslator]: Completed translation [2019-01-12 14:48:59,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:48:59 WrapperNode [2019-01-12 14:48:59,103 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 14:48:59,104 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 14:48:59,105 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 14:48:59,105 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 14:48:59,112 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:59" (1/1) ... [2019-01-12 14:48:59,131 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:59" (1/1) ... [2019-01-12 14:48:59,195 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 14:48:59,199 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 14:48:59,199 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 14:48:59,199 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 14:48:59,213 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:59" (1/1) ... [2019-01-12 14:48:59,213 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:59" (1/1) ... [2019-01-12 14:48:59,220 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:59" (1/1) ... [2019-01-12 14:48:59,220 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:59" (1/1) ... [2019-01-12 14:48:59,238 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:59" (1/1) ... [2019-01-12 14:48:59,248 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:59" (1/1) ... [2019-01-12 14:48:59,252 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:59" (1/1) ... [2019-01-12 14:48:59,257 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 14:48:59,258 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 14:48:59,258 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 14:48:59,258 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 14:48:59,259 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:48:59" (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:59,333 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 14:48:59,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-12 14:48:59,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 14:48:59,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 14:49:00,952 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 14:49:00,953 INFO L286 CfgBuilder]: Removed 192 assue(true) statements. [2019-01-12 14:49:00,954 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:49:00 BoogieIcfgContainer [2019-01-12 14:49:00,954 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 14:49:00,956 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 14:49:00,956 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 14:49:00,960 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 14:49:00,960 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 02:48:58" (1/3) ... [2019-01-12 14:49:00,961 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fbbfa1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:49:00, skipping insertion in model container [2019-01-12 14:49:00,961 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:48:59" (2/3) ... [2019-01-12 14:49:00,962 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fbbfa1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:49:00, skipping insertion in model container [2019-01-12 14:49:00,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:49:00" (3/3) ... [2019-01-12 14:49:00,965 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec4_product45_false-unreach-call_false-termination.cil.c [2019-01-12 14:49:00,974 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 14:49:00,981 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-12 14:49:00,998 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-12 14:49:01,032 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 14:49:01,033 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 14:49:01,033 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 14:49:01,033 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 14:49:01,034 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 14:49:01,034 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 14:49:01,034 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 14:49:01,034 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 14:49:01,034 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 14:49:01,053 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states. [2019-01-12 14:49:01,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-12 14:49:01,059 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:49:01,060 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:49:01,062 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:49:01,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:49:01,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1880189342, now seen corresponding path program 1 times [2019-01-12 14:49:01,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:49:01,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:49:01,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:01,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:49:01,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:01,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:49:01,336 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,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:49:01,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:49:01,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 14:49:01,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 14:49:01,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 14:49:01,355 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 2 states. [2019-01-12 14:49:01,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:49:01,386 INFO L93 Difference]: Finished difference Result 252 states and 377 transitions. [2019-01-12 14:49:01,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 14:49:01,388 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-01-12 14:49:01,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:49:01,402 INFO L225 Difference]: With dead ends: 252 [2019-01-12 14:49:01,402 INFO L226 Difference]: Without dead ends: 125 [2019-01-12 14:49:01,406 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:01,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-01-12 14:49:01,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2019-01-12 14:49:01,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-01-12 14:49:01,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 180 transitions. [2019-01-12 14:49:01,467 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 180 transitions. Word has length 16 [2019-01-12 14:49:01,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:49:01,467 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 180 transitions. [2019-01-12 14:49:01,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 14:49:01,469 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 180 transitions. [2019-01-12 14:49:01,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-12 14:49:01,470 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:49:01,470 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:01,471 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:49:01,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:49:01,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1368021057, now seen corresponding path program 1 times [2019-01-12 14:49:01,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:49:01,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:49:01,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:01,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:49:01,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:01,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:49:01,655 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,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:49:01,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 14:49:01,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:49:01,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:49:01,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:49:01,658 INFO L87 Difference]: Start difference. First operand 125 states and 180 transitions. Second operand 3 states. [2019-01-12 14:49:01,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:49:01,688 INFO L93 Difference]: Finished difference Result 125 states and 180 transitions. [2019-01-12 14:49:01,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:49:01,692 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-01-12 14:49:01,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:49:01,693 INFO L225 Difference]: With dead ends: 125 [2019-01-12 14:49:01,693 INFO L226 Difference]: Without dead ends: 51 [2019-01-12 14:49:01,694 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:01,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-12 14:49:01,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-01-12 14:49:01,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-12 14:49:01,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 73 transitions. [2019-01-12 14:49:01,709 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 73 transitions. Word has length 17 [2019-01-12 14:49:01,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:49:01,709 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 73 transitions. [2019-01-12 14:49:01,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:49:01,709 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 73 transitions. [2019-01-12 14:49:01,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-12 14:49:01,713 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:49:01,714 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:01,714 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:49:01,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:49:01,714 INFO L82 PathProgramCache]: Analyzing trace with hash -2019078694, now seen corresponding path program 1 times [2019-01-12 14:49:01,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:49:01,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:49:01,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:01,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:49:01,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:01,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:49:01,893 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,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:49:01,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:49:01,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 14:49:01,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 14:49:01,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-12 14:49:01,895 INFO L87 Difference]: Start difference. First operand 51 states and 73 transitions. Second operand 6 states. [2019-01-12 14:49:02,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:49:02,047 INFO L93 Difference]: Finished difference Result 96 states and 140 transitions. [2019-01-12 14:49:02,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 14:49:02,053 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-01-12 14:49:02,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:49:02,055 INFO L225 Difference]: With dead ends: 96 [2019-01-12 14:49:02,055 INFO L226 Difference]: Without dead ends: 51 [2019-01-12 14:49:02,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-12 14:49:02,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-12 14:49:02,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-01-12 14:49:02,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-12 14:49:02,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 72 transitions. [2019-01-12 14:49:02,063 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 72 transitions. Word has length 22 [2019-01-12 14:49:02,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:49:02,063 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 72 transitions. [2019-01-12 14:49:02,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 14:49:02,064 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 72 transitions. [2019-01-12 14:49:02,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-12 14:49:02,065 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:49:02,065 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:49:02,065 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:49:02,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:49:02,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1511639432, now seen corresponding path program 1 times [2019-01-12 14:49:02,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:49:02,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:49:02,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:02,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:49:02,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:02,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:49:02,186 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,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:49:02,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:49:02,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:49:02,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:49:02,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:49:02,189 INFO L87 Difference]: Start difference. First operand 51 states and 72 transitions. Second operand 3 states. [2019-01-12 14:49:02,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:49:02,372 INFO L93 Difference]: Finished difference Result 117 states and 168 transitions. [2019-01-12 14:49:02,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:49:02,373 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-01-12 14:49:02,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:49:02,374 INFO L225 Difference]: With dead ends: 117 [2019-01-12 14:49:02,375 INFO L226 Difference]: Without dead ends: 72 [2019-01-12 14:49:02,376 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:02,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-01-12 14:49:02,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2019-01-12 14:49:02,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-01-12 14:49:02,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 98 transitions. [2019-01-12 14:49:02,389 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 98 transitions. Word has length 24 [2019-01-12 14:49:02,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:49:02,392 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 98 transitions. [2019-01-12 14:49:02,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:49:02,392 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 98 transitions. [2019-01-12 14:49:02,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-12 14:49:02,394 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:49:02,395 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] [2019-01-12 14:49:02,395 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:49:02,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:49:02,397 INFO L82 PathProgramCache]: Analyzing trace with hash 406595852, now seen corresponding path program 1 times [2019-01-12 14:49:02,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:49:02,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:49:02,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:02,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:49:02,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:02,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:49:02,622 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,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:49:02,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 14:49:02,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 14:49:02,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 14:49:02,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-12 14:49:02,624 INFO L87 Difference]: Start difference. First operand 70 states and 98 transitions. Second operand 8 states. [2019-01-12 14:49:03,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:49:03,985 INFO L93 Difference]: Finished difference Result 447 states and 648 transitions. [2019-01-12 14:49:03,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-12 14:49:03,990 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2019-01-12 14:49:03,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:49:03,994 INFO L225 Difference]: With dead ends: 447 [2019-01-12 14:49:03,997 INFO L226 Difference]: Without dead ends: 383 [2019-01-12 14:49:03,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-01-12 14:49:04,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2019-01-12 14:49:04,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 169. [2019-01-12 14:49:04,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-01-12 14:49:04,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 234 transitions. [2019-01-12 14:49:04,066 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 234 transitions. Word has length 30 [2019-01-12 14:49:04,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:49:04,068 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 234 transitions. [2019-01-12 14:49:04,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 14:49:04,069 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 234 transitions. [2019-01-12 14:49:04,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-12 14:49:04,071 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:49:04,071 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:49:04,072 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:49:04,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:49:04,072 INFO L82 PathProgramCache]: Analyzing trace with hash -553017344, now seen corresponding path program 1 times [2019-01-12 14:49:04,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:49:04,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:49:04,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:04,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:49:04,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:04,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:49:04,339 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-12 14:49:04,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:49:04,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:49:04,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:49:04,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:49:04,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:49:04,342 INFO L87 Difference]: Start difference. First operand 169 states and 234 transitions. Second operand 5 states. [2019-01-12 14:49:04,720 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-12 14:49:05,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:49:05,013 INFO L93 Difference]: Finished difference Result 458 states and 627 transitions. [2019-01-12 14:49:05,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 14:49:05,014 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-01-12 14:49:05,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:49:05,017 INFO L225 Difference]: With dead ends: 458 [2019-01-12 14:49:05,018 INFO L226 Difference]: Without dead ends: 295 [2019-01-12 14:49:05,019 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:05,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-01-12 14:49:05,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 184. [2019-01-12 14:49:05,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-01-12 14:49:05,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 249 transitions. [2019-01-12 14:49:05,047 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 249 transitions. Word has length 51 [2019-01-12 14:49:05,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:49:05,049 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 249 transitions. [2019-01-12 14:49:05,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:49:05,049 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 249 transitions. [2019-01-12 14:49:05,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-12 14:49:05,052 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:49:05,053 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:49:05,053 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:49:05,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:49:05,054 INFO L82 PathProgramCache]: Analyzing trace with hash 148582530, now seen corresponding path program 1 times [2019-01-12 14:49:05,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:49:05,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:49:05,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:05,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:49:05,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:05,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:49:05,217 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-12 14:49:05,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:49:05,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:49:05,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 14:49:05,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 14:49:05,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 14:49:05,219 INFO L87 Difference]: Start difference. First operand 184 states and 249 transitions. Second operand 4 states. [2019-01-12 14:49:05,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:49:05,558 INFO L93 Difference]: Finished difference Result 392 states and 529 transitions. [2019-01-12 14:49:05,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 14:49:05,558 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-01-12 14:49:05,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:49:05,560 INFO L225 Difference]: With dead ends: 392 [2019-01-12 14:49:05,561 INFO L226 Difference]: Without dead ends: 214 [2019-01-12 14:49:05,561 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:49:05,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-01-12 14:49:05,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 154. [2019-01-12 14:49:05,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-01-12 14:49:05,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 204 transitions. [2019-01-12 14:49:05,579 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 204 transitions. Word has length 51 [2019-01-12 14:49:05,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:49:05,579 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 204 transitions. [2019-01-12 14:49:05,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 14:49:05,580 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 204 transitions. [2019-01-12 14:49:05,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-12 14:49:05,581 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:49:05,582 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:49:05,582 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:49:05,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:49:05,582 INFO L82 PathProgramCache]: Analyzing trace with hash -701166778, now seen corresponding path program 1 times [2019-01-12 14:49:05,582 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:49:05,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:49:05,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:05,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:49:05,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:05,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:49:05,769 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-12 14:49:05,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:49:05,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:49:05,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 14:49:05,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 14:49:05,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 14:49:05,771 INFO L87 Difference]: Start difference. First operand 154 states and 204 transitions. Second operand 6 states. [2019-01-12 14:49:06,662 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-12 14:49:06,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:49:06,845 INFO L93 Difference]: Finished difference Result 756 states and 1034 transitions. [2019-01-12 14:49:06,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 14:49:06,846 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-01-12 14:49:06,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:49:06,854 INFO L225 Difference]: With dead ends: 756 [2019-01-12 14:49:06,854 INFO L226 Difference]: Without dead ends: 608 [2019-01-12 14:49:06,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-01-12 14:49:06,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2019-01-12 14:49:06,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 300. [2019-01-12 14:49:06,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-01-12 14:49:06,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 394 transitions. [2019-01-12 14:49:06,905 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 394 transitions. Word has length 52 [2019-01-12 14:49:06,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:49:06,906 INFO L480 AbstractCegarLoop]: Abstraction has 300 states and 394 transitions. [2019-01-12 14:49:06,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 14:49:06,907 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 394 transitions. [2019-01-12 14:49:06,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-12 14:49:06,919 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:49:06,919 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:49:06,919 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:49:06,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:49:06,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1850284924, now seen corresponding path program 1 times [2019-01-12 14:49:06,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:49:06,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:49:06,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:06,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:49:06,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:06,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:49:07,134 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-01-12 14:49:07,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:49:07,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:49:07,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:49:07,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:49:07,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:49:07,137 INFO L87 Difference]: Start difference. First operand 300 states and 394 transitions. Second operand 5 states. [2019-01-12 14:49:07,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:49:07,631 INFO L93 Difference]: Finished difference Result 800 states and 1059 transitions. [2019-01-12 14:49:07,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 14:49:07,632 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-01-12 14:49:07,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:49:07,638 INFO L225 Difference]: With dead ends: 800 [2019-01-12 14:49:07,638 INFO L226 Difference]: Without dead ends: 798 [2019-01-12 14:49:07,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 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:07,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2019-01-12 14:49:07,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 300. [2019-01-12 14:49:07,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-01-12 14:49:07,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 392 transitions. [2019-01-12 14:49:07,678 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 392 transitions. Word has length 53 [2019-01-12 14:49:07,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:49:07,678 INFO L480 AbstractCegarLoop]: Abstraction has 300 states and 392 transitions. [2019-01-12 14:49:07,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:49:07,679 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 392 transitions. [2019-01-12 14:49:07,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-12 14:49:07,680 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:49:07,680 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:49:07,680 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:49:07,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:49:07,681 INFO L82 PathProgramCache]: Analyzing trace with hash -956023316, now seen corresponding path program 1 times [2019-01-12 14:49:07,681 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:49:07,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:49:07,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:07,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:49:07,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:07,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:49:08,004 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2019-01-12 14:49:08,111 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:08,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:49:08,112 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:08,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:49:08,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:49:08,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:49:08,584 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:08,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:49:08,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2019-01-12 14:49:08,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 14:49:08,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 14:49:08,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-01-12 14:49:08,618 INFO L87 Difference]: Start difference. First operand 300 states and 392 transitions. Second operand 8 states. [2019-01-12 14:49:10,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:49:10,024 INFO L93 Difference]: Finished difference Result 1100 states and 1463 transitions. [2019-01-12 14:49:10,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-12 14:49:10,025 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2019-01-12 14:49:10,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:49:10,030 INFO L225 Difference]: With dead ends: 1100 [2019-01-12 14:49:10,030 INFO L226 Difference]: Without dead ends: 854 [2019-01-12 14:49:10,032 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 57 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:10,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2019-01-12 14:49:10,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 386. [2019-01-12 14:49:10,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2019-01-12 14:49:10,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 500 transitions. [2019-01-12 14:49:10,095 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 500 transitions. Word has length 53 [2019-01-12 14:49:10,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:49:10,096 INFO L480 AbstractCegarLoop]: Abstraction has 386 states and 500 transitions. [2019-01-12 14:49:10,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 14:49:10,096 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 500 transitions. [2019-01-12 14:49:10,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-12 14:49:10,099 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:49:10,099 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-01-12 14:49:10,099 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:49:10,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:49:10,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1396677984, now seen corresponding path program 2 times [2019-01-12 14:49:10,101 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:49:10,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:49:10,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:10,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:49:10,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:49:10,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 14:49:10,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 14:49:10,835 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 14:49:10,982 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 02:49:10 BoogieIcfgContainer [2019-01-12 14:49:10,983 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 14:49:10,984 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 14:49:10,984 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 14:49:10,984 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 14:49:10,985 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:49:00" (3/4) ... [2019-01-12 14:49:10,989 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-12 14:49:11,198 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 14:49:11,198 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 14:49:11,199 INFO L168 Benchmark]: Toolchain (without parser) took 12849.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 192.9 MB). Free memory was 952.7 MB in the beginning and 793.6 MB in the end (delta: 159.1 MB). Peak memory consumption was 352.1 MB. Max. memory is 11.5 GB. [2019-01-12 14:49:11,201 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:11,201 INFO L168 Benchmark]: CACSL2BoogieTranslator took 751.68 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -146.6 MB). Peak memory consumption was 36.8 MB. Max. memory is 11.5 GB. [2019-01-12 14:49:11,201 INFO L168 Benchmark]: Boogie Procedure Inliner took 94.25 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-01-12 14:49:11,203 INFO L168 Benchmark]: Boogie Preprocessor took 58.24 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 14:49:11,203 INFO L168 Benchmark]: RCFGBuilder took 1696.86 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 71.3 MB). Peak memory consumption was 71.3 MB. Max. memory is 11.5 GB. [2019-01-12 14:49:11,203 INFO L168 Benchmark]: TraceAbstraction took 10027.48 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 75.0 MB). Free memory was 1.0 GB in the beginning and 824.0 MB in the end (delta: 197.5 MB). Peak memory consumption was 272.4 MB. Max. memory is 11.5 GB. [2019-01-12 14:49:11,203 INFO L168 Benchmark]: Witness Printer took 214.43 ms. Allocated memory is still 1.2 GB. Free memory was 824.0 MB in the beginning and 793.6 MB in the end (delta: 30.4 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. [2019-01-12 14:49:11,207 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 751.68 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -146.6 MB). Peak memory consumption was 36.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 94.25 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 58.24 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1696.86 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 71.3 MB). Peak memory consumption was 71.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10027.48 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 75.0 MB). Free memory was 1.0 GB in the beginning and 824.0 MB in the end (delta: 197.5 MB). Peak memory consumption was 272.4 MB. Max. memory is 11.5 GB. * Witness Printer took 214.43 ms. Allocated memory is still 1.2 GB. Free memory was 824.0 MB in the beginning and 793.6 MB in the end (delta: 30.4 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 317]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L117] int pumpRunning = 0; [L118] int systemActive = 1; [L491] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L715] int cleanupTimeShifts = 4; [L814] int waterLevel = 1; [L815] int methaneLevelCritical = 0; [L791] int retValue_acc ; [L792] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L934] int retValue_acc ; [L937] retValue_acc = 1 [L938] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L798] tmp = valid_product() [L800] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L45] int splverifierCounter ; [L46] int tmp ; [L47] int tmp___0 ; [L48] int tmp___1 ; [L49] int tmp___2 ; [L52] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L54] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L56] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L62] tmp = __VERIFIER_nondet_int() [L64] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L832] COND TRUE waterLevel < 2 [L833] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L72] tmp___0 = __VERIFIER_nondet_int() [L74] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L82] tmp___2 = __VERIFIER_nondet_int() [L84] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L125] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L132] COND TRUE \read(systemActive) [L180] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L183] COND FALSE !(\read(pumpRunning)) [L154] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L157] COND TRUE ! pumpRunning [L294] int retValue_acc ; [L295] int tmp ; [L296] int tmp___0 ; [L894] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L897] COND FALSE !(waterLevel < 2) [L901] retValue_acc = 0 [L902] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L300] tmp = isHighWaterSensorDry() [L302] COND FALSE !(\read(tmp)) [L305] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L307] retValue_acc = tmp___0 [L308] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L159] tmp = isHighWaterLevel() [L161] COND TRUE \read(tmp) [L213] int tmp ; [L238] int retValue_acc ; [L853] int retValue_acc ; [L856] retValue_acc = methaneLevelCritical [L857] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L242] retValue_acc = isMethaneLevelCritical() [L244] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L217] tmp = isMethaneAlarm() [L219] COND FALSE !(\read(tmp)) [L208] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L690] int tmp ; [L691] int tmp___0 ; [L885] int retValue_acc ; [L888] retValue_acc = waterLevel [L889] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L695] tmp = getWaterLevel() [L697] COND FALSE !(tmp == 0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L54] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L56] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L62] tmp = __VERIFIER_nondet_int() [L64] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L72] tmp___0 = __VERIFIER_nondet_int() [L74] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L82] tmp___2 = __VERIFIER_nondet_int() [L84] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L125] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L820] COND TRUE waterLevel > 0 [L821] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L132] COND TRUE \read(systemActive) [L180] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L183] COND TRUE \read(pumpRunning) [L238] int retValue_acc ; [L853] int retValue_acc ; [L856] retValue_acc = methaneLevelCritical [L857] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L242] retValue_acc = isMethaneLevelCritical() [L244] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L185] tmp = isMethaneAlarm() [L187] COND FALSE !(\read(tmp)) [L154] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L157] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L690] int tmp ; [L691] int tmp___0 ; [L885] int retValue_acc ; [L888] retValue_acc = waterLevel [L889] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L695] tmp = getWaterLevel() [L697] COND FALSE !(tmp == 0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L54] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L56] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L62] tmp = __VERIFIER_nondet_int() [L64] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L72] tmp___0 = __VERIFIER_nondet_int() [L74] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L82] tmp___2 = __VERIFIER_nondet_int() [L84] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L125] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L820] COND TRUE waterLevel > 0 [L821] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L132] COND TRUE \read(systemActive) [L180] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L183] COND TRUE \read(pumpRunning) [L238] int retValue_acc ; [L853] int retValue_acc ; [L856] retValue_acc = methaneLevelCritical [L857] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L242] retValue_acc = isMethaneLevelCritical() [L244] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L185] tmp = isMethaneAlarm() [L187] COND FALSE !(\read(tmp)) [L154] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L157] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L690] int tmp ; [L691] int tmp___0 ; [L885] int retValue_acc ; [L888] retValue_acc = waterLevel [L889] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L695] tmp = getWaterLevel() [L697] COND TRUE tmp == 0 [L249] int retValue_acc ; [L252] retValue_acc = pumpRunning [L253] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L699] tmp___0 = isPumpRunning() [L701] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L317] __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, 129 locations, 3 error locations. UNSAFE Result, 9.9s OverallTime, 11 OverallIterations, 3 TraceHistogramMax, 5.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1090 SDtfs, 2086 SDslu, 2157 SDs, 0 SdLazy, 336 SolverSat, 87 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 135 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=386occurred 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, 1661 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 494 NumberOfCodeBlocks, 494 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 411 ConstructedInterpolants, 0 QuantifiedInterpolants, 38596 SizeOfPredicates, 4 NumberOfNonLiveVariables, 409 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 11 InterpolantComputations, 9 PerfectInterpolantSequences, 86/92 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...