./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec2_product42_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_product42_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 ea28f55a4b6a2303e55c14d7dbcddcf1e8db1491 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:06,627 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 14:47:06,629 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 14:47:06,642 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 14:47:06,642 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 14:47:06,643 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 14:47:06,645 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 14:47:06,647 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 14:47:06,649 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 14:47:06,649 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 14:47:06,650 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 14:47:06,651 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 14:47:06,652 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 14:47:06,652 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 14:47:06,654 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 14:47:06,654 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 14:47:06,657 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 14:47:06,660 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 14:47:06,664 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 14:47:06,668 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 14:47:06,671 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 14:47:06,674 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 14:47:06,680 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 14:47:06,680 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 14:47:06,680 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 14:47:06,682 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 14:47:06,683 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 14:47:06,685 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 14:47:06,686 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 14:47:06,689 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 14:47:06,689 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 14:47:06,690 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 14:47:06,690 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 14:47:06,690 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 14:47:06,691 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 14:47:06,694 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 14:47:06,696 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:06,719 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 14:47:06,720 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 14:47:06,721 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 14:47:06,722 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 14:47:06,722 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 14:47:06,723 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 14:47:06,723 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 14:47:06,724 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 14:47:06,724 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 14:47:06,724 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 14:47:06,724 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 14:47:06,724 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 14:47:06,725 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 14:47:06,725 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 14:47:06,725 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 14:47:06,726 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 14:47:06,726 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 14:47:06,727 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 14:47:06,727 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 14:47:06,727 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 14:47:06,727 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 14:47:06,727 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 14:47:06,728 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 14:47:06,730 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 14:47:06,731 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 14:47:06,731 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 14:47:06,731 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 14:47:06,731 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 14:47:06,732 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 -> ea28f55a4b6a2303e55c14d7dbcddcf1e8db1491 [2019-01-12 14:47:06,790 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 14:47:06,802 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 14:47:06,806 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 14:47:06,807 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 14:47:06,808 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 14:47:06,809 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec2_product42_false-unreach-call_false-termination.cil.c [2019-01-12 14:47:06,869 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/231032df7/1521c45c11104deabf2310ed7b7625f9/FLAG112ff195d [2019-01-12 14:47:07,444 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 14:47:07,445 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec2_product42_false-unreach-call_false-termination.cil.c [2019-01-12 14:47:07,461 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/231032df7/1521c45c11104deabf2310ed7b7625f9/FLAG112ff195d [2019-01-12 14:47:07,713 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/231032df7/1521c45c11104deabf2310ed7b7625f9 [2019-01-12 14:47:07,717 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 14:47:07,719 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 14:47:07,721 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 14:47:07,721 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 14:47:07,725 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 14:47:07,726 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:47:07" (1/1) ... [2019-01-12 14:47:07,730 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dc2e1f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:47:07, skipping insertion in model container [2019-01-12 14:47:07,730 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:47:07" (1/1) ... [2019-01-12 14:47:07,739 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 14:47:07,799 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 14:47:08,146 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:47:08,172 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 14:47:08,399 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:47:08,433 INFO L195 MainTranslator]: Completed translation [2019-01-12 14:47:08,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:47:08 WrapperNode [2019-01-12 14:47:08,433 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 14:47:08,434 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 14:47:08,435 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 14:47:08,435 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 14:47:08,444 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:08" (1/1) ... [2019-01-12 14:47:08,470 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:08" (1/1) ... [2019-01-12 14:47:08,544 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 14:47:08,544 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 14:47:08,544 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 14:47:08,544 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 14:47:08,557 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:08" (1/1) ... [2019-01-12 14:47:08,558 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:08" (1/1) ... [2019-01-12 14:47:08,566 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:08" (1/1) ... [2019-01-12 14:47:08,567 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:08" (1/1) ... [2019-01-12 14:47:08,587 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:08" (1/1) ... [2019-01-12 14:47:08,604 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:08" (1/1) ... [2019-01-12 14:47:08,606 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:08" (1/1) ... [2019-01-12 14:47:08,615 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 14:47:08,616 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 14:47:08,616 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 14:47:08,616 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 14:47:08,620 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:47:08" (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:08,707 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 14:47:08,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-12 14:47:08,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 14:47:08,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 14:47:09,991 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 14:47:09,991 INFO L286 CfgBuilder]: Removed 118 assue(true) statements. [2019-01-12 14:47:09,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:47:09 BoogieIcfgContainer [2019-01-12 14:47:09,993 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 14:47:09,994 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 14:47:09,994 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 14:47:09,997 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 14:47:09,997 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 02:47:07" (1/3) ... [2019-01-12 14:47:09,998 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17246211 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:47:09, skipping insertion in model container [2019-01-12 14:47:09,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:47:08" (2/3) ... [2019-01-12 14:47:09,999 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17246211 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:47:09, skipping insertion in model container [2019-01-12 14:47:09,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:47:09" (3/3) ... [2019-01-12 14:47:10,001 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec2_product42_false-unreach-call_false-termination.cil.c [2019-01-12 14:47:10,011 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 14:47:10,019 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-12 14:47:10,036 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-12 14:47:10,068 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 14:47:10,069 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 14:47:10,069 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 14:47:10,069 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 14:47:10,069 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 14:47:10,070 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 14:47:10,070 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 14:47:10,070 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 14:47:10,070 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 14:47:10,087 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states. [2019-01-12 14:47:10,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-12 14:47:10,094 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:47:10,095 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:10,098 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:47:10,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:47:10,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1607383533, now seen corresponding path program 1 times [2019-01-12 14:47:10,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:47:10,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:47:10,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:10,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:47:10,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:10,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:47:10,374 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,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:47:10,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:47:10,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 14:47:10,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 14:47:10,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 14:47:10,398 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 2 states. [2019-01-12 14:47:10,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:47:10,431 INFO L93 Difference]: Finished difference Result 175 states and 264 transitions. [2019-01-12 14:47:10,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 14:47:10,433 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2019-01-12 14:47:10,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:47:10,452 INFO L225 Difference]: With dead ends: 175 [2019-01-12 14:47:10,452 INFO L226 Difference]: Without dead ends: 87 [2019-01-12 14:47:10,457 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:10,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-01-12 14:47:10,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-01-12 14:47:10,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-01-12 14:47:10,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 124 transitions. [2019-01-12 14:47:10,514 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 124 transitions. Word has length 18 [2019-01-12 14:47:10,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:47:10,514 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 124 transitions. [2019-01-12 14:47:10,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 14:47:10,515 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 124 transitions. [2019-01-12 14:47:10,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-12 14:47:10,516 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:47:10,516 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:10,516 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:47:10,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:47:10,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1734754371, now seen corresponding path program 1 times [2019-01-12 14:47:10,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:47:10,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:47:10,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:10,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:47:10,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:10,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:47:10,705 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,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:47:10,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 14:47:10,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:47:10,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:47:10,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:47:10,709 INFO L87 Difference]: Start difference. First operand 87 states and 124 transitions. Second operand 3 states. [2019-01-12 14:47:10,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:47:10,737 INFO L93 Difference]: Finished difference Result 87 states and 124 transitions. [2019-01-12 14:47:10,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:47:10,738 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-01-12 14:47:10,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:47:10,739 INFO L225 Difference]: With dead ends: 87 [2019-01-12 14:47:10,739 INFO L226 Difference]: Without dead ends: 39 [2019-01-12 14:47:10,742 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:10,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-12 14:47:10,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-01-12 14:47:10,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-12 14:47:10,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 55 transitions. [2019-01-12 14:47:10,751 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 55 transitions. Word has length 19 [2019-01-12 14:47:10,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:47:10,751 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 55 transitions. [2019-01-12 14:47:10,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:47:10,752 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 55 transitions. [2019-01-12 14:47:10,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-12 14:47:10,756 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:47:10,756 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:10,757 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:47:10,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:47:10,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1107356745, now seen corresponding path program 1 times [2019-01-12 14:47:10,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:47:10,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:47:10,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:10,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:47:10,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:10,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:47:10,899 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,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:47:10,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 14:47:10,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:47:10,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:47:10,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:47:10,902 INFO L87 Difference]: Start difference. First operand 39 states and 55 transitions. Second operand 3 states. [2019-01-12 14:47:10,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:47:10,951 INFO L93 Difference]: Finished difference Result 71 states and 103 transitions. [2019-01-12 14:47:10,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:47:10,952 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-01-12 14:47:10,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:47:10,953 INFO L225 Difference]: With dead ends: 71 [2019-01-12 14:47:10,956 INFO L226 Difference]: Without dead ends: 39 [2019-01-12 14:47:10,957 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:10,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-12 14:47:10,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-01-12 14:47:10,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-12 14:47:10,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 54 transitions. [2019-01-12 14:47:10,966 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 54 transitions. Word has length 24 [2019-01-12 14:47:10,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:47:10,969 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 54 transitions. [2019-01-12 14:47:10,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:47:10,969 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2019-01-12 14:47:10,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-12 14:47:10,971 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:47:10,971 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:10,972 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:47:10,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:47:10,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1414852999, now seen corresponding path program 1 times [2019-01-12 14:47:10,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:47:10,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:47:10,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:10,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:47:10,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:11,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:47:11,111 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,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:47:11,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:47:11,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:47:11,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:47:11,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:47:11,118 INFO L87 Difference]: Start difference. First operand 39 states and 54 transitions. Second operand 3 states. [2019-01-12 14:47:11,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:47:11,187 INFO L93 Difference]: Finished difference Result 93 states and 133 transitions. [2019-01-12 14:47:11,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:47:11,189 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-01-12 14:47:11,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:47:11,191 INFO L225 Difference]: With dead ends: 93 [2019-01-12 14:47:11,191 INFO L226 Difference]: Without dead ends: 61 [2019-01-12 14:47:11,194 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:11,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-12 14:47:11,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2019-01-12 14:47:11,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-12 14:47:11,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 83 transitions. [2019-01-12 14:47:11,216 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 83 transitions. Word has length 25 [2019-01-12 14:47:11,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:47:11,216 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 83 transitions. [2019-01-12 14:47:11,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:47:11,217 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 83 transitions. [2019-01-12 14:47:11,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-12 14:47:11,218 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:47:11,218 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:11,218 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:47:11,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:47:11,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1390046811, now seen corresponding path program 1 times [2019-01-12 14:47:11,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:47:11,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:47:11,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:11,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:47:11,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:11,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:47:11,357 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,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:47:11,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:47:11,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:47:11,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:47:11,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:47:11,360 INFO L87 Difference]: Start difference. First operand 59 states and 83 transitions. Second operand 5 states. [2019-01-12 14:47:11,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:47:11,648 INFO L93 Difference]: Finished difference Result 271 states and 394 transitions. [2019-01-12 14:47:11,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 14:47:11,651 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-01-12 14:47:11,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:47:11,654 INFO L225 Difference]: With dead ends: 271 [2019-01-12 14:47:11,654 INFO L226 Difference]: Without dead ends: 219 [2019-01-12 14:47:11,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-12 14:47:11,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-01-12 14:47:11,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 103. [2019-01-12 14:47:11,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-12 14:47:11,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 144 transitions. [2019-01-12 14:47:11,675 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 144 transitions. Word has length 31 [2019-01-12 14:47:11,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:47:11,675 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 144 transitions. [2019-01-12 14:47:11,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:47:11,676 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 144 transitions. [2019-01-12 14:47:11,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-12 14:47:11,677 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:47:11,677 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:11,678 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:47:11,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:47:11,678 INFO L82 PathProgramCache]: Analyzing trace with hash 272516125, now seen corresponding path program 1 times [2019-01-12 14:47:11,678 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:47:11,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:47:11,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:11,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:47:11,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:11,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:47:11,791 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,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:47:11,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:47:11,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:47:11,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:47:11,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:47:11,793 INFO L87 Difference]: Start difference. First operand 103 states and 144 transitions. Second operand 5 states. [2019-01-12 14:47:12,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:47:12,567 INFO L93 Difference]: Finished difference Result 376 states and 533 transitions. [2019-01-12 14:47:12,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 14:47:12,568 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-01-12 14:47:12,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:47:12,570 INFO L225 Difference]: With dead ends: 376 [2019-01-12 14:47:12,571 INFO L226 Difference]: Without dead ends: 280 [2019-01-12 14:47:12,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-12 14:47:12,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-01-12 14:47:12,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 102. [2019-01-12 14:47:12,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-01-12 14:47:12,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 141 transitions. [2019-01-12 14:47:12,611 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 141 transitions. Word has length 32 [2019-01-12 14:47:12,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:47:12,616 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 141 transitions. [2019-01-12 14:47:12,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:47:12,616 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 141 transitions. [2019-01-12 14:47:12,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-12 14:47:12,618 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:47:12,618 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,621 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:47:12,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:47:12,622 INFO L82 PathProgramCache]: Analyzing trace with hash -824557763, now seen corresponding path program 1 times [2019-01-12 14:47:12,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:47:12,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:47:12,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:12,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:47:12,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:12,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:47:12,898 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,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:47:12,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:47:12,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:47:12,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:47:12,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:47:12,904 INFO L87 Difference]: Start difference. First operand 102 states and 141 transitions. Second operand 5 states. [2019-01-12 14:47:13,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:47:13,106 INFO L93 Difference]: Finished difference Result 273 states and 377 transitions. [2019-01-12 14:47:13,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 14:47:13,108 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-01-12 14:47:13,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:47:13,109 INFO L225 Difference]: With dead ends: 273 [2019-01-12 14:47:13,109 INFO L226 Difference]: Without dead ends: 178 [2019-01-12 14:47:13,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-12 14:47:13,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-01-12 14:47:13,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 108. [2019-01-12 14:47:13,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-12 14:47:13,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 147 transitions. [2019-01-12 14:47:13,134 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 147 transitions. Word has length 35 [2019-01-12 14:47:13,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:47:13,138 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 147 transitions. [2019-01-12 14:47:13,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:47:13,138 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 147 transitions. [2019-01-12 14:47:13,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-12 14:47:13,139 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:47:13,143 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:13,144 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:47:13,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:47:13,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1835675013, now seen corresponding path program 1 times [2019-01-12 14:47:13,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:47:13,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:47:13,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:13,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:47:13,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:13,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:47:13,329 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:13,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:47:13,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:47:13,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 14:47:13,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 14:47:13,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 14:47:13,331 INFO L87 Difference]: Start difference. First operand 108 states and 147 transitions. Second operand 4 states. [2019-01-12 14:47:13,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:47:13,435 INFO L93 Difference]: Finished difference Result 255 states and 347 transitions. [2019-01-12 14:47:13,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 14:47:13,435 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-01-12 14:47:13,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:47:13,437 INFO L225 Difference]: With dead ends: 255 [2019-01-12 14:47:13,437 INFO L226 Difference]: Without dead ends: 154 [2019-01-12 14:47:13,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:47:13,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-01-12 14:47:13,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 112. [2019-01-12 14:47:13,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-01-12 14:47:13,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 151 transitions. [2019-01-12 14:47:13,456 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 151 transitions. Word has length 35 [2019-01-12 14:47:13,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:47:13,456 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 151 transitions. [2019-01-12 14:47:13,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 14:47:13,457 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 151 transitions. [2019-01-12 14:47:13,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-12 14:47:13,458 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:47:13,458 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:13,458 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:47:13,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:47:13,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1438223929, now seen corresponding path program 1 times [2019-01-12 14:47:13,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:47:13,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:47:13,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:13,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:47:13,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:13,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:47:13,561 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:13,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:47:13,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:47:13,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:47:13,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:47:13,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:47:13,564 INFO L87 Difference]: Start difference. First operand 112 states and 151 transitions. Second operand 3 states. [2019-01-12 14:47:13,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:47:13,726 INFO L93 Difference]: Finished difference Result 265 states and 357 transitions. [2019-01-12 14:47:13,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:47:13,726 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-01-12 14:47:13,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:47:13,728 INFO L225 Difference]: With dead ends: 265 [2019-01-12 14:47:13,728 INFO L226 Difference]: Without dead ends: 160 [2019-01-12 14:47:13,729 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:13,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-01-12 14:47:13,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2019-01-12 14:47:13,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-01-12 14:47:13,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 209 transitions. [2019-01-12 14:47:13,771 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 209 transitions. Word has length 35 [2019-01-12 14:47:13,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:47:13,771 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 209 transitions. [2019-01-12 14:47:13,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:47:13,771 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 209 transitions. [2019-01-12 14:47:13,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-12 14:47:13,772 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:47:13,772 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:13,775 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:47:13,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:47:13,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1113565433, now seen corresponding path program 1 times [2019-01-12 14:47:13,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:47:13,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:47:13,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:13,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:47:13,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:13,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:47:14,064 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:14,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:47:14,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 14:47:14,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 14:47:14,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 14:47:14,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 14:47:14,066 INFO L87 Difference]: Start difference. First operand 160 states and 209 transitions. Second operand 6 states. [2019-01-12 14:47:14,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:47:14,903 INFO L93 Difference]: Finished difference Result 485 states and 635 transitions. [2019-01-12 14:47:14,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 14:47:14,903 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2019-01-12 14:47:14,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:47:14,906 INFO L225 Difference]: With dead ends: 485 [2019-01-12 14:47:14,906 INFO L226 Difference]: Without dead ends: 332 [2019-01-12 14:47:14,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-01-12 14:47:14,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-01-12 14:47:14,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 160. [2019-01-12 14:47:14,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-01-12 14:47:14,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 205 transitions. [2019-01-12 14:47:14,935 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 205 transitions. Word has length 36 [2019-01-12 14:47:14,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:47:14,935 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 205 transitions. [2019-01-12 14:47:14,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 14:47:14,935 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 205 transitions. [2019-01-12 14:47:14,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-12 14:47:14,936 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:47:14,936 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,937 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:47:14,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:47:14,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1527108990, now seen corresponding path program 1 times [2019-01-12 14:47:14,937 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:47:14,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:47:14,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:14,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:47:14,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:14,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:47:15,018 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:15,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:47:15,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 14:47:15,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:47:15,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:47:15,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:47:15,020 INFO L87 Difference]: Start difference. First operand 160 states and 205 transitions. Second operand 3 states. [2019-01-12 14:47:15,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:47:15,158 INFO L93 Difference]: Finished difference Result 233 states and 301 transitions. [2019-01-12 14:47:15,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:47:15,159 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-01-12 14:47:15,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:47:15,162 INFO L225 Difference]: With dead ends: 233 [2019-01-12 14:47:15,162 INFO L226 Difference]: Without dead ends: 231 [2019-01-12 14:47:15,162 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:15,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2019-01-12 14:47:15,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 180. [2019-01-12 14:47:15,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-01-12 14:47:15,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 235 transitions. [2019-01-12 14:47:15,225 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 235 transitions. Word has length 51 [2019-01-12 14:47:15,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:47:15,225 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 235 transitions. [2019-01-12 14:47:15,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:47:15,226 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 235 transitions. [2019-01-12 14:47:15,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-12 14:47:15,226 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:47:15,227 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:15,227 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:47:15,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:47:15,227 INFO L82 PathProgramCache]: Analyzing trace with hash 338659975, now seen corresponding path program 1 times [2019-01-12 14:47:15,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:47:15,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:47:15,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:15,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:47:15,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:47:15,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 14:47:15,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 14:47:15,935 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 14:47:16,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 02:47:16 BoogieIcfgContainer [2019-01-12 14:47:16,119 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 14:47:16,119 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 14:47:16,120 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 14:47:16,120 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 14:47:16,120 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:09" (3/4) ... [2019-01-12 14:47:16,124 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-12 14:47:16,287 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 14:47:16,287 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 14:47:16,288 INFO L168 Benchmark]: Toolchain (without parser) took 8569.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 184.5 MB). Free memory was 951.4 MB in the beginning and 971.2 MB in the end (delta: -19.9 MB). Peak memory consumption was 164.7 MB. Max. memory is 11.5 GB. [2019-01-12 14:47:16,290 INFO L168 Benchmark]: CDTParser took 0.20 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,290 INFO L168 Benchmark]: CACSL2BoogieTranslator took 713.37 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.1 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -132.6 MB). Peak memory consumption was 37.3 MB. Max. memory is 11.5 GB. [2019-01-12 14:47:16,291 INFO L168 Benchmark]: Boogie Procedure Inliner took 109.54 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-01-12 14:47:16,292 INFO L168 Benchmark]: Boogie Preprocessor took 71.56 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:47:16,292 INFO L168 Benchmark]: RCFGBuilder took 1376.95 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: 61.2 MB). Peak memory consumption was 61.2 MB. Max. memory is 11.5 GB. [2019-01-12 14:47:16,292 INFO L168 Benchmark]: TraceAbstraction took 6125.32 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 85.5 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 11.0 MB). Peak memory consumption was 96.4 MB. Max. memory is 11.5 GB. [2019-01-12 14:47:16,293 INFO L168 Benchmark]: Witness Printer took 167.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 971.2 MB in the end (delta: 33.6 MB). Peak memory consumption was 33.6 MB. Max. memory is 11.5 GB. [2019-01-12 14:47:16,296 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.20 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 713.37 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.1 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -132.6 MB). Peak memory consumption was 37.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 109.54 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 71.56 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 1376.95 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: 61.2 MB). Peak memory consumption was 61.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6125.32 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 85.5 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 11.0 MB). Peak memory consumption was 96.4 MB. Max. memory is 11.5 GB. * Witness Printer took 167.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 971.2 MB in the end (delta: 33.6 MB). Peak memory consumption was 33.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 844]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L209] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L486] int pumpRunning = 0; [L487] int systemActive = 1; [L666] int methAndRunningLastTime ; [L743] int cleanupTimeShifts = 4; [L850] int waterLevel = 1; [L851] int methaneLevelCritical = 0; [L817] int retValue_acc ; [L818] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L734] int retValue_acc ; [L737] retValue_acc = 1 [L738] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L824] tmp = valid_product() [L826] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L671] methAndRunningLastTime = 0 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L412] int splverifierCounter ; [L413] int tmp ; [L414] int tmp___0 ; [L415] int tmp___1 ; [L416] int tmp___2 ; [L419] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L421] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L423] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L429] tmp = __VERIFIER_nondet_int() [L431] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L868] COND TRUE waterLevel < 2 [L869] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L439] tmp___0 = __VERIFIER_nondet_int() [L441] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L449] tmp___2 = __VERIFIER_nondet_int() [L451] COND TRUE \read(tmp___2) [L660] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L494] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L501] COND TRUE \read(systemActive) [L523] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L526] COND TRUE ! pumpRunning [L638] int retValue_acc ; [L639] int tmp ; [L640] int tmp___0 ; [L930] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L933] COND FALSE !(waterLevel < 2) [L937] retValue_acc = 0 [L938] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L644] tmp = isHighWaterSensorDry() [L646] COND FALSE !(\read(tmp)) [L649] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L651] retValue_acc = tmp___0 [L652] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L528] tmp = isHighWaterLevel() [L530] COND TRUE \read(tmp) [L557] int tmp ; [L582] int retValue_acc ; [L889] int retValue_acc ; [L892] retValue_acc = methaneLevelCritical [L893] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L586] retValue_acc = isMethaneLevelCritical() [L588] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L561] tmp = isMethaneAlarm() [L563] COND FALSE !(\read(tmp)) [L551] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L676] int tmp ; [L677] int tmp___0 ; [L889] int retValue_acc ; [L892] retValue_acc = methaneLevelCritical [L893] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L681] tmp = isMethaneLevelCritical() [L683] COND FALSE !(\read(tmp)) [L699] methAndRunningLastTime = 0 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L421] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L423] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L429] tmp = __VERIFIER_nondet_int() [L431] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L439] tmp___0 = __VERIFIER_nondet_int() [L441] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L880] COND FALSE !(\read(methaneLevelCritical)) [L883] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L449] tmp___2 = __VERIFIER_nondet_int() [L451] COND TRUE \read(tmp___2) [L660] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L494] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L856] COND TRUE waterLevel > 0 [L857] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L501] COND TRUE \read(systemActive) [L523] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L526] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L676] int tmp ; [L677] int tmp___0 ; [L889] int retValue_acc ; [L892] retValue_acc = methaneLevelCritical [L893] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L681] tmp = isMethaneLevelCritical() [L683] COND TRUE \read(tmp) [L593] int retValue_acc ; [L596] retValue_acc = pumpRunning [L597] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L685] tmp___0 = isPumpRunning() [L687] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L688] COND FALSE !(\read(methAndRunningLastTime)) [L693] methAndRunningLastTime = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L421] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L423] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L429] tmp = __VERIFIER_nondet_int() [L431] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L439] tmp___0 = __VERIFIER_nondet_int() [L441] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L449] tmp___2 = __VERIFIER_nondet_int() [L451] COND TRUE \read(tmp___2) [L660] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L494] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L856] COND TRUE waterLevel > 0 [L857] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L501] COND TRUE \read(systemActive) [L523] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L526] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L676] int tmp ; [L677] int tmp___0 ; [L889] int retValue_acc ; [L892] retValue_acc = methaneLevelCritical [L893] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L681] tmp = isMethaneLevelCritical() [L683] COND TRUE \read(tmp) [L593] int retValue_acc ; [L596] retValue_acc = pumpRunning [L597] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L685] tmp___0 = isPumpRunning() [L687] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L688] COND TRUE \read(methAndRunningLastTime) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L844] __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, 6.0s OverallTime, 12 OverallIterations, 3 TraceHistogramMax, 2.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 837 SDtfs, 942 SDslu, 1280 SDs, 0 SdLazy, 171 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.8s 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.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 631 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 410 NumberOfCodeBlocks, 410 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 330 ConstructedInterpolants, 0 QuantifiedInterpolants, 19622 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...