./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec4_product44.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab 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_spec4_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 cd9d3373e3670d73493569b1c43b551709fc0f6c .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 00:22:51,172 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 00:22:51,175 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 00:22:51,195 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 00:22:51,195 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 00:22:51,198 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 00:22:51,200 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 00:22:51,214 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 00:22:51,217 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 00:22:51,219 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 00:22:51,221 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 00:22:51,224 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 00:22:51,224 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 00:22:51,228 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 00:22:51,229 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 00:22:51,231 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 00:22:51,233 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 00:22:51,234 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 00:22:51,235 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 00:22:51,238 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 00:22:51,240 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 00:22:51,241 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 00:22:51,243 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 00:22:51,244 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 00:22:51,246 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 00:22:51,247 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 00:22:51,247 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 00:22:51,248 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 00:22:51,249 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 00:22:51,250 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 00:22:51,250 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 00:22:51,251 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 00:22:51,252 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 00:22:51,253 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 00:22:51,254 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 00:22:51,255 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 00:22:51,255 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 00:22:51,256 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 00:22:51,256 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 00:22:51,257 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 00:22:51,258 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 00:22:51,259 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 00:22:51,275 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 00:22:51,275 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 00:22:51,277 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 00:22:51,277 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 00:22:51,278 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 00:22:51,278 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 00:22:51,278 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 00:22:51,279 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 00:22:51,279 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 00:22:51,279 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 00:22:51,279 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 00:22:51,280 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 00:22:51,280 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 00:22:51,280 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 00:22:51,281 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 00:22:51,281 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 00:22:51,281 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 00:22:51,282 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 00:22:51,282 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 00:22:51,282 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 00:22:51,282 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 00:22:51,283 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:22:51,283 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 00:22:51,283 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 00:22:51,284 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 00:22:51,284 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 00:22:51,284 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 00:22:51,284 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 00:22:51,285 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 -> cd9d3373e3670d73493569b1c43b551709fc0f6c [2019-11-28 00:22:51,584 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 00:22:51,597 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 00:22:51,601 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 00:22:51,602 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 00:22:51,603 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 00:22:51,604 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec4_product44.cil.c [2019-11-28 00:22:51,676 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1e43a527/41f1b883d46a4580b27851b6d3b830d8/FLAG3b569d51f [2019-11-28 00:22:52,233 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 00:22:52,234 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product44.cil.c [2019-11-28 00:22:52,252 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1e43a527/41f1b883d46a4580b27851b6d3b830d8/FLAG3b569d51f [2019-11-28 00:22:52,521 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1e43a527/41f1b883d46a4580b27851b6d3b830d8 [2019-11-28 00:22:52,524 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 00:22:52,526 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 00:22:52,527 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 00:22:52,527 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 00:22:52,531 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 00:22:52,531 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:22:52" (1/1) ... [2019-11-28 00:22:52,534 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67529377 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:52, skipping insertion in model container [2019-11-28 00:22:52,535 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:22:52" (1/1) ... [2019-11-28 00:22:52,543 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 00:22:52,586 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 00:22:53,008 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:22:53,034 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 00:22:53,160 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:22:53,195 INFO L208 MainTranslator]: Completed translation [2019-11-28 00:22:53,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:53 WrapperNode [2019-11-28 00:22:53,195 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 00:22:53,196 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 00:22:53,197 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 00:22:53,197 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 00:22:53,205 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:53" (1/1) ... [2019-11-28 00:22:53,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 12:22:53" (1/1) ... [2019-11-28 00:22:53,269 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 00:22:53,270 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 00:22:53,270 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 00:22:53,270 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 00:22:53,279 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:53" (1/1) ... [2019-11-28 00:22:53,279 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:53" (1/1) ... [2019-11-28 00:22:53,284 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:53" (1/1) ... [2019-11-28 00:22:53,285 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:53" (1/1) ... [2019-11-28 00:22:53,296 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:53" (1/1) ... [2019-11-28 00:22:53,305 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:53" (1/1) ... [2019-11-28 00:22:53,308 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:53" (1/1) ... [2019-11-28 00:22:53,313 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 00:22:53,314 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 00:22:53,314 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 00:22:53,314 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 00:22:53,316 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:53" (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 00:22:53,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 00:22:53,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-28 00:22:53,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 00:22:53,391 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 00:22:54,193 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 00:22:54,194 INFO L297 CfgBuilder]: Removed 120 assume(true) statements. [2019-11-28 00:22:54,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:22:54 BoogieIcfgContainer [2019-11-28 00:22:54,196 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 00:22:54,197 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 00:22:54,197 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 00:22:54,200 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 00:22:54,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:22:52" (1/3) ... [2019-11-28 00:22:54,202 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2534dfcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:22:54, skipping insertion in model container [2019-11-28 00:22:54,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:53" (2/3) ... [2019-11-28 00:22:54,203 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2534dfcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:22:54, skipping insertion in model container [2019-11-28 00:22:54,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:22:54" (3/3) ... [2019-11-28 00:22:54,205 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec4_product44.cil.c [2019-11-28 00:22:54,215 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 00:22:54,223 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-28 00:22:54,236 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-28 00:22:54,262 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 00:22:54,262 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 00:22:54,263 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 00:22:54,263 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 00:22:54,263 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 00:22:54,263 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 00:22:54,264 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 00:22:54,264 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 00:22:54,283 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states. [2019-11-28 00:22:54,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 00:22:54,290 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:54,291 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:22:54,292 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:54,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:54,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1782116946, now seen corresponding path program 1 times [2019-11-28 00:22:54,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:54,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587476515] [2019-11-28 00:22:54,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:54,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:54,609 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 00:22:54,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587476515] [2019-11-28 00:22:54,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:54,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:22:54,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002089840] [2019-11-28 00:22:54,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 00:22:54,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:54,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 00:22:54,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 00:22:54,641 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 2 states. [2019-11-28 00:22:54,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:54,699 INFO L93 Difference]: Finished difference Result 172 states and 257 transitions. [2019-11-28 00:22:54,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 00:22:54,701 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-11-28 00:22:54,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:54,712 INFO L225 Difference]: With dead ends: 172 [2019-11-28 00:22:54,713 INFO L226 Difference]: Without dead ends: 85 [2019-11-28 00:22:54,717 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 00:22:54,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-11-28 00:22:54,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-11-28 00:22:54,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-11-28 00:22:54,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 120 transitions. [2019-11-28 00:22:54,768 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 120 transitions. Word has length 16 [2019-11-28 00:22:54,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:54,769 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 120 transitions. [2019-11-28 00:22:54,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 00:22:54,769 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 120 transitions. [2019-11-28 00:22:54,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 00:22:54,770 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:54,771 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:22:54,771 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:54,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:54,772 INFO L82 PathProgramCache]: Analyzing trace with hash 735360049, now seen corresponding path program 1 times [2019-11-28 00:22:54,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:54,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135478543] [2019-11-28 00:22:54,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:54,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:54,887 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 00:22:54,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135478543] [2019-11-28 00:22:54,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:54,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:22:54,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831511473] [2019-11-28 00:22:54,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:22:54,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:54,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:22:54,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:22:54,892 INFO L87 Difference]: Start difference. First operand 85 states and 120 transitions. Second operand 3 states. [2019-11-28 00:22:54,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:54,906 INFO L93 Difference]: Finished difference Result 85 states and 120 transitions. [2019-11-28 00:22:54,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:22:54,907 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 00:22:54,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:54,909 INFO L225 Difference]: With dead ends: 85 [2019-11-28 00:22:54,909 INFO L226 Difference]: Without dead ends: 39 [2019-11-28 00:22:54,910 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 00:22:54,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-11-28 00:22:54,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-11-28 00:22:54,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-28 00:22:54,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 55 transitions. [2019-11-28 00:22:54,920 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 55 transitions. Word has length 17 [2019-11-28 00:22:54,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:54,920 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 55 transitions. [2019-11-28 00:22:54,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:22:54,921 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 55 transitions. [2019-11-28 00:22:54,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 00:22:54,921 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:54,922 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] [2019-11-28 00:22:54,922 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:54,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:54,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1297648259, now seen corresponding path program 1 times [2019-11-28 00:22:54,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:54,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376628578] [2019-11-28 00:22:54,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:54,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:55,062 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 00:22:55,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376628578] [2019-11-28 00:22:55,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:55,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:22:55,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833790462] [2019-11-28 00:22:55,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:22:55,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:55,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:22:55,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:22:55,065 INFO L87 Difference]: Start difference. First operand 39 states and 55 transitions. Second operand 3 states. [2019-11-28 00:22:55,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:55,117 INFO L93 Difference]: Finished difference Result 105 states and 153 transitions. [2019-11-28 00:22:55,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:22:55,118 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-28 00:22:55,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:55,121 INFO L225 Difference]: With dead ends: 105 [2019-11-28 00:22:55,121 INFO L226 Difference]: Without dead ends: 72 [2019-11-28 00:22:55,123 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 00:22:55,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-11-28 00:22:55,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2019-11-28 00:22:55,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-28 00:22:55,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 99 transitions. [2019-11-28 00:22:55,148 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 99 transitions. Word has length 22 [2019-11-28 00:22:55,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:55,149 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 99 transitions. [2019-11-28 00:22:55,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:22:55,150 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 99 transitions. [2019-11-28 00:22:55,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 00:22:55,152 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:55,153 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] [2019-11-28 00:22:55,153 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:55,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:55,154 INFO L82 PathProgramCache]: Analyzing trace with hash -372126526, now seen corresponding path program 1 times [2019-11-28 00:22:55,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:55,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783869499] [2019-11-28 00:22:55,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:55,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:55,256 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 00:22:55,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783869499] [2019-11-28 00:22:55,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:55,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:22:55,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895554212] [2019-11-28 00:22:55,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:22:55,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:55,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:22:55,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:22:55,261 INFO L87 Difference]: Start difference. First operand 68 states and 99 transitions. Second operand 3 states. [2019-11-28 00:22:55,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:55,305 INFO L93 Difference]: Finished difference Result 171 states and 254 transitions. [2019-11-28 00:22:55,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:22:55,305 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-28 00:22:55,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:55,307 INFO L225 Difference]: With dead ends: 171 [2019-11-28 00:22:55,307 INFO L226 Difference]: Without dead ends: 109 [2019-11-28 00:22:55,308 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 00:22:55,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-28 00:22:55,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2019-11-28 00:22:55,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-28 00:22:55,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 155 transitions. [2019-11-28 00:22:55,323 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 155 transitions. Word has length 23 [2019-11-28 00:22:55,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:55,323 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 155 transitions. [2019-11-28 00:22:55,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:22:55,324 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 155 transitions. [2019-11-28 00:22:55,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 00:22:55,325 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:55,325 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 00:22:55,326 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:55,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:55,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1852423790, now seen corresponding path program 1 times [2019-11-28 00:22:55,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:55,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463178535] [2019-11-28 00:22:55,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:55,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:55,397 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 00:22:55,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463178535] [2019-11-28 00:22:55,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:55,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:22:55,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574502615] [2019-11-28 00:22:55,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:22:55,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:55,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:22:55,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:22:55,401 INFO L87 Difference]: Start difference. First operand 107 states and 155 transitions. Second operand 5 states. [2019-11-28 00:22:55,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:55,516 INFO L93 Difference]: Finished difference Result 399 states and 585 transitions. [2019-11-28 00:22:55,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:22:55,517 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-11-28 00:22:55,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:55,519 INFO L225 Difference]: With dead ends: 399 [2019-11-28 00:22:55,520 INFO L226 Difference]: Without dead ends: 298 [2019-11-28 00:22:55,521 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-28 00:22:55,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-11-28 00:22:55,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 194. [2019-11-28 00:22:55,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-11-28 00:22:55,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 272 transitions. [2019-11-28 00:22:55,545 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 272 transitions. Word has length 25 [2019-11-28 00:22:55,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:55,546 INFO L462 AbstractCegarLoop]: Abstraction has 194 states and 272 transitions. [2019-11-28 00:22:55,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:22:55,546 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 272 transitions. [2019-11-28 00:22:55,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 00:22:55,547 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:55,548 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] [2019-11-28 00:22:55,548 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:55,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:55,549 INFO L82 PathProgramCache]: Analyzing trace with hash 483234516, now seen corresponding path program 1 times [2019-11-28 00:22:55,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:55,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055733289] [2019-11-28 00:22:55,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:55,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:55,615 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 00:22:55,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055733289] [2019-11-28 00:22:55,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:55,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:22:55,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253852316] [2019-11-28 00:22:55,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:22:55,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:55,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:22:55,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:22:55,618 INFO L87 Difference]: Start difference. First operand 194 states and 272 transitions. Second operand 5 states. [2019-11-28 00:22:55,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:55,750 INFO L93 Difference]: Finished difference Result 398 states and 570 transitions. [2019-11-28 00:22:55,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 00:22:55,751 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-28 00:22:55,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:55,754 INFO L225 Difference]: With dead ends: 398 [2019-11-28 00:22:55,755 INFO L226 Difference]: Without dead ends: 396 [2019-11-28 00:22:55,756 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 00:22:55,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2019-11-28 00:22:55,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 194. [2019-11-28 00:22:55,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-11-28 00:22:55,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 270 transitions. [2019-11-28 00:22:55,784 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 270 transitions. Word has length 26 [2019-11-28 00:22:55,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:55,785 INFO L462 AbstractCegarLoop]: Abstraction has 194 states and 270 transitions. [2019-11-28 00:22:55,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:22:55,786 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 270 transitions. [2019-11-28 00:22:55,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-28 00:22:55,793 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:55,793 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] [2019-11-28 00:22:55,796 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:55,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:55,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1957615203, now seen corresponding path program 1 times [2019-11-28 00:22:55,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:55,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013476660] [2019-11-28 00:22:55,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:55,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:55,882 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 00:22:55,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013476660] [2019-11-28 00:22:55,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:55,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:22:55,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151202774] [2019-11-28 00:22:55,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:22:55,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:55,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:22:55,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:22:55,891 INFO L87 Difference]: Start difference. First operand 194 states and 270 transitions. Second operand 5 states. [2019-11-28 00:22:55,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:55,962 INFO L93 Difference]: Finished difference Result 542 states and 750 transitions. [2019-11-28 00:22:55,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:22:55,963 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-11-28 00:22:55,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:55,965 INFO L225 Difference]: With dead ends: 542 [2019-11-28 00:22:55,966 INFO L226 Difference]: Without dead ends: 354 [2019-11-28 00:22:55,967 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 00:22:55,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-11-28 00:22:55,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 206. [2019-11-28 00:22:55,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-11-28 00:22:55,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 282 transitions. [2019-11-28 00:22:55,987 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 282 transitions. Word has length 33 [2019-11-28 00:22:55,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:55,988 INFO L462 AbstractCegarLoop]: Abstraction has 206 states and 282 transitions. [2019-11-28 00:22:55,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:22:55,989 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 282 transitions. [2019-11-28 00:22:55,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-28 00:22:55,990 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:55,990 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] [2019-11-28 00:22:55,991 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:55,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:55,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1750546079, now seen corresponding path program 1 times [2019-11-28 00:22:55,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:55,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630672027] [2019-11-28 00:22:55,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:56,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:56,044 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 00:22:56,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630672027] [2019-11-28 00:22:56,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:56,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:22:56,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587229862] [2019-11-28 00:22:56,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 00:22:56,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:56,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 00:22:56,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 00:22:56,047 INFO L87 Difference]: Start difference. First operand 206 states and 282 transitions. Second operand 4 states. [2019-11-28 00:22:56,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:56,092 INFO L93 Difference]: Finished difference Result 444 states and 607 transitions. [2019-11-28 00:22:56,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 00:22:56,093 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-11-28 00:22:56,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:56,095 INFO L225 Difference]: With dead ends: 444 [2019-11-28 00:22:56,095 INFO L226 Difference]: Without dead ends: 244 [2019-11-28 00:22:56,096 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 00:22:56,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2019-11-28 00:22:56,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 165. [2019-11-28 00:22:56,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-11-28 00:22:56,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 222 transitions. [2019-11-28 00:22:56,111 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 222 transitions. Word has length 33 [2019-11-28 00:22:56,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:56,112 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 222 transitions. [2019-11-28 00:22:56,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 00:22:56,112 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 222 transitions. [2019-11-28 00:22:56,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-28 00:22:56,113 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:56,113 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] [2019-11-28 00:22:56,114 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:56,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:56,114 INFO L82 PathProgramCache]: Analyzing trace with hash 470682401, now seen corresponding path program 1 times [2019-11-28 00:22:56,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:56,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626108966] [2019-11-28 00:22:56,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:56,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:56,174 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 00:22:56,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626108966] [2019-11-28 00:22:56,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:56,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:22:56,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802454789] [2019-11-28 00:22:56,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:22:56,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:56,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:22:56,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:22:56,177 INFO L87 Difference]: Start difference. First operand 165 states and 222 transitions. Second operand 5 states. [2019-11-28 00:22:56,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:56,366 INFO L93 Difference]: Finished difference Result 613 states and 858 transitions. [2019-11-28 00:22:56,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 00:22:56,368 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-11-28 00:22:56,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:56,371 INFO L225 Difference]: With dead ends: 613 [2019-11-28 00:22:56,371 INFO L226 Difference]: Without dead ends: 502 [2019-11-28 00:22:56,372 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 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 00:22:56,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2019-11-28 00:22:56,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 242. [2019-11-28 00:22:56,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-11-28 00:22:56,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 323 transitions. [2019-11-28 00:22:56,407 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 323 transitions. Word has length 33 [2019-11-28 00:22:56,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:56,408 INFO L462 AbstractCegarLoop]: Abstraction has 242 states and 323 transitions. [2019-11-28 00:22:56,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:22:56,408 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 323 transitions. [2019-11-28 00:22:56,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-28 00:22:56,410 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:56,410 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:22:56,410 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:56,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:56,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1853071629, now seen corresponding path program 1 times [2019-11-28 00:22:56,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:56,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789936288] [2019-11-28 00:22:56,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:56,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:56,553 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:22:56,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789936288] [2019-11-28 00:22:56,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158165756] [2019-11-28 00:22:56,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:22:56,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:56,718 INFO L255 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 00:22:56,732 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:22:56,795 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:22:56,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:22:56,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2019-11-28 00:22:56,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340160210] [2019-11-28 00:22:56,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 00:22:56,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:56,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 00:22:56,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-28 00:22:56,798 INFO L87 Difference]: Start difference. First operand 242 states and 323 transitions. Second operand 8 states. [2019-11-28 00:22:57,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:57,061 INFO L93 Difference]: Finished difference Result 879 states and 1211 transitions. [2019-11-28 00:22:57,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 00:22:57,062 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 48 [2019-11-28 00:22:57,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:57,066 INFO L225 Difference]: With dead ends: 879 [2019-11-28 00:22:57,066 INFO L226 Difference]: Without dead ends: 691 [2019-11-28 00:22:57,068 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-11-28 00:22:57,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2019-11-28 00:22:57,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 327. [2019-11-28 00:22:57,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2019-11-28 00:22:57,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 441 transitions. [2019-11-28 00:22:57,111 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 441 transitions. Word has length 48 [2019-11-28 00:22:57,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:57,111 INFO L462 AbstractCegarLoop]: Abstraction has 327 states and 441 transitions. [2019-11-28 00:22:57,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 00:22:57,112 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 441 transitions. [2019-11-28 00:22:57,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-28 00:22:57,113 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:57,114 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-28 00:22:57,318 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:22:57,319 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:57,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:57,319 INFO L82 PathProgramCache]: Analyzing trace with hash 82160865, now seen corresponding path program 2 times [2019-11-28 00:22:57,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:57,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311636148] [2019-11-28 00:22:57,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:57,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 00:22:57,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 00:22:57,550 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 00:22:57,550 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 00:22:57,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:22:57 BoogieIcfgContainer [2019-11-28 00:22:57,747 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 00:22:57,748 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 00:22:57,748 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 00:22:57,748 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 00:22:57,749 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:22:54" (3/4) ... [2019-11-28 00:22:57,752 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 00:22:57,926 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 00:22:57,927 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 00:22:57,929 INFO L168 Benchmark]: Toolchain (without parser) took 5403.03 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 226.0 MB). Free memory was 952.3 MB in the beginning and 1.0 GB in the end (delta: -97.6 MB). Peak memory consumption was 128.4 MB. Max. memory is 11.5 GB. [2019-11-28 00:22:57,929 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:22:57,930 INFO L168 Benchmark]: CACSL2BoogieTranslator took 669.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -168.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2019-11-28 00:22:57,930 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.99 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 00:22:57,931 INFO L168 Benchmark]: Boogie Preprocessor took 43.91 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 00:22:57,931 INFO L168 Benchmark]: RCFGBuilder took 881.87 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: 64.2 MB). Peak memory consumption was 64.2 MB. Max. memory is 11.5 GB. [2019-11-28 00:22:57,933 INFO L168 Benchmark]: TraceAbstraction took 3550.50 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 86.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -23.7 MB). Peak memory consumption was 62.8 MB. Max. memory is 11.5 GB. [2019-11-28 00:22:57,933 INFO L168 Benchmark]: Witness Printer took 178.99 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 24.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. [2019-11-28 00:22:57,936 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 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 669.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -168.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 72.99 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.91 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 881.87 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: 64.2 MB). Peak memory consumption was 64.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3550.50 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 86.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -23.7 MB). Peak memory consumption was 62.8 MB. Max. memory is 11.5 GB. * Witness Printer took 178.99 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 24.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 752]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L238] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L555] int pumpRunning = 0; [L556] int systemActive = 1; [L757] int cleanupTimeShifts = 4; [L853] int waterLevel = 1; [L854] int methaneLevelCritical = 0; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L830] int retValue_acc ; [L831] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L464] int retValue_acc ; [L467] retValue_acc = 1 [L468] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L837] tmp = valid_product() [L839] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L480] int splverifierCounter ; [L481] int tmp ; [L482] int tmp___0 ; [L483] int tmp___1 ; [L484] int tmp___2 ; [L487] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L489] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L491] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L497] tmp = __VERIFIER_nondet_int() [L499] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L871] COND TRUE waterLevel < 2 [L872] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L507] tmp___0 = __VERIFIER_nondet_int() [L509] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L517] tmp___2 = __VERIFIER_nondet_int() [L519] COND TRUE \read(tmp___2) [L743] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L562] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L569] COND TRUE \read(systemActive) [L591] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L594] COND TRUE ! pumpRunning [L706] int retValue_acc ; [L707] int tmp ; [L708] int tmp___0 ; [L933] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L936] COND FALSE !(waterLevel < 2) [L940] retValue_acc = 0 [L941] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L712] tmp = isHighWaterSensorDry() [L714] COND FALSE !(\read(tmp)) [L717] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L719] retValue_acc = tmp___0 [L720] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L596] tmp = isHighWaterLevel() [L598] COND TRUE \read(tmp) [L625] int tmp ; [L650] int retValue_acc ; [L892] int retValue_acc ; [L895] retValue_acc = methaneLevelCritical [L896] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L654] retValue_acc = isMethaneLevelCritical() [L656] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L629] tmp = isMethaneAlarm() [L631] COND FALSE !(\read(tmp)) [L619] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L44] int tmp ; [L45] int tmp___0 ; [L924] int retValue_acc ; [L927] retValue_acc = waterLevel [L928] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L49] tmp = getWaterLevel() [L51] COND FALSE !(tmp == 0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L489] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L491] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L497] tmp = __VERIFIER_nondet_int() [L499] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L507] tmp___0 = __VERIFIER_nondet_int() [L509] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L517] tmp___2 = __VERIFIER_nondet_int() [L519] COND TRUE \read(tmp___2) [L743] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L562] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L859] COND TRUE waterLevel > 0 [L860] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L569] COND TRUE \read(systemActive) [L591] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L594] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L44] int tmp ; [L45] int tmp___0 ; [L924] int retValue_acc ; [L927] retValue_acc = waterLevel [L928] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L49] tmp = getWaterLevel() [L51] COND FALSE !(tmp == 0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L489] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L491] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L497] tmp = __VERIFIER_nondet_int() [L499] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L507] tmp___0 = __VERIFIER_nondet_int() [L509] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L517] tmp___2 = __VERIFIER_nondet_int() [L519] COND TRUE \read(tmp___2) [L743] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L562] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L859] COND TRUE waterLevel > 0 [L860] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L569] COND TRUE \read(systemActive) [L591] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L594] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L44] int tmp ; [L45] int tmp___0 ; [L924] int retValue_acc ; [L927] retValue_acc = waterLevel [L928] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L49] tmp = getWaterLevel() [L51] COND TRUE tmp == 0 [L661] int retValue_acc ; [L664] retValue_acc = pumpRunning [L665] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L53] tmp___0 = isPumpRunning() [L55] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L752] __VERIFIER_error() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 89 locations, 3 error locations. Result: UNSAFE, OverallTime: 3.2s, OverallIterations: 11, TraceHistogramMax: 3, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 900 SDtfs, 1160 SDslu, 1447 SDs, 0 SdLazy, 201 SolverSat, 55 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 117 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=327occurred in iteration=10, 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, 10 MinimizatonAttempts, 1163 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 387 NumberOfCodeBlocks, 387 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 313 ConstructedInterpolants, 0 QuantifiedInterpolants, 19227 SizeOfPredicates, 4 NumberOfNonLiveVariables, 395 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 11 InterpolantComputations, 9 PerfectInterpolantSequences, 22/28 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...