./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/product-lines/minepump_spec2_product44_false-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa 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_product44_false-unreach-call_false-termination.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1e304dec1a19556a559249c7b1ef76290bc8b678 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-2e94e6a [2018-12-31 09:42:13,086 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 09:42:13,088 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 09:42:13,108 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 09:42:13,108 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 09:42:13,109 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 09:42:13,110 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 09:42:13,112 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 09:42:13,114 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 09:42:13,115 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 09:42:13,116 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 09:42:13,116 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 09:42:13,117 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 09:42:13,118 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 09:42:13,119 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 09:42:13,120 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 09:42:13,121 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 09:42:13,123 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 09:42:13,125 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 09:42:13,127 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 09:42:13,128 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 09:42:13,129 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 09:42:13,132 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 09:42:13,132 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 09:42:13,132 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 09:42:13,133 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 09:42:13,135 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 09:42:13,135 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 09:42:13,136 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 09:42:13,138 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 09:42:13,138 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 09:42:13,139 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 09:42:13,139 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 09:42:13,139 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 09:42:13,140 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 09:42:13,141 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 09:42:13,141 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 09:42:13,167 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 09:42:13,169 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 09:42:13,170 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 09:42:13,170 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 09:42:13,172 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 09:42:13,172 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 09:42:13,173 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 09:42:13,173 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 09:42:13,173 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 09:42:13,173 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 09:42:13,173 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 09:42:13,173 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 09:42:13,175 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 09:42:13,175 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 09:42:13,175 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 09:42:13,176 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 09:42:13,176 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 09:42:13,176 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 09:42:13,176 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 09:42:13,176 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 09:42:13,177 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 09:42:13,179 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 09:42:13,179 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 09:42:13,180 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 09:42:13,180 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 09:42:13,180 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 09:42:13,181 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 09:42:13,181 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 09:42:13,181 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 -> 1e304dec1a19556a559249c7b1ef76290bc8b678 [2018-12-31 09:42:13,242 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 09:42:13,262 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 09:42:13,269 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 09:42:13,271 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 09:42:13,272 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 09:42:13,272 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/minepump_spec2_product44_false-unreach-call_false-termination.cil.c [2018-12-31 09:42:13,346 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b64f4b913/c6af3c2960044a47a5205f41c996e644/FLAGcad4471d6 [2018-12-31 09:42:13,912 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 09:42:13,914 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/minepump_spec2_product44_false-unreach-call_false-termination.cil.c [2018-12-31 09:42:13,943 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b64f4b913/c6af3c2960044a47a5205f41c996e644/FLAGcad4471d6 [2018-12-31 09:42:14,214 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b64f4b913/c6af3c2960044a47a5205f41c996e644 [2018-12-31 09:42:14,218 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 09:42:14,220 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 09:42:14,222 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 09:42:14,222 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 09:42:14,226 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 09:42:14,227 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:42:14" (1/1) ... [2018-12-31 09:42:14,230 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74fb2347 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:42:14, skipping insertion in model container [2018-12-31 09:42:14,231 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:42:14" (1/1) ... [2018-12-31 09:42:14,240 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 09:42:14,309 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 09:42:14,671 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 09:42:14,686 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 09:42:14,798 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 09:42:14,839 INFO L195 MainTranslator]: Completed translation [2018-12-31 09:42:14,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:42:14 WrapperNode [2018-12-31 09:42:14,840 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 09:42:14,841 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 09:42:14,842 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 09:42:14,842 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 09:42:14,933 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:42:14" (1/1) ... [2018-12-31 09:42:14,964 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:42:14" (1/1) ... [2018-12-31 09:42:15,009 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 09:42:15,010 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 09:42:15,010 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 09:42:15,010 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 09:42:15,019 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:42:14" (1/1) ... [2018-12-31 09:42:15,019 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:42:14" (1/1) ... [2018-12-31 09:42:15,024 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:42:14" (1/1) ... [2018-12-31 09:42:15,024 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:42:14" (1/1) ... [2018-12-31 09:42:15,036 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:42:14" (1/1) ... [2018-12-31 09:42:15,053 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:42:14" (1/1) ... [2018-12-31 09:42:15,056 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:42:14" (1/1) ... [2018-12-31 09:42:15,066 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 09:42:15,066 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 09:42:15,067 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 09:42:15,067 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 09:42:15,068 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:42:14" (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 [2018-12-31 09:42:15,125 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 09:42:15,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-31 09:42:15,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 09:42:15,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 09:42:16,579 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 09:42:16,579 INFO L280 CfgBuilder]: Removed 122 assue(true) statements. [2018-12-31 09:42:16,579 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:42:16 BoogieIcfgContainer [2018-12-31 09:42:16,580 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 09:42:16,581 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 09:42:16,581 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 09:42:16,584 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 09:42:16,584 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 09:42:14" (1/3) ... [2018-12-31 09:42:16,585 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6de60162 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:42:16, skipping insertion in model container [2018-12-31 09:42:16,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:42:14" (2/3) ... [2018-12-31 09:42:16,586 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6de60162 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:42:16, skipping insertion in model container [2018-12-31 09:42:16,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:42:16" (3/3) ... [2018-12-31 09:42:16,588 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec2_product44_false-unreach-call_false-termination.cil.c [2018-12-31 09:42:16,598 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 09:42:16,607 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-31 09:42:16,625 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-31 09:42:16,657 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 09:42:16,658 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 09:42:16,658 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 09:42:16,658 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 09:42:16,659 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 09:42:16,659 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 09:42:16,659 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 09:42:16,659 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 09:42:16,659 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 09:42:16,677 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states. [2018-12-31 09:42:16,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-31 09:42:16,684 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:42:16,685 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:42:16,688 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:42:16,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:42:16,695 INFO L82 PathProgramCache]: Analyzing trace with hash -732978716, now seen corresponding path program 1 times [2018-12-31 09:42:16,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:42:16,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:42:16,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:16,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:42:16,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:16,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:42:16,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:42:16,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:42:16,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 09:42:16,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 09:42:17,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 09:42:17,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 09:42:17,013 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 2 states. [2018-12-31 09:42:17,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:42:17,044 INFO L93 Difference]: Finished difference Result 179 states and 270 transitions. [2018-12-31 09:42:17,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 09:42:17,046 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-12-31 09:42:17,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:42:17,058 INFO L225 Difference]: With dead ends: 179 [2018-12-31 09:42:17,059 INFO L226 Difference]: Without dead ends: 89 [2018-12-31 09:42:17,063 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 [2018-12-31 09:42:17,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-31 09:42:17,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-12-31 09:42:17,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-31 09:42:17,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 127 transitions. [2018-12-31 09:42:17,112 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 127 transitions. Word has length 18 [2018-12-31 09:42:17,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:42:17,113 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 127 transitions. [2018-12-31 09:42:17,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 09:42:17,113 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 127 transitions. [2018-12-31 09:42:17,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-31 09:42:17,114 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:42:17,115 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:42:17,115 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:42:17,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:42:17,115 INFO L82 PathProgramCache]: Analyzing trace with hash -951814685, now seen corresponding path program 1 times [2018-12-31 09:42:17,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:42:17,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:42:17,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:17,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:42:17,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:17,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:42:17,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:42:17,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:42:17,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 09:42:17,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:42:17,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:42:17,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:42:17,290 INFO L87 Difference]: Start difference. First operand 89 states and 127 transitions. Second operand 3 states. [2018-12-31 09:42:17,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:42:17,331 INFO L93 Difference]: Finished difference Result 89 states and 127 transitions. [2018-12-31 09:42:17,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:42:17,332 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-12-31 09:42:17,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:42:17,333 INFO L225 Difference]: With dead ends: 89 [2018-12-31 09:42:17,333 INFO L226 Difference]: Without dead ends: 41 [2018-12-31 09:42:17,334 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 [2018-12-31 09:42:17,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-31 09:42:17,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-31 09:42:17,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-31 09:42:17,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 58 transitions. [2018-12-31 09:42:17,344 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 58 transitions. Word has length 19 [2018-12-31 09:42:17,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:42:17,347 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 58 transitions. [2018-12-31 09:42:17,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:42:17,347 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 58 transitions. [2018-12-31 09:42:17,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-31 09:42:17,349 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:42:17,349 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] [2018-12-31 09:42:17,349 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:42:17,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:42:17,350 INFO L82 PathProgramCache]: Analyzing trace with hash -2025304256, now seen corresponding path program 1 times [2018-12-31 09:42:17,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:42:17,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:42:17,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:17,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:42:17,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:17,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:42:17,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:42:17,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:42:17,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 09:42:17,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:42:17,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:42:17,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:42:17,463 INFO L87 Difference]: Start difference. First operand 41 states and 58 transitions. Second operand 3 states. [2018-12-31 09:42:17,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:42:17,541 INFO L93 Difference]: Finished difference Result 109 states and 160 transitions. [2018-12-31 09:42:17,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:42:17,542 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-31 09:42:17,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:42:17,543 INFO L225 Difference]: With dead ends: 109 [2018-12-31 09:42:17,543 INFO L226 Difference]: Without dead ends: 75 [2018-12-31 09:42:17,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:42:17,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-31 09:42:17,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 71. [2018-12-31 09:42:17,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-31 09:42:17,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 104 transitions. [2018-12-31 09:42:17,555 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 104 transitions. Word has length 24 [2018-12-31 09:42:17,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:42:17,556 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 104 transitions. [2018-12-31 09:42:17,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:42:17,556 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 104 transitions. [2018-12-31 09:42:17,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-31 09:42:17,557 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:42:17,558 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] [2018-12-31 09:42:17,558 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:42:17,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:42:17,558 INFO L82 PathProgramCache]: Analyzing trace with hash 193545241, now seen corresponding path program 1 times [2018-12-31 09:42:17,559 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:42:17,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:42:17,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:17,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:42:17,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:17,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:42:17,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:42:17,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:42:17,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 09:42:17,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:42:17,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:42:17,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:42:17,668 INFO L87 Difference]: Start difference. First operand 71 states and 104 transitions. Second operand 3 states. [2018-12-31 09:42:17,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:42:17,734 INFO L93 Difference]: Finished difference Result 178 states and 267 transitions. [2018-12-31 09:42:17,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:42:17,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-31 09:42:17,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:42:17,736 INFO L225 Difference]: With dead ends: 178 [2018-12-31 09:42:17,737 INFO L226 Difference]: Without dead ends: 114 [2018-12-31 09:42:17,737 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 [2018-12-31 09:42:17,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-12-31 09:42:17,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2018-12-31 09:42:17,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-31 09:42:17,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 164 transitions. [2018-12-31 09:42:17,754 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 164 transitions. Word has length 25 [2018-12-31 09:42:17,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:42:17,754 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 164 transitions. [2018-12-31 09:42:17,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:42:17,754 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 164 transitions. [2018-12-31 09:42:17,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-31 09:42:17,756 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:42:17,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, 1, 1, 1] [2018-12-31 09:42:17,756 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:42:17,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:42:17,757 INFO L82 PathProgramCache]: Analyzing trace with hash 433385865, now seen corresponding path program 1 times [2018-12-31 09:42:17,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:42:17,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:42:17,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:17,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:42:17,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:17,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:42:17,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:42:17,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:42:17,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 09:42:17,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:42:17,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:42:17,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:42:17,904 INFO L87 Difference]: Start difference. First operand 112 states and 164 transitions. Second operand 5 states. [2018-12-31 09:42:18,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:42:18,151 INFO L93 Difference]: Finished difference Result 544 states and 809 transitions. [2018-12-31 09:42:18,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 09:42:18,152 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-12-31 09:42:18,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:42:18,159 INFO L225 Difference]: With dead ends: 544 [2018-12-31 09:42:18,159 INFO L226 Difference]: Without dead ends: 439 [2018-12-31 09:42:18,160 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 [2018-12-31 09:42:18,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2018-12-31 09:42:18,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 203. [2018-12-31 09:42:18,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-12-31 09:42:18,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 292 transitions. [2018-12-31 09:42:18,227 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 292 transitions. Word has length 27 [2018-12-31 09:42:18,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:42:18,227 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 292 transitions. [2018-12-31 09:42:18,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:42:18,228 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 292 transitions. [2018-12-31 09:42:18,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-31 09:42:18,230 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:42:18,230 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] [2018-12-31 09:42:18,231 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:42:18,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:42:18,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1000759295, now seen corresponding path program 1 times [2018-12-31 09:42:18,232 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:42:18,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:42:18,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:18,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:42:18,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:18,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:42:18,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:42:18,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:42:18,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 09:42:18,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:42:18,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:42:18,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:42:18,460 INFO L87 Difference]: Start difference. First operand 203 states and 292 transitions. Second operand 5 states. [2018-12-31 09:42:19,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:42:19,120 INFO L93 Difference]: Finished difference Result 769 states and 1111 transitions. [2018-12-31 09:42:19,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 09:42:19,121 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-12-31 09:42:19,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:42:19,125 INFO L225 Difference]: With dead ends: 769 [2018-12-31 09:42:19,125 INFO L226 Difference]: Without dead ends: 573 [2018-12-31 09:42:19,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-31 09:42:19,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2018-12-31 09:42:19,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 201. [2018-12-31 09:42:19,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-12-31 09:42:19,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 286 transitions. [2018-12-31 09:42:19,166 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 286 transitions. Word has length 28 [2018-12-31 09:42:19,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:42:19,167 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 286 transitions. [2018-12-31 09:42:19,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:42:19,167 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 286 transitions. [2018-12-31 09:42:19,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-31 09:42:19,176 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:42:19,176 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:42:19,177 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:42:19,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:42:19,177 INFO L82 PathProgramCache]: Analyzing trace with hash 341285158, now seen corresponding path program 1 times [2018-12-31 09:42:19,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:42:19,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:42:19,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:19,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:42:19,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:19,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:42:19,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:42:19,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:42:19,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 09:42:19,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:42:19,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:42:19,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:42:19,486 INFO L87 Difference]: Start difference. First operand 201 states and 286 transitions. Second operand 5 states. [2018-12-31 09:42:19,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:42:19,991 INFO L93 Difference]: Finished difference Result 555 states and 781 transitions. [2018-12-31 09:42:19,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 09:42:19,992 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-12-31 09:42:19,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:42:19,995 INFO L225 Difference]: With dead ends: 555 [2018-12-31 09:42:19,996 INFO L226 Difference]: Without dead ends: 361 [2018-12-31 09:42:19,997 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 [2018-12-31 09:42:19,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2018-12-31 09:42:20,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 213. [2018-12-31 09:42:20,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-12-31 09:42:20,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 298 transitions. [2018-12-31 09:42:20,039 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 298 transitions. Word has length 35 [2018-12-31 09:42:20,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:42:20,040 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 298 transitions. [2018-12-31 09:42:20,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:42:20,040 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 298 transitions. [2018-12-31 09:42:20,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-31 09:42:20,042 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:42:20,042 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] [2018-12-31 09:42:20,042 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:42:20,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:42:20,043 INFO L82 PathProgramCache]: Analyzing trace with hash -669832092, now seen corresponding path program 1 times [2018-12-31 09:42:20,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:42:20,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:42:20,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:20,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:42:20,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:20,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:42:20,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:42:20,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:42:20,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 09:42:20,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 09:42:20,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 09:42:20,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 09:42:20,219 INFO L87 Difference]: Start difference. First operand 213 states and 298 transitions. Second operand 4 states. [2018-12-31 09:42:20,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:42:20,483 INFO L93 Difference]: Finished difference Result 515 states and 715 transitions. [2018-12-31 09:42:20,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 09:42:20,484 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-12-31 09:42:20,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:42:20,488 INFO L225 Difference]: With dead ends: 515 [2018-12-31 09:42:20,488 INFO L226 Difference]: Without dead ends: 309 [2018-12-31 09:42:20,489 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 [2018-12-31 09:42:20,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-12-31 09:42:20,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 221. [2018-12-31 09:42:20,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-12-31 09:42:20,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 306 transitions. [2018-12-31 09:42:20,522 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 306 transitions. Word has length 35 [2018-12-31 09:42:20,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:42:20,522 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 306 transitions. [2018-12-31 09:42:20,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 09:42:20,522 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 306 transitions. [2018-12-31 09:42:20,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-31 09:42:20,523 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:42:20,523 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] [2018-12-31 09:42:20,524 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:42:20,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:42:20,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1690900446, now seen corresponding path program 1 times [2018-12-31 09:42:20,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:42:20,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:42:20,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:20,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:42:20,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:20,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:42:20,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:42:20,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:42:20,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 09:42:20,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:42:20,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:42:20,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:42:20,628 INFO L87 Difference]: Start difference. First operand 221 states and 306 transitions. Second operand 3 states. [2018-12-31 09:42:20,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:42:20,783 INFO L93 Difference]: Finished difference Result 535 states and 735 transitions. [2018-12-31 09:42:20,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:42:20,784 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-12-31 09:42:20,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:42:20,787 INFO L225 Difference]: With dead ends: 535 [2018-12-31 09:42:20,787 INFO L226 Difference]: Without dead ends: 321 [2018-12-31 09:42:20,788 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 [2018-12-31 09:42:20,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-12-31 09:42:20,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 321. [2018-12-31 09:42:20,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-12-31 09:42:20,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 428 transitions. [2018-12-31 09:42:20,837 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 428 transitions. Word has length 35 [2018-12-31 09:42:20,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:42:20,837 INFO L480 AbstractCegarLoop]: Abstraction has 321 states and 428 transitions. [2018-12-31 09:42:20,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:42:20,837 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 428 transitions. [2018-12-31 09:42:20,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-31 09:42:20,840 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:42:20,840 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] [2018-12-31 09:42:20,840 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:42:20,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:42:20,842 INFO L82 PathProgramCache]: Analyzing trace with hash -2015558942, now seen corresponding path program 1 times [2018-12-31 09:42:20,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:42:20,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:42:20,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:20,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:42:20,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:20,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:42:21,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:42:21,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:42:21,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 09:42:21,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 09:42:21,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 09:42:21,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-31 09:42:21,268 INFO L87 Difference]: Start difference. First operand 321 states and 428 transitions. Second operand 8 states. [2018-12-31 09:42:21,960 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-12-31 09:42:23,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:42:23,468 INFO L93 Difference]: Finished difference Result 1403 states and 1854 transitions. [2018-12-31 09:42:23,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-31 09:42:23,469 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2018-12-31 09:42:23,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:42:23,474 INFO L225 Difference]: With dead ends: 1403 [2018-12-31 09:42:23,474 INFO L226 Difference]: Without dead ends: 1089 [2018-12-31 09:42:23,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=159, Invalid=393, Unknown=0, NotChecked=0, Total=552 [2018-12-31 09:42:23,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2018-12-31 09:42:23,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 321. [2018-12-31 09:42:23,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-12-31 09:42:23,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 420 transitions. [2018-12-31 09:42:23,523 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 420 transitions. Word has length 36 [2018-12-31 09:42:23,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:42:23,523 INFO L480 AbstractCegarLoop]: Abstraction has 321 states and 420 transitions. [2018-12-31 09:42:23,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 09:42:23,523 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 420 transitions. [2018-12-31 09:42:23,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-31 09:42:23,525 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:42:23,525 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] [2018-12-31 09:42:23,525 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:42:23,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:42:23,526 INFO L82 PathProgramCache]: Analyzing trace with hash -59965040, now seen corresponding path program 1 times [2018-12-31 09:42:23,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:42:23,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:42:23,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:23,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:42:23,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:23,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:42:23,619 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:42:23,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:42:23,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 09:42:23,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:42:23,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:42:23,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:42:23,621 INFO L87 Difference]: Start difference. First operand 321 states and 420 transitions. Second operand 3 states. [2018-12-31 09:42:23,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:42:23,778 INFO L93 Difference]: Finished difference Result 471 states and 623 transitions. [2018-12-31 09:42:23,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:42:23,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2018-12-31 09:42:23,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:42:23,781 INFO L225 Difference]: With dead ends: 471 [2018-12-31 09:42:23,781 INFO L226 Difference]: Without dead ends: 469 [2018-12-31 09:42:23,782 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 [2018-12-31 09:42:23,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2018-12-31 09:42:23,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 361. [2018-12-31 09:42:23,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-12-31 09:42:23,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 481 transitions. [2018-12-31 09:42:23,835 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 481 transitions. Word has length 51 [2018-12-31 09:42:23,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:42:23,835 INFO L480 AbstractCegarLoop]: Abstraction has 361 states and 481 transitions. [2018-12-31 09:42:23,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:42:23,835 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 481 transitions. [2018-12-31 09:42:23,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-31 09:42:23,837 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:42:23,837 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] [2018-12-31 09:42:23,837 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:42:23,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:42:23,837 INFO L82 PathProgramCache]: Analyzing trace with hash -376855367, now seen corresponding path program 1 times [2018-12-31 09:42:23,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:42:23,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:42:23,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:23,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:42:23,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:42:24,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 09:42:24,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 09:42:24,688 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 09:42:24,872 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 09:42:24 BoogieIcfgContainer [2018-12-31 09:42:24,872 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 09:42:24,872 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 09:42:24,872 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 09:42:24,873 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 09:42:24,873 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:42:16" (3/4) ... [2018-12-31 09:42:24,876 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 09:42:25,034 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 09:42:25,034 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 09:42:25,035 INFO L168 Benchmark]: Toolchain (without parser) took 10816.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 206.0 MB). Free memory was 947.3 MB in the beginning and 833.6 MB in the end (delta: 113.8 MB). Peak memory consumption was 319.8 MB. Max. memory is 11.5 GB. [2018-12-31 09:42:25,036 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 09:42:25,036 INFO L168 Benchmark]: CACSL2BoogieTranslator took 619.41 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 920.5 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2018-12-31 09:42:25,036 INFO L168 Benchmark]: Boogie Procedure Inliner took 168.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 920.5 MB in the beginning and 1.1 GB in the end (delta: -204.3 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. [2018-12-31 09:42:25,037 INFO L168 Benchmark]: Boogie Preprocessor took 56.36 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 09:42:25,037 INFO L168 Benchmark]: RCFGBuilder took 1513.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 57.9 MB). Peak memory consumption was 57.9 MB. Max. memory is 11.5 GB. [2018-12-31 09:42:25,038 INFO L168 Benchmark]: TraceAbstraction took 8291.28 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 69.2 MB). Free memory was 1.1 GB in the beginning and 864.5 MB in the end (delta: 202.5 MB). Peak memory consumption was 271.7 MB. Max. memory is 11.5 GB. [2018-12-31 09:42:25,038 INFO L168 Benchmark]: Witness Printer took 161.72 ms. Allocated memory is still 1.2 GB. Free memory was 864.5 MB in the beginning and 833.6 MB in the end (delta: 30.9 MB). Peak memory consumption was 30.9 MB. Max. memory is 11.5 GB. [2018-12-31 09:42:25,040 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 619.41 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 920.5 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 168.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 920.5 MB in the beginning and 1.1 GB in the end (delta: -204.3 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 56.36 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1513.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 57.9 MB). Peak memory consumption was 57.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8291.28 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 69.2 MB). Free memory was 1.1 GB in the beginning and 864.5 MB in the end (delta: 202.5 MB). Peak memory consumption was 271.7 MB. Max. memory is 11.5 GB. * Witness Printer took 161.72 ms. Allocated memory is still 1.2 GB. Free memory was 864.5 MB in the beginning and 833.6 MB in the end (delta: 30.9 MB). Peak memory consumption was 30.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 44]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L132] int pumpRunning = 0; [L133] int systemActive = 1; [L364] int cleanupTimeShifts = 4; [L462] int methAndRunningLastTime ; [L502] int waterLevel = 1; [L503] int methaneLevelCritical = 0; [L765] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L439] int retValue_acc ; [L440] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L355] int retValue_acc ; [L358] retValue_acc = 1 [L359] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L446] tmp = valid_product() [L448] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L467] methAndRunningLastTime = 0 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L56] int splverifierCounter ; [L57] int tmp ; [L58] int tmp___0 ; [L59] int tmp___1 ; [L60] int tmp___2 ; [L63] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L65] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L67] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L73] tmp = __VERIFIER_nondet_int() [L75] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L520] COND TRUE waterLevel < 2 [L521] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L83] tmp___0 = __VERIFIER_nondet_int() [L85] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L93] tmp___2 = __VERIFIER_nondet_int() [L95] COND TRUE \read(tmp___2) [L321] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L140] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L147] COND TRUE \read(systemActive) [L169] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L172] COND TRUE ! pumpRunning [L284] int retValue_acc ; [L285] int tmp ; [L286] int tmp___0 ; [L582] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L585] COND FALSE !(waterLevel < 2) [L589] retValue_acc = 0 [L590] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L290] tmp = isHighWaterSensorDry() [L292] COND FALSE !(\read(tmp)) [L295] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L297] retValue_acc = tmp___0 [L298] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L174] tmp = isHighWaterLevel() [L176] COND TRUE \read(tmp) [L203] int tmp ; [L228] int retValue_acc ; [L541] int retValue_acc ; [L544] retValue_acc = methaneLevelCritical [L545] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L232] retValue_acc = isMethaneLevelCritical() [L234] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L207] tmp = isMethaneAlarm() [L209] COND FALSE !(\read(tmp)) [L197] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L472] int tmp ; [L473] int tmp___0 ; [L541] int retValue_acc ; [L544] retValue_acc = methaneLevelCritical [L545] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L477] tmp = isMethaneLevelCritical() [L479] COND FALSE !(\read(tmp)) [L495] methAndRunningLastTime = 0 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L65] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L67] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L73] tmp = __VERIFIER_nondet_int() [L75] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L83] tmp___0 = __VERIFIER_nondet_int() [L85] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L532] COND FALSE !(\read(methaneLevelCritical)) [L535] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L93] tmp___2 = __VERIFIER_nondet_int() [L95] COND TRUE \read(tmp___2) [L321] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L140] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L508] COND TRUE waterLevel > 0 [L509] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L147] COND TRUE \read(systemActive) [L169] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L172] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L472] int tmp ; [L473] int tmp___0 ; [L541] int retValue_acc ; [L544] retValue_acc = methaneLevelCritical [L545] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L477] tmp = isMethaneLevelCritical() [L479] COND TRUE \read(tmp) [L239] int retValue_acc ; [L242] retValue_acc = pumpRunning [L243] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L481] tmp___0 = isPumpRunning() [L483] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L484] COND FALSE !(\read(methAndRunningLastTime)) [L489] methAndRunningLastTime = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L65] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L67] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L73] tmp = __VERIFIER_nondet_int() [L75] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L83] tmp___0 = __VERIFIER_nondet_int() [L85] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L93] tmp___2 = __VERIFIER_nondet_int() [L95] COND TRUE \read(tmp___2) [L321] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L140] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L508] COND TRUE waterLevel > 0 [L509] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L147] COND TRUE \read(systemActive) [L169] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L172] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L472] int tmp ; [L473] int tmp___0 ; [L541] int retValue_acc ; [L544] retValue_acc = methaneLevelCritical [L545] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L477] tmp = isMethaneLevelCritical() [L479] COND TRUE \read(tmp) [L239] int retValue_acc ; [L242] retValue_acc = pumpRunning [L243] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L481] tmp___0 = isPumpRunning() [L483] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L484] COND TRUE \read(methAndRunningLastTime) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L44] __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, 93 locations, 3 error locations. UNSAFE Result, 8.2s OverallTime, 12 OverallIterations, 3 TraceHistogramMax, 4.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 966 SDtfs, 1119 SDslu, 2015 SDs, 0 SdLazy, 277 SolverSat, 38 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=361occurred 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, 1726 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 402 NumberOfCodeBlocks, 402 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 322 ConstructedInterpolants, 0 QuantifiedInterpolants, 18652 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...