./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec2_product43.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_product43.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 d3ef47dc64404f2fae365adb4fa9379fd10f9c50 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:11,143 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 17:25:11,146 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 17:25:11,165 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 17:25:11,165 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 17:25:11,168 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 17:25:11,170 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 17:25:11,183 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 17:25:11,185 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 17:25:11,186 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 17:25:11,188 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 17:25:11,190 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 17:25:11,190 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 17:25:11,195 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 17:25:11,196 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 17:25:11,198 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 17:25:11,200 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 17:25:11,202 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 17:25:11,205 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 17:25:11,212 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 17:25:11,216 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 17:25:11,220 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 17:25:11,221 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 17:25:11,221 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 17:25:11,225 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 17:25:11,226 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 17:25:11,226 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 17:25:11,228 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 17:25:11,229 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 17:25:11,230 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 17:25:11,231 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 17:25:11,231 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 17:25:11,232 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 17:25:11,234 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 17:25:11,235 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 17:25:11,236 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 17:25:11,237 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 17:25:11,237 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 17:25:11,238 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 17:25:11,240 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 17:25:11,242 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 17:25:11,243 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:11,260 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 17:25:11,261 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 17:25:11,262 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 17:25:11,263 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 17:25:11,263 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 17:25:11,263 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 17:25:11,264 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 17:25:11,264 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 17:25:11,264 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 17:25:11,264 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 17:25:11,265 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 17:25:11,265 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 17:25:11,265 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 17:25:11,266 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 17:25:11,266 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 17:25:11,266 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 17:25:11,267 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 17:25:11,267 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 17:25:11,267 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 17:25:11,267 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 17:25:11,268 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 17:25:11,268 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 17:25:11,268 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 17:25:11,269 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 17:25:11,269 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 17:25:11,269 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 17:25:11,269 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 17:25:11,270 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 17:25:11,270 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 17:25:11,270 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 -> d3ef47dc64404f2fae365adb4fa9379fd10f9c50 [2019-11-28 17:25:11,568 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 17:25:11,582 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 17:25:11,585 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 17:25:11,587 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 17:25:11,588 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 17:25:11,589 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec2_product43.cil.c [2019-11-28 17:25:11,649 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d10c6f161/3dd9210e194b46eda8c62d545e16bdf2/FLAGb4f914ea7 [2019-11-28 17:25:12,137 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 17:25:12,137 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product43.cil.c [2019-11-28 17:25:12,166 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d10c6f161/3dd9210e194b46eda8c62d545e16bdf2/FLAGb4f914ea7 [2019-11-28 17:25:12,488 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d10c6f161/3dd9210e194b46eda8c62d545e16bdf2 [2019-11-28 17:25:12,492 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 17:25:12,494 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 17:25:12,498 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 17:25:12,498 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 17:25:12,502 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 17:25:12,503 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:25:12" (1/1) ... [2019-11-28 17:25:12,506 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cce8044 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:25:12, skipping insertion in model container [2019-11-28 17:25:12,506 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:25:12" (1/1) ... [2019-11-28 17:25:12,515 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 17:25:12,578 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 17:25:13,051 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:25:13,066 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 17:25:13,145 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:25:13,191 INFO L208 MainTranslator]: Completed translation [2019-11-28 17:25:13,192 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:25:13 WrapperNode [2019-11-28 17:25:13,192 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 17:25:13,193 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 17:25:13,193 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 17:25:13,194 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 17:25:13,202 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:13" (1/1) ... [2019-11-28 17:25:13,224 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:13" (1/1) ... [2019-11-28 17:25:13,267 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 17:25:13,267 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 17:25:13,268 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 17:25:13,268 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 17:25:13,278 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:13" (1/1) ... [2019-11-28 17:25:13,278 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:13" (1/1) ... [2019-11-28 17:25:13,283 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:13" (1/1) ... [2019-11-28 17:25:13,283 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:13" (1/1) ... [2019-11-28 17:25:13,294 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:13" (1/1) ... [2019-11-28 17:25:13,303 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:13" (1/1) ... [2019-11-28 17:25:13,306 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:13" (1/1) ... [2019-11-28 17:25:13,322 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 17:25:13,324 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 17:25:13,324 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 17:25:13,324 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 17:25:13,325 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:25:13" (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:13,412 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 17:25:13,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-28 17:25:13,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 17:25:13,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 17:25:14,249 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 17:25:14,250 INFO L287 CfgBuilder]: Removed 120 assume(true) statements. [2019-11-28 17:25:14,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:25:14 BoogieIcfgContainer [2019-11-28 17:25:14,251 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 17:25:14,253 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 17:25:14,253 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 17:25:14,256 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 17:25:14,256 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:25:12" (1/3) ... [2019-11-28 17:25:14,257 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@351fd08e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:25:14, skipping insertion in model container [2019-11-28 17:25:14,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:25:13" (2/3) ... [2019-11-28 17:25:14,258 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@351fd08e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:25:14, skipping insertion in model container [2019-11-28 17:25:14,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:25:14" (3/3) ... [2019-11-28 17:25:14,260 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec2_product43.cil.c [2019-11-28 17:25:14,271 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 17:25:14,279 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-28 17:25:14,292 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-28 17:25:14,318 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 17:25:14,318 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 17:25:14,318 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 17:25:14,319 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 17:25:14,319 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 17:25:14,319 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 17:25:14,320 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 17:25:14,320 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 17:25:14,340 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states. [2019-11-28 17:25:14,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 17:25:14,347 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:25:14,348 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:14,349 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:25:14,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:25:14,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1388908220, now seen corresponding path program 1 times [2019-11-28 17:25:14,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:25:14,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942978466] [2019-11-28 17:25:14,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:25:14,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:25:14,644 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:14,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942978466] [2019-11-28 17:25:14,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:25:14,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:25:14,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390301279] [2019-11-28 17:25:14,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 17:25:14,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:25:14,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 17:25:14,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 17:25:14,673 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 2 states. [2019-11-28 17:25:14,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:25:14,707 INFO L93 Difference]: Finished difference Result 179 states and 270 transitions. [2019-11-28 17:25:14,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 17:25:14,709 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2019-11-28 17:25:14,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:25:14,722 INFO L225 Difference]: With dead ends: 179 [2019-11-28 17:25:14,723 INFO L226 Difference]: Without dead ends: 89 [2019-11-28 17:25:14,727 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:14,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-28 17:25:14,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-11-28 17:25:14,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-28 17:25:14,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 127 transitions. [2019-11-28 17:25:14,775 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 127 transitions. Word has length 18 [2019-11-28 17:25:14,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:25:14,776 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 127 transitions. [2019-11-28 17:25:14,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 17:25:14,776 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 127 transitions. [2019-11-28 17:25:14,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 17:25:14,778 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:25:14,778 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:14,778 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:25:14,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:25:14,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1607744189, now seen corresponding path program 1 times [2019-11-28 17:25:14,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:25:14,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364412890] [2019-11-28 17:25:14,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:25:14,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:25:14,921 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:14,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364412890] [2019-11-28 17:25:14,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:25:14,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:25:14,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291045272] [2019-11-28 17:25:14,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:25:14,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:25:14,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:25:14,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:25:14,927 INFO L87 Difference]: Start difference. First operand 89 states and 127 transitions. Second operand 3 states. [2019-11-28 17:25:14,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:25:14,950 INFO L93 Difference]: Finished difference Result 89 states and 127 transitions. [2019-11-28 17:25:14,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:25:14,951 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-28 17:25:14,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:25:14,952 INFO L225 Difference]: With dead ends: 89 [2019-11-28 17:25:14,953 INFO L226 Difference]: Without dead ends: 41 [2019-11-28 17:25:14,956 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:14,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-28 17:25:14,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-11-28 17:25:14,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-28 17:25:14,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 58 transitions. [2019-11-28 17:25:14,963 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 58 transitions. Word has length 19 [2019-11-28 17:25:14,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:25:14,964 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 58 transitions. [2019-11-28 17:25:14,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:25:14,964 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 58 transitions. [2019-11-28 17:25:14,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 17:25:14,965 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:25:14,965 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:14,966 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:25:14,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:25:14,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1417220031, now seen corresponding path program 1 times [2019-11-28 17:25:14,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:25:14,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422299088] [2019-11-28 17:25:14,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:25:15,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:25:15,108 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,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422299088] [2019-11-28 17:25:15,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:25:15,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 17:25:15,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373942883] [2019-11-28 17:25:15,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 17:25:15,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:25:15,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 17:25:15,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 17:25:15,111 INFO L87 Difference]: Start difference. First operand 41 states and 58 transitions. Second operand 6 states. [2019-11-28 17:25:15,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:25:15,256 INFO L93 Difference]: Finished difference Result 133 states and 196 transitions. [2019-11-28 17:25:15,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 17:25:15,257 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-11-28 17:25:15,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:25:15,258 INFO L225 Difference]: With dead ends: 133 [2019-11-28 17:25:15,258 INFO L226 Difference]: Without dead ends: 99 [2019-11-28 17:25:15,259 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-28 17:25:15,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-11-28 17:25:15,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 61. [2019-11-28 17:25:15,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-28 17:25:15,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 89 transitions. [2019-11-28 17:25:15,277 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 89 transitions. Word has length 24 [2019-11-28 17:25:15,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:25:15,277 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 89 transitions. [2019-11-28 17:25:15,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 17:25:15,277 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 89 transitions. [2019-11-28 17:25:15,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 17:25:15,279 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:25:15,280 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:15,280 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:25:15,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:25:15,281 INFO L82 PathProgramCache]: Analyzing trace with hash -462384263, now seen corresponding path program 1 times [2019-11-28 17:25:15,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:25:15,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858293992] [2019-11-28 17:25:15,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:25:15,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:25:15,388 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,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858293992] [2019-11-28 17:25:15,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:25:15,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:25:15,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44995780] [2019-11-28 17:25:15,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:25:15,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:25:15,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:25:15,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:25:15,391 INFO L87 Difference]: Start difference. First operand 61 states and 89 transitions. Second operand 3 states. [2019-11-28 17:25:15,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:25:15,449 INFO L93 Difference]: Finished difference Result 137 states and 203 transitions. [2019-11-28 17:25:15,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:25:15,451 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-28 17:25:15,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:25:15,452 INFO L225 Difference]: With dead ends: 137 [2019-11-28 17:25:15,452 INFO L226 Difference]: Without dead ends: 83 [2019-11-28 17:25:15,456 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:15,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-28 17:25:15,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2019-11-28 17:25:15,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-11-28 17:25:15,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 116 transitions. [2019-11-28 17:25:15,478 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 116 transitions. Word has length 25 [2019-11-28 17:25:15,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:25:15,479 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 116 transitions. [2019-11-28 17:25:15,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:25:15,480 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 116 transitions. [2019-11-28 17:25:15,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 17:25:15,481 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:25:15,482 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:15,482 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:25:15,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:25:15,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1738728008, now seen corresponding path program 1 times [2019-11-28 17:25:15,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:25:15,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067036611] [2019-11-28 17:25:15,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:25:15,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:25:15,584 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,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067036611] [2019-11-28 17:25:15,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:25:15,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 17:25:15,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143970053] [2019-11-28 17:25:15,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:25:15,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:25:15,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:25:15,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:25:15,588 INFO L87 Difference]: Start difference. First operand 81 states and 116 transitions. Second operand 5 states. [2019-11-28 17:25:15,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:25:15,849 INFO L93 Difference]: Finished difference Result 378 states and 552 transitions. [2019-11-28 17:25:15,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 17:25:15,850 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-11-28 17:25:15,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:25:15,853 INFO L225 Difference]: With dead ends: 378 [2019-11-28 17:25:15,853 INFO L226 Difference]: Without dead ends: 304 [2019-11-28 17:25:15,854 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-28 17:25:15,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-11-28 17:25:15,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 144. [2019-11-28 17:25:15,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-11-28 17:25:15,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 203 transitions. [2019-11-28 17:25:15,879 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 203 transitions. Word has length 27 [2019-11-28 17:25:15,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:25:15,880 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 203 transitions. [2019-11-28 17:25:15,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:25:15,880 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 203 transitions. [2019-11-28 17:25:15,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 17:25:15,881 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:25:15,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] [2019-11-28 17:25:15,882 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:25:15,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:25:15,882 INFO L82 PathProgramCache]: Analyzing trace with hash 304582848, now seen corresponding path program 1 times [2019-11-28 17:25:15,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:25:15,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611350966] [2019-11-28 17:25:15,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:25:15,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:25:15,951 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,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611350966] [2019-11-28 17:25:15,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:25:15,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 17:25:15,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443846982] [2019-11-28 17:25:15,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:25:15,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:25:15,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:25:15,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:25:15,954 INFO L87 Difference]: Start difference. First operand 144 states and 203 transitions. Second operand 5 states. [2019-11-28 17:25:16,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:25:16,104 INFO L93 Difference]: Finished difference Result 529 states and 751 transitions. [2019-11-28 17:25:16,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 17:25:16,105 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-11-28 17:25:16,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:25:16,108 INFO L225 Difference]: With dead ends: 529 [2019-11-28 17:25:16,108 INFO L226 Difference]: Without dead ends: 392 [2019-11-28 17:25:16,110 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,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2019-11-28 17:25:16,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 142. [2019-11-28 17:25:16,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-11-28 17:25:16,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 197 transitions. [2019-11-28 17:25:16,133 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 197 transitions. Word has length 28 [2019-11-28 17:25:16,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:25:16,134 INFO L462 AbstractCegarLoop]: Abstraction has 142 states and 197 transitions. [2019-11-28 17:25:16,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:25:16,134 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 197 transitions. [2019-11-28 17:25:16,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-28 17:25:16,136 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:25:16,137 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,137 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:25:16,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:25:16,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1643402821, now seen corresponding path program 1 times [2019-11-28 17:25:16,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:25:16,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525480706] [2019-11-28 17:25:16,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:25:16,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:25:16,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:16,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525480706] [2019-11-28 17:25:16,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:25:16,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 17:25:16,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636067177] [2019-11-28 17:25:16,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:25:16,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:25:16,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:25:16,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:25:16,206 INFO L87 Difference]: Start difference. First operand 142 states and 197 transitions. Second operand 5 states. [2019-11-28 17:25:16,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:25:16,284 INFO L93 Difference]: Finished difference Result 429 states and 593 transitions. [2019-11-28 17:25:16,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 17:25:16,285 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-11-28 17:25:16,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:25:16,289 INFO L225 Difference]: With dead ends: 429 [2019-11-28 17:25:16,290 INFO L226 Difference]: Without dead ends: 294 [2019-11-28 17:25:16,292 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:16,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-11-28 17:25:16,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 148. [2019-11-28 17:25:16,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-11-28 17:25:16,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 203 transitions. [2019-11-28 17:25:16,328 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 203 transitions. Word has length 35 [2019-11-28 17:25:16,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:25:16,329 INFO L462 AbstractCegarLoop]: Abstraction has 148 states and 203 transitions. [2019-11-28 17:25:16,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:25:16,330 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 203 transitions. [2019-11-28 17:25:16,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-28 17:25:16,337 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:25:16,338 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,338 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:25:16,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:25:16,339 INFO L82 PathProgramCache]: Analyzing trace with hash 632285571, now seen corresponding path program 1 times [2019-11-28 17:25:16,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:25:16,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758855013] [2019-11-28 17:25:16,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:25:16,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:25:16,392 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,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758855013] [2019-11-28 17:25:16,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:25:16,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 17:25:16,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756276086] [2019-11-28 17:25:16,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 17:25:16,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:25:16,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 17:25:16,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 17:25:16,395 INFO L87 Difference]: Start difference. First operand 148 states and 203 transitions. Second operand 4 states. [2019-11-28 17:25:16,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:25:16,438 INFO L93 Difference]: Finished difference Result 373 states and 511 transitions. [2019-11-28 17:25:16,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 17:25:16,439 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-11-28 17:25:16,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:25:16,441 INFO L225 Difference]: With dead ends: 373 [2019-11-28 17:25:16,442 INFO L226 Difference]: Without dead ends: 232 [2019-11-28 17:25:16,443 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:16,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-11-28 17:25:16,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 152. [2019-11-28 17:25:16,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-11-28 17:25:16,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 207 transitions. [2019-11-28 17:25:16,466 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 207 transitions. Word has length 35 [2019-11-28 17:25:16,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:25:16,467 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 207 transitions. [2019-11-28 17:25:16,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 17:25:16,467 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 207 transitions. [2019-11-28 17:25:16,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-28 17:25:16,473 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:25:16,473 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,473 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:25:16,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:25:16,474 INFO L82 PathProgramCache]: Analyzing trace with hash -388782783, now seen corresponding path program 1 times [2019-11-28 17:25:16,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:25:16,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28734053] [2019-11-28 17:25:16,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:25:16,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:25:16,537 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,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28734053] [2019-11-28 17:25:16,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:25:16,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:25:16,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329062986] [2019-11-28 17:25:16,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:25:16,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:25:16,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:25:16,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:25:16,542 INFO L87 Difference]: Start difference. First operand 152 states and 207 transitions. Second operand 3 states. [2019-11-28 17:25:16,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:25:16,590 INFO L93 Difference]: Finished difference Result 383 states and 521 transitions. [2019-11-28 17:25:16,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:25:16,590 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-11-28 17:25:16,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:25:16,592 INFO L225 Difference]: With dead ends: 383 [2019-11-28 17:25:16,592 INFO L226 Difference]: Without dead ends: 238 [2019-11-28 17:25:16,594 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,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2019-11-28 17:25:16,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2019-11-28 17:25:16,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-11-28 17:25:16,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 315 transitions. [2019-11-28 17:25:16,626 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 315 transitions. Word has length 35 [2019-11-28 17:25:16,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:25:16,627 INFO L462 AbstractCegarLoop]: Abstraction has 238 states and 315 transitions. [2019-11-28 17:25:16,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:25:16,627 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 315 transitions. [2019-11-28 17:25:16,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-28 17:25:16,629 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:25:16,630 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:16,630 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:25:16,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:25:16,631 INFO L82 PathProgramCache]: Analyzing trace with hash -713441279, now seen corresponding path program 1 times [2019-11-28 17:25:16,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:25:16,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460013535] [2019-11-28 17:25:16,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:25:16,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:25:16,748 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,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460013535] [2019-11-28 17:25:16,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:25:16,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 17:25:16,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880774497] [2019-11-28 17:25:16,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 17:25:16,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:25:16,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 17:25:16,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-28 17:25:16,754 INFO L87 Difference]: Start difference. First operand 238 states and 315 transitions. Second operand 8 states. [2019-11-28 17:25:17,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:25:17,248 INFO L93 Difference]: Finished difference Result 877 states and 1165 transitions. [2019-11-28 17:25:17,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-28 17:25:17,249 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2019-11-28 17:25:17,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:25:17,254 INFO L225 Difference]: With dead ends: 877 [2019-11-28 17:25:17,255 INFO L226 Difference]: Without dead ends: 646 [2019-11-28 17:25:17,256 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=281, Unknown=0, NotChecked=0, Total=420 [2019-11-28 17:25:17,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2019-11-28 17:25:17,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 238. [2019-11-28 17:25:17,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-11-28 17:25:17,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 309 transitions. [2019-11-28 17:25:17,293 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 309 transitions. Word has length 36 [2019-11-28 17:25:17,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:25:17,294 INFO L462 AbstractCegarLoop]: Abstraction has 238 states and 309 transitions. [2019-11-28 17:25:17,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 17:25:17,294 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 309 transitions. [2019-11-28 17:25:17,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-28 17:25:17,296 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:25:17,296 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:17,297 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:25:17,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:25:17,297 INFO L82 PathProgramCache]: Analyzing trace with hash -838060658, now seen corresponding path program 1 times [2019-11-28 17:25:17,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:25:17,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178560374] [2019-11-28 17:25:17,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:25:17,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:25:17,351 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:17,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178560374] [2019-11-28 17:25:17,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:25:17,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:25:17,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353323821] [2019-11-28 17:25:17,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:25:17,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:25:17,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:25:17,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:25:17,353 INFO L87 Difference]: Start difference. First operand 238 states and 309 transitions. Second operand 3 states. [2019-11-28 17:25:17,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:25:17,412 INFO L93 Difference]: Finished difference Result 327 states and 426 transitions. [2019-11-28 17:25:17,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:25:17,413 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-11-28 17:25:17,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:25:17,416 INFO L225 Difference]: With dead ends: 327 [2019-11-28 17:25:17,416 INFO L226 Difference]: Without dead ends: 325 [2019-11-28 17:25:17,416 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:17,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-11-28 17:25:17,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 258. [2019-11-28 17:25:17,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-11-28 17:25:17,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 339 transitions. [2019-11-28 17:25:17,444 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 339 transitions. Word has length 51 [2019-11-28 17:25:17,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:25:17,445 INFO L462 AbstractCegarLoop]: Abstraction has 258 states and 339 transitions. [2019-11-28 17:25:17,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:25:17,445 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 339 transitions. [2019-11-28 17:25:17,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-28 17:25:17,447 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:25:17,447 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:17,447 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:25:17,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:25:17,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1134302103, now seen corresponding path program 1 times [2019-11-28 17:25:17,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:25:17,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271194873] [2019-11-28 17:25:17,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:25:17,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 17:25:17,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 17:25:17,675 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 17:25:17,676 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 17:25:17,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 05:25:17 BoogieIcfgContainer [2019-11-28 17:25:17,818 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 17:25:17,819 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 17:25:17,819 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 17:25:17,819 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 17:25:17,820 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:14" (3/4) ... [2019-11-28 17:25:17,822 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 17:25:17,972 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 17:25:17,973 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 17:25:17,975 INFO L168 Benchmark]: Toolchain (without parser) took 5480.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 207.6 MB). Free memory was 957.7 MB in the beginning and 1.0 GB in the end (delta: -51.1 MB). Peak memory consumption was 156.5 MB. Max. memory is 11.5 GB. [2019-11-28 17:25:17,976 INFO L168 Benchmark]: CDTParser took 0.30 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:17,976 INFO L168 Benchmark]: CACSL2BoogieTranslator took 695.06 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.2 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -129.8 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. [2019-11-28 17:25:17,976 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.86 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-28 17:25:17,977 INFO L168 Benchmark]: Boogie Preprocessor took 55.10 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:25:17,977 INFO L168 Benchmark]: RCFGBuilder took 927.29 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 58.9 MB). Peak memory consumption was 58.9 MB. Max. memory is 11.5 GB. [2019-11-28 17:25:17,977 INFO L168 Benchmark]: TraceAbstraction took 3566.06 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 94.4 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: -11.7 MB). Peak memory consumption was 82.6 MB. Max. memory is 11.5 GB. [2019-11-28 17:25:17,978 INFO L168 Benchmark]: Witness Printer took 154.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 24.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2019-11-28 17:25:17,980 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.30 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 695.06 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.2 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -129.8 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 73.86 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 55.10 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 927.29 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 58.9 MB). Peak memory consumption was 58.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3566.06 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 94.4 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: -11.7 MB). Peak memory consumption was 82.6 MB. Max. memory is 11.5 GB. * Witness Printer took 154.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 24.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 946]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L47] int waterLevel = 1; [L48] int methaneLevelCritical = 0; [L310] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L507] int cleanupTimeShifts = 4; [L648] int methAndRunningLastTime ; [L757] int pumpRunning = 0; [L758] int systemActive = 1; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L588] int retValue_acc ; [L589] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L637] int retValue_acc ; [L640] retValue_acc = 1 [L641] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L595] tmp = valid_product() [L597] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L653] methAndRunningLastTime = 0 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L689] int splverifierCounter ; [L690] int tmp ; [L691] int tmp___0 ; [L692] int tmp___1 ; [L693] int tmp___2 ; [L696] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L698] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L700] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L706] tmp = __VERIFIER_nondet_int() [L708] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L65] COND TRUE waterLevel < 2 [L66] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L716] tmp___0 = __VERIFIER_nondet_int() [L718] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L726] tmp___2 = __VERIFIER_nondet_int() [L728] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L764] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L771] COND TRUE \read(systemActive) [L793] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L796] COND TRUE ! pumpRunning [L908] int retValue_acc ; [L909] int tmp ; [L910] int tmp___0 ; [L127] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L130] COND FALSE !(waterLevel < 2) [L134] retValue_acc = 0 [L135] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L914] tmp = isHighWaterSensorDry() [L916] COND FALSE !(\read(tmp)) [L919] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L921] retValue_acc = tmp___0 [L922] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L798] tmp = isHighWaterLevel() [L800] COND TRUE \read(tmp) [L827] int tmp ; [L852] int retValue_acc ; [L86] int retValue_acc ; [L89] retValue_acc = methaneLevelCritical [L90] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L856] retValue_acc = isMethaneLevelCritical() [L858] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L831] tmp = isMethaneAlarm() [L833] COND FALSE !(\read(tmp)) [L821] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L658] int tmp ; [L659] int tmp___0 ; [L86] int retValue_acc ; [L89] retValue_acc = methaneLevelCritical [L90] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L663] tmp = isMethaneLevelCritical() [L665] COND FALSE !(\read(tmp)) [L681] methAndRunningLastTime = 0 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L698] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L700] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L706] tmp = __VERIFIER_nondet_int() [L708] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L716] tmp___0 = __VERIFIER_nondet_int() [L718] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L77] COND FALSE !(\read(methaneLevelCritical)) [L80] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L726] tmp___2 = __VERIFIER_nondet_int() [L728] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L764] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L53] COND TRUE waterLevel > 0 [L54] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L771] COND TRUE \read(systemActive) [L793] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L796] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L658] int tmp ; [L659] int tmp___0 ; [L86] int retValue_acc ; [L89] retValue_acc = methaneLevelCritical [L90] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L663] tmp = isMethaneLevelCritical() [L665] COND TRUE \read(tmp) [L863] int retValue_acc ; [L866] retValue_acc = pumpRunning [L867] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L667] tmp___0 = isPumpRunning() [L669] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L670] COND FALSE !(\read(methAndRunningLastTime)) [L675] methAndRunningLastTime = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L698] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L700] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L706] tmp = __VERIFIER_nondet_int() [L708] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L716] tmp___0 = __VERIFIER_nondet_int() [L718] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L726] tmp___2 = __VERIFIER_nondet_int() [L728] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L764] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L53] COND TRUE waterLevel > 0 [L54] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L771] COND TRUE \read(systemActive) [L793] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L796] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L658] int tmp ; [L659] int tmp___0 ; [L86] int retValue_acc ; [L89] retValue_acc = methaneLevelCritical [L90] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L663] tmp = isMethaneLevelCritical() [L665] COND TRUE \read(tmp) [L863] int retValue_acc ; [L866] retValue_acc = pumpRunning [L867] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L667] tmp___0 = isPumpRunning() [L669] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L670] COND TRUE \read(methAndRunningLastTime) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L946] __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: 944 SDtfs, 1258 SDslu, 1857 SDs, 0 SdLazy, 217 SolverSat, 37 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=258occurred 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.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 1151 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, 19852 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...