./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec2_product44.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/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 ../sv-benchmarks/c/product-lines/minepump_spec2_product44.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.25-f470102 [2019-11-28 17:25:12,105 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 17:25:12,109 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 17:25:12,130 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 17:25:12,130 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 17:25:12,133 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 17:25:12,135 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 17:25:12,147 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 17:25:12,152 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 17:25:12,155 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 17:25:12,157 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 17:25:12,160 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 17:25:12,160 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 17:25:12,165 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 17:25:12,167 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 17:25:12,169 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 17:25:12,170 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 17:25:12,172 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 17:25:12,175 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 17:25:12,180 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 17:25:12,184 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 17:25:12,189 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 17:25:12,190 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 17:25:12,192 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 17:25:12,195 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 17:25:12,196 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 17:25:12,196 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 17:25:12,198 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 17:25:12,198 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 17:25:12,199 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 17:25:12,200 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 17:25:12,202 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 17:25:12,203 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 17:25:12,204 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 17:25:12,206 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 17:25:12,206 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 17:25:12,207 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 17:25:12,207 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 17:25:12,208 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 17:25:12,209 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 17:25:12,210 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 17:25:12,211 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 17:25:12,244 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 17:25:12,248 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 17:25:12,249 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 17:25:12,250 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 17:25:12,250 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 17:25:12,253 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 17:25:12,253 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 17:25:12,253 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 17:25:12,254 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 17:25:12,254 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 17:25:12,254 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 17:25:12,255 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 17:25:12,255 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 17:25:12,255 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 17:25:12,255 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 17:25:12,257 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 17:25:12,258 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 17:25:12,258 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 17:25:12,259 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 17:25:12,259 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 17:25:12,259 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 17:25:12,259 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 17:25:12,260 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 17:25:12,260 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 17:25:12,261 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 17:25:12,261 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 17:25:12,261 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 17:25:12,262 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 17:25:12,262 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 17:25:12,262 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 [2019-11-28 17:25:12,583 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 17:25:12,597 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 17:25:12,601 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 17:25:12,603 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 17:25:12,604 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 17:25:12,604 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec2_product44.cil.c [2019-11-28 17:25:12,669 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce50f5f7e/d4f01c86c1a04aa3900c6311f21aaf85/FLAGb2f57c816 [2019-11-28 17:25:13,154 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 17:25:13,155 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product44.cil.c [2019-11-28 17:25:13,172 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce50f5f7e/d4f01c86c1a04aa3900c6311f21aaf85/FLAGb2f57c816 [2019-11-28 17:25:13,507 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce50f5f7e/d4f01c86c1a04aa3900c6311f21aaf85 [2019-11-28 17:25:13,511 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 17:25:13,512 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 17:25:13,513 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 17:25:13,513 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 17:25:13,517 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 17:25:13,518 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:25:13" (1/1) ... [2019-11-28 17:25:13,521 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ce65fc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:25:13, skipping insertion in model container [2019-11-28 17:25:13,521 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:25:13" (1/1) ... [2019-11-28 17:25:13,533 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 17:25:13,590 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 17:25:14,046 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:25:14,058 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 17:25:14,130 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:25:14,166 INFO L208 MainTranslator]: Completed translation [2019-11-28 17:25:14,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:25:14 WrapperNode [2019-11-28 17:25:14,166 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 17:25:14,168 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 17:25:14,168 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 17:25:14,168 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 17:25:14,177 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:25:14" (1/1) ... [2019-11-28 17:25:14,196 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:25:14" (1/1) ... [2019-11-28 17:25:14,241 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 17:25:14,242 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 17:25:14,242 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 17:25:14,242 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 17:25:14,250 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:25:14" (1/1) ... [2019-11-28 17:25:14,250 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:25:14" (1/1) ... [2019-11-28 17:25:14,255 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:25:14" (1/1) ... [2019-11-28 17:25:14,255 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:25:14" (1/1) ... [2019-11-28 17:25:14,266 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:25:14" (1/1) ... [2019-11-28 17:25:14,274 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:25:14" (1/1) ... [2019-11-28 17:25:14,278 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:25:14" (1/1) ... [2019-11-28 17:25:14,283 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 17:25:14,284 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 17:25:14,284 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 17:25:14,284 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 17:25:14,285 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:25: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 [2019-11-28 17:25:14,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 17:25:14,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-28 17:25:14,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 17:25:14,361 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 17:25:15,139 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 17:25:15,139 INFO L287 CfgBuilder]: Removed 122 assume(true) statements. [2019-11-28 17:25:15,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:25:15 BoogieIcfgContainer [2019-11-28 17:25:15,141 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 17:25:15,142 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 17:25:15,142 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 17:25:15,146 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 17:25:15,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:25:13" (1/3) ... [2019-11-28 17:25:15,147 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@560e550c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:25:15, skipping insertion in model container [2019-11-28 17:25:15,148 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:25:14" (2/3) ... [2019-11-28 17:25:15,148 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@560e550c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:25:15, skipping insertion in model container [2019-11-28 17:25:15,148 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:25:15" (3/3) ... [2019-11-28 17:25:15,150 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec2_product44.cil.c [2019-11-28 17:25:15,161 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 17:25:15,169 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-28 17:25:15,183 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-28 17:25:15,212 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 17:25:15,212 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 17:25:15,213 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 17:25:15,213 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 17:25:15,217 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 17:25:15,217 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 17:25:15,217 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 17:25:15,218 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 17:25:15,243 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states. [2019-11-28 17:25:15,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 17:25:15,250 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:25:15,251 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:25:15,252 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:25:15,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:25:15,258 INFO L82 PathProgramCache]: Analyzing trace with hash -732978716, now seen corresponding path program 1 times [2019-11-28 17:25:15,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:25:15,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567135880] [2019-11-28 17:25:15,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:25:15,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:25:15,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:25:15,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567135880] [2019-11-28 17:25:15,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:25:15,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:25:15,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468593447] [2019-11-28 17:25:15,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 17:25:15,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:25:15,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 17:25:15,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 17:25:15,580 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 2 states. [2019-11-28 17:25:15,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:25:15,614 INFO L93 Difference]: Finished difference Result 179 states and 270 transitions. [2019-11-28 17:25:15,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 17:25:15,616 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2019-11-28 17:25:15,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:25:15,631 INFO L225 Difference]: With dead ends: 179 [2019-11-28 17:25:15,631 INFO L226 Difference]: Without dead ends: 89 [2019-11-28 17:25:15,635 INFO L630 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-11-28 17:25:15,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-28 17:25:15,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-11-28 17:25:15,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-28 17:25:15,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 127 transitions. [2019-11-28 17:25:15,731 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 127 transitions. Word has length 18 [2019-11-28 17:25:15,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:25:15,732 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 127 transitions. [2019-11-28 17:25:15,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 17:25:15,734 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 127 transitions. [2019-11-28 17:25:15,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 17:25:15,738 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:25:15,738 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:25:15,739 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:25:15,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:25:15,740 INFO L82 PathProgramCache]: Analyzing trace with hash -951814685, now seen corresponding path program 1 times [2019-11-28 17:25:15,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:25:15,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057998545] [2019-11-28 17:25:15,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:25:15,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:25:15,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:25:15,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057998545] [2019-11-28 17:25:15,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:25:15,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:25:15,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622066649] [2019-11-28 17:25:15,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:25:15,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:25:15,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:25:15,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:25:15,976 INFO L87 Difference]: Start difference. First operand 89 states and 127 transitions. Second operand 3 states. [2019-11-28 17:25:15,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:25:16,000 INFO L93 Difference]: Finished difference Result 89 states and 127 transitions. [2019-11-28 17:25:16,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:25:16,000 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-28 17:25:16,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:25:16,003 INFO L225 Difference]: With dead ends: 89 [2019-11-28 17:25:16,003 INFO L226 Difference]: Without dead ends: 41 [2019-11-28 17:25:16,005 INFO L630 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-11-28 17:25:16,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-28 17:25:16,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-11-28 17:25:16,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-28 17:25:16,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 58 transitions. [2019-11-28 17:25:16,022 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 58 transitions. Word has length 19 [2019-11-28 17:25:16,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:25:16,022 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 58 transitions. [2019-11-28 17:25:16,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:25:16,022 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 58 transitions. [2019-11-28 17:25:16,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 17:25:16,024 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:25:16,024 INFO L410 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-11-28 17:25:16,024 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:25:16,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:25:16,025 INFO L82 PathProgramCache]: Analyzing trace with hash -2025304256, now seen corresponding path program 1 times [2019-11-28 17:25:16,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:25:16,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280409398] [2019-11-28 17:25:16,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:25:16,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:25:16,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:25:16,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280409398] [2019-11-28 17:25:16,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:25:16,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:25:16,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204245668] [2019-11-28 17:25:16,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:25:16,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:25:16,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:25:16,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:25:16,150 INFO L87 Difference]: Start difference. First operand 41 states and 58 transitions. Second operand 3 states. [2019-11-28 17:25:16,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:25:16,189 INFO L93 Difference]: Finished difference Result 109 states and 160 transitions. [2019-11-28 17:25:16,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:25:16,190 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-28 17:25:16,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:25:16,192 INFO L225 Difference]: With dead ends: 109 [2019-11-28 17:25:16,192 INFO L226 Difference]: Without dead ends: 75 [2019-11-28 17:25:16,193 INFO L630 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-11-28 17:25:16,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-11-28 17:25:16,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 71. [2019-11-28 17:25:16,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-28 17:25:16,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 104 transitions. [2019-11-28 17:25:16,203 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 104 transitions. Word has length 24 [2019-11-28 17:25:16,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:25:16,204 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 104 transitions. [2019-11-28 17:25:16,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:25:16,205 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 104 transitions. [2019-11-28 17:25:16,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 17:25:16,206 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:25:16,206 INFO L410 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-11-28 17:25:16,207 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:25:16,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:25:16,207 INFO L82 PathProgramCache]: Analyzing trace with hash 193545241, now seen corresponding path program 1 times [2019-11-28 17:25:16,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:25:16,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37632645] [2019-11-28 17:25:16,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:25:16,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:25:16,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:25:16,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37632645] [2019-11-28 17:25:16,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:25:16,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:25:16,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434361787] [2019-11-28 17:25:16,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:25:16,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:25:16,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:25:16,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:25:16,277 INFO L87 Difference]: Start difference. First operand 71 states and 104 transitions. Second operand 3 states. [2019-11-28 17:25:16,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:25:16,332 INFO L93 Difference]: Finished difference Result 178 states and 267 transitions. [2019-11-28 17:25:16,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:25:16,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-28 17:25:16,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:25:16,335 INFO L225 Difference]: With dead ends: 178 [2019-11-28 17:25:16,335 INFO L226 Difference]: Without dead ends: 114 [2019-11-28 17:25:16,336 INFO L630 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-11-28 17:25:16,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-28 17:25:16,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2019-11-28 17:25:16,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-11-28 17:25:16,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 164 transitions. [2019-11-28 17:25:16,365 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 164 transitions. Word has length 25 [2019-11-28 17:25:16,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:25:16,366 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 164 transitions. [2019-11-28 17:25:16,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:25:16,368 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 164 transitions. [2019-11-28 17:25:16,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 17:25:16,371 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:25:16,371 INFO L410 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] [2019-11-28 17:25:16,372 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:25:16,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:25:16,373 INFO L82 PathProgramCache]: Analyzing trace with hash 433385865, now seen corresponding path program 1 times [2019-11-28 17:25:16,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:25:16,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311735993] [2019-11-28 17:25:16,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:25:16,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:25:16,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:25:16,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311735993] [2019-11-28 17:25:16,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:25:16,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 17:25:16,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614286377] [2019-11-28 17:25:16,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:25:16,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:25:16,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:25:16,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:25:16,474 INFO L87 Difference]: Start difference. First operand 112 states and 164 transitions. Second operand 5 states. [2019-11-28 17:25:16,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:25:16,608 INFO L93 Difference]: Finished difference Result 544 states and 809 transitions. [2019-11-28 17:25:16,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 17:25:16,609 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-11-28 17:25:16,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:25:16,612 INFO L225 Difference]: With dead ends: 544 [2019-11-28 17:25:16,613 INFO L226 Difference]: Without dead ends: 439 [2019-11-28 17:25:16,614 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-28 17:25:16,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2019-11-28 17:25:16,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 203. [2019-11-28 17:25:16,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-11-28 17:25:16,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 292 transitions. [2019-11-28 17:25:16,639 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 292 transitions. Word has length 27 [2019-11-28 17:25:16,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:25:16,639 INFO L462 AbstractCegarLoop]: Abstraction has 203 states and 292 transitions. [2019-11-28 17:25:16,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:25:16,640 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 292 transitions. [2019-11-28 17:25:16,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 17:25:16,641 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:25:16,641 INFO L410 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] [2019-11-28 17:25:16,642 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:25:16,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:25:16,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1000759295, now seen corresponding path program 1 times [2019-11-28 17:25:16,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:25:16,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580327827] [2019-11-28 17:25:16,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:25:16,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:25:16,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:25:16,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580327827] [2019-11-28 17:25:16,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:25:16,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 17:25:16,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175928184] [2019-11-28 17:25:16,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:25:16,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:25:16,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:25:16,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:25:16,717 INFO L87 Difference]: Start difference. First operand 203 states and 292 transitions. Second operand 5 states. [2019-11-28 17:25:16,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:25:16,852 INFO L93 Difference]: Finished difference Result 769 states and 1111 transitions. [2019-11-28 17:25:16,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 17:25:16,853 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-11-28 17:25:16,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:25:16,856 INFO L225 Difference]: With dead ends: 769 [2019-11-28 17:25:16,856 INFO L226 Difference]: Without dead ends: 573 [2019-11-28 17:25:16,857 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-28 17:25:16,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2019-11-28 17:25:16,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 201. [2019-11-28 17:25:16,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-11-28 17:25:16,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 286 transitions. [2019-11-28 17:25:16,878 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 286 transitions. Word has length 28 [2019-11-28 17:25:16,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:25:16,879 INFO L462 AbstractCegarLoop]: Abstraction has 201 states and 286 transitions. [2019-11-28 17:25:16,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:25:16,879 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 286 transitions. [2019-11-28 17:25:16,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-28 17:25:16,881 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:25:16,881 INFO L410 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-11-28 17:25:16,881 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:25:16,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:25:16,882 INFO L82 PathProgramCache]: Analyzing trace with hash 341285158, now seen corresponding path program 1 times [2019-11-28 17:25:16,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:25:16,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224240754] [2019-11-28 17:25:16,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:25:16,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:25:16,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:25:16,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224240754] [2019-11-28 17:25:16,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:25:16,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 17:25:16,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989920067] [2019-11-28 17:25:16,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:25:16,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:25:16,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:25:16,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:25:16,939 INFO L87 Difference]: Start difference. First operand 201 states and 286 transitions. Second operand 5 states. [2019-11-28 17:25:17,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:25:17,008 INFO L93 Difference]: Finished difference Result 555 states and 781 transitions. [2019-11-28 17:25:17,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 17:25:17,009 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-11-28 17:25:17,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:25:17,011 INFO L225 Difference]: With dead ends: 555 [2019-11-28 17:25:17,011 INFO L226 Difference]: Without dead ends: 361 [2019-11-28 17:25:17,012 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 17:25:17,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2019-11-28 17:25:17,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 213. [2019-11-28 17:25:17,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-11-28 17:25:17,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 298 transitions. [2019-11-28 17:25:17,031 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 298 transitions. Word has length 35 [2019-11-28 17:25:17,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:25:17,032 INFO L462 AbstractCegarLoop]: Abstraction has 213 states and 298 transitions. [2019-11-28 17:25:17,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:25:17,032 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 298 transitions. [2019-11-28 17:25:17,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-28 17:25:17,033 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:25:17,033 INFO L410 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-11-28 17:25:17,034 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:25:17,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:25:17,034 INFO L82 PathProgramCache]: Analyzing trace with hash -669832092, now seen corresponding path program 1 times [2019-11-28 17:25:17,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:25:17,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241817775] [2019-11-28 17:25:17,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:25:17,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:25:17,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:25:17,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241817775] [2019-11-28 17:25:17,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:25:17,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 17:25:17,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30532089] [2019-11-28 17:25:17,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 17:25:17,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:25:17,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 17:25:17,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 17:25:17,089 INFO L87 Difference]: Start difference. First operand 213 states and 298 transitions. Second operand 4 states. [2019-11-28 17:25:17,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:25:17,137 INFO L93 Difference]: Finished difference Result 515 states and 715 transitions. [2019-11-28 17:25:17,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 17:25:17,138 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-11-28 17:25:17,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:25:17,140 INFO L225 Difference]: With dead ends: 515 [2019-11-28 17:25:17,140 INFO L226 Difference]: Without dead ends: 309 [2019-11-28 17:25:17,141 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:25:17,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-11-28 17:25:17,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 221. [2019-11-28 17:25:17,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-11-28 17:25:17,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 306 transitions. [2019-11-28 17:25:17,158 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 306 transitions. Word has length 35 [2019-11-28 17:25:17,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:25:17,159 INFO L462 AbstractCegarLoop]: Abstraction has 221 states and 306 transitions. [2019-11-28 17:25:17,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 17:25:17,159 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 306 transitions. [2019-11-28 17:25:17,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-28 17:25:17,160 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:25:17,160 INFO L410 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-11-28 17:25:17,160 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:25:17,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:25:17,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1690900446, now seen corresponding path program 1 times [2019-11-28 17:25:17,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:25:17,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628450487] [2019-11-28 17:25:17,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:25:17,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:25:17,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:25:17,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628450487] [2019-11-28 17:25:17,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:25:17,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:25:17,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170056311] [2019-11-28 17:25:17,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:25:17,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:25:17,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:25:17,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:25:17,205 INFO L87 Difference]: Start difference. First operand 221 states and 306 transitions. Second operand 3 states. [2019-11-28 17:25:17,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:25:17,249 INFO L93 Difference]: Finished difference Result 535 states and 735 transitions. [2019-11-28 17:25:17,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:25:17,249 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-11-28 17:25:17,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:25:17,251 INFO L225 Difference]: With dead ends: 535 [2019-11-28 17:25:17,252 INFO L226 Difference]: Without dead ends: 321 [2019-11-28 17:25:17,253 INFO L630 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-11-28 17:25:17,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-11-28 17:25:17,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 321. [2019-11-28 17:25:17,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-11-28 17:25:17,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 428 transitions. [2019-11-28 17:25:17,283 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 428 transitions. Word has length 35 [2019-11-28 17:25:17,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:25:17,284 INFO L462 AbstractCegarLoop]: Abstraction has 321 states and 428 transitions. [2019-11-28 17:25:17,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:25:17,284 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 428 transitions. [2019-11-28 17:25:17,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-28 17:25:17,285 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:25:17,285 INFO L410 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-11-28 17:25:17,286 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:25:17,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:25:17,286 INFO L82 PathProgramCache]: Analyzing trace with hash -2015558942, now seen corresponding path program 1 times [2019-11-28 17:25:17,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:25:17,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42564374] [2019-11-28 17:25:17,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:25:17,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:25:17,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:25:17,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42564374] [2019-11-28 17:25:17,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:25:17,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 17:25:17,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448293915] [2019-11-28 17:25:17,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 17:25:17,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:25:17,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 17:25:17,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-28 17:25:17,375 INFO L87 Difference]: Start difference. First operand 321 states and 428 transitions. Second operand 8 states. [2019-11-28 17:25:18,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:25:18,050 INFO L93 Difference]: Finished difference Result 1403 states and 1854 transitions. [2019-11-28 17:25:18,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-28 17:25:18,051 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2019-11-28 17:25:18,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:25:18,057 INFO L225 Difference]: With dead ends: 1403 [2019-11-28 17:25:18,057 INFO L226 Difference]: Without dead ends: 1089 [2019-11-28 17:25:18,059 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=159, Invalid=393, Unknown=0, NotChecked=0, Total=552 [2019-11-28 17:25:18,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2019-11-28 17:25:18,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 321. [2019-11-28 17:25:18,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-11-28 17:25:18,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 420 transitions. [2019-11-28 17:25:18,100 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 420 transitions. Word has length 36 [2019-11-28 17:25:18,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:25:18,100 INFO L462 AbstractCegarLoop]: Abstraction has 321 states and 420 transitions. [2019-11-28 17:25:18,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 17:25:18,101 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 420 transitions. [2019-11-28 17:25:18,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-28 17:25:18,102 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:25:18,105 INFO L410 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-11-28 17:25:18,105 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:25:18,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:25:18,106 INFO L82 PathProgramCache]: Analyzing trace with hash -59965040, now seen corresponding path program 1 times [2019-11-28 17:25:18,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:25:18,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023284117] [2019-11-28 17:25:18,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:25:18,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:25:18,168 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:25:18,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023284117] [2019-11-28 17:25:18,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:25:18,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:25:18,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125194714] [2019-11-28 17:25:18,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:25:18,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:25:18,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:25:18,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:25:18,173 INFO L87 Difference]: Start difference. First operand 321 states and 420 transitions. Second operand 3 states. [2019-11-28 17:25:18,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:25:18,234 INFO L93 Difference]: Finished difference Result 471 states and 623 transitions. [2019-11-28 17:25:18,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:25:18,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-11-28 17:25:18,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:25:18,238 INFO L225 Difference]: With dead ends: 471 [2019-11-28 17:25:18,239 INFO L226 Difference]: Without dead ends: 469 [2019-11-28 17:25:18,239 INFO L630 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-11-28 17:25:18,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2019-11-28 17:25:18,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 361. [2019-11-28 17:25:18,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-11-28 17:25:18,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 481 transitions. [2019-11-28 17:25:18,283 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 481 transitions. Word has length 51 [2019-11-28 17:25:18,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:25:18,283 INFO L462 AbstractCegarLoop]: Abstraction has 361 states and 481 transitions. [2019-11-28 17:25:18,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:25:18,283 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 481 transitions. [2019-11-28 17:25:18,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-28 17:25:18,285 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:25:18,285 INFO L410 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-11-28 17:25:18,285 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:25:18,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:25:18,286 INFO L82 PathProgramCache]: Analyzing trace with hash -376855367, now seen corresponding path program 1 times [2019-11-28 17:25:18,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:25:18,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54157322] [2019-11-28 17:25:18,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:25:18,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 17:25:18,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 17:25:18,523 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 17:25:18,523 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 17:25:18,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 05:25:18 BoogieIcfgContainer [2019-11-28 17:25:18,689 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 17:25:18,690 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 17:25:18,690 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 17:25:18,691 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 17:25:18,691 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:25:15" (3/4) ... [2019-11-28 17:25:18,694 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 17:25:18,894 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 17:25:18,894 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 17:25:18,897 INFO L168 Benchmark]: Toolchain (without parser) took 5383.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 213.9 MB). Free memory was 961.7 MB in the beginning and 984.2 MB in the end (delta: -22.4 MB). Peak memory consumption was 191.5 MB. Max. memory is 11.5 GB. [2019-11-28 17:25:18,897 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:25:18,898 INFO L168 Benchmark]: CACSL2BoogieTranslator took 653.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -153.5 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. [2019-11-28 17:25:18,898 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 17:25:18,898 INFO L168 Benchmark]: Boogie Preprocessor took 41.58 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:25:18,899 INFO L168 Benchmark]: RCFGBuilder took 857.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 59.1 MB). Peak memory consumption was 59.1 MB. Max. memory is 11.5 GB. [2019-11-28 17:25:18,899 INFO L168 Benchmark]: TraceAbstraction took 3547.33 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 80.2 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 33.7 MB). Peak memory consumption was 113.9 MB. Max. memory is 11.5 GB. [2019-11-28 17:25:18,900 INFO L168 Benchmark]: Witness Printer took 204.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 984.2 MB in the end (delta: 31.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. [2019-11-28 17:25:18,902 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 653.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -153.5 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 74.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.58 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 857.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 59.1 MB). Peak memory consumption was 59.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3547.33 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 80.2 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 33.7 MB). Peak memory consumption was 113.9 MB. Max. memory is 11.5 GB. * Witness Printer took 204.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 984.2 MB in the end (delta: 31.5 MB). Peak memory consumption was 31.5 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; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [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. Result: UNSAFE, OverallTime: 3.3s, OverallIterations: 12, TraceHistogramMax: 3, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 966 SDtfs, 1119 SDslu, 2015 SDs, 0 SdLazy, 277 SolverSat, 38 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.4s 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 DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 1726 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.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, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...