./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec4_product40.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_product40.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 a7dbd4e152ee971b4407c7068d06d15a4635d510 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:47,188 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 00:22:47,191 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 00:22:47,211 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 00:22:47,211 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 00:22:47,213 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 00:22:47,215 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 00:22:47,225 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 00:22:47,231 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 00:22:47,235 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 00:22:47,236 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 00:22:47,238 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 00:22:47,238 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 00:22:47,241 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 00:22:47,242 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 00:22:47,244 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 00:22:47,245 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 00:22:47,246 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 00:22:47,249 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 00:22:47,253 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 00:22:47,258 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 00:22:47,264 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 00:22:47,265 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 00:22:47,268 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 00:22:47,271 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 00:22:47,271 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 00:22:47,271 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 00:22:47,273 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 00:22:47,273 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 00:22:47,274 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 00:22:47,274 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 00:22:47,275 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 00:22:47,276 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 00:22:47,277 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 00:22:47,278 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 00:22:47,278 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 00:22:47,279 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 00:22:47,279 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 00:22:47,280 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 00:22:47,280 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 00:22:47,282 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 00:22:47,283 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:47,320 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 00:22:47,322 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 00:22:47,323 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 00:22:47,325 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 00:22:47,325 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 00:22:47,325 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 00:22:47,325 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 00:22:47,325 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 00:22:47,326 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 00:22:47,326 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 00:22:47,326 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 00:22:47,326 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 00:22:47,326 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 00:22:47,327 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 00:22:47,327 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 00:22:47,327 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 00:22:47,327 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 00:22:47,327 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 00:22:47,328 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 00:22:47,328 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 00:22:47,328 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 00:22:47,328 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:22:47,329 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 00:22:47,329 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 00:22:47,329 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 00:22:47,329 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 00:22:47,329 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 00:22:47,330 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 00:22:47,330 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 -> a7dbd4e152ee971b4407c7068d06d15a4635d510 [2019-11-28 00:22:47,638 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 00:22:47,651 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 00:22:47,654 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 00:22:47,656 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 00:22:47,656 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 00:22:47,657 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec4_product40.cil.c [2019-11-28 00:22:47,731 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e325da3ae/aa437c4b475a48b1a57fe9574f81d09c/FLAG96724967d [2019-11-28 00:22:48,295 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 00:22:48,296 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product40.cil.c [2019-11-28 00:22:48,307 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e325da3ae/aa437c4b475a48b1a57fe9574f81d09c/FLAG96724967d [2019-11-28 00:22:48,575 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e325da3ae/aa437c4b475a48b1a57fe9574f81d09c [2019-11-28 00:22:48,579 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 00:22:48,580 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 00:22:48,582 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 00:22:48,582 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 00:22:48,585 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 00:22:48,586 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:22:48" (1/1) ... [2019-11-28 00:22:48,589 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62c880e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:48, skipping insertion in model container [2019-11-28 00:22:48,590 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:22:48" (1/1) ... [2019-11-28 00:22:48,598 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 00:22:48,638 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 00:22:49,105 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:22:49,118 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 00:22:49,199 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:22:49,236 INFO L208 MainTranslator]: Completed translation [2019-11-28 00:22:49,236 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:49 WrapperNode [2019-11-28 00:22:49,236 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 00:22:49,237 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 00:22:49,237 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 00:22:49,238 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 00:22:49,247 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:49" (1/1) ... [2019-11-28 00:22:49,268 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:49" (1/1) ... [2019-11-28 00:22:49,315 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 00:22:49,315 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 00:22:49,316 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 00:22:49,316 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 00:22:49,326 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:49" (1/1) ... [2019-11-28 00:22:49,326 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:49" (1/1) ... [2019-11-28 00:22:49,331 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:49" (1/1) ... [2019-11-28 00:22:49,332 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:49" (1/1) ... [2019-11-28 00:22:49,344 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:49" (1/1) ... [2019-11-28 00:22:49,354 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:49" (1/1) ... [2019-11-28 00:22:49,357 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:49" (1/1) ... [2019-11-28 00:22:49,362 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 00:22:49,363 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 00:22:49,363 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 00:22:49,363 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 00:22:49,364 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:49" (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:49,454 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 00:22:49,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-28 00:22:49,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 00:22:49,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 00:22:50,377 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 00:22:50,378 INFO L297 CfgBuilder]: Removed 162 assume(true) statements. [2019-11-28 00:22:50,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:22:50 BoogieIcfgContainer [2019-11-28 00:22:50,380 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 00:22:50,381 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 00:22:50,381 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 00:22:50,386 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 00:22:50,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:22:48" (1/3) ... [2019-11-28 00:22:50,389 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d1f6e1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:22:50, skipping insertion in model container [2019-11-28 00:22:50,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:49" (2/3) ... [2019-11-28 00:22:50,390 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d1f6e1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:22:50, skipping insertion in model container [2019-11-28 00:22:50,391 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:22:50" (3/3) ... [2019-11-28 00:22:50,393 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec4_product40.cil.c [2019-11-28 00:22:50,406 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 00:22:50,415 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-28 00:22:50,426 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-28 00:22:50,448 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 00:22:50,448 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 00:22:50,448 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 00:22:50,448 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 00:22:50,449 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 00:22:50,449 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 00:22:50,449 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 00:22:50,449 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 00:22:50,469 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states. [2019-11-28 00:22:50,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 00:22:50,477 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:50,478 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:50,479 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:50,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:50,485 INFO L82 PathProgramCache]: Analyzing trace with hash 2074315904, now seen corresponding path program 1 times [2019-11-28 00:22:50,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:50,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485726285] [2019-11-28 00:22:50,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:50,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:50,808 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:50,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485726285] [2019-11-28 00:22:50,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:50,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:22:50,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873667121] [2019-11-28 00:22:50,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 00:22:50,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:50,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 00:22:50,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 00:22:50,837 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 2 states. [2019-11-28 00:22:50,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:50,879 INFO L93 Difference]: Finished difference Result 220 states and 335 transitions. [2019-11-28 00:22:50,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 00:22:50,880 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-11-28 00:22:50,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:50,897 INFO L225 Difference]: With dead ends: 220 [2019-11-28 00:22:50,898 INFO L226 Difference]: Without dead ends: 109 [2019-11-28 00:22:50,904 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:50,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-28 00:22:50,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-11-28 00:22:50,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-28 00:22:50,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 159 transitions. [2019-11-28 00:22:50,952 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 159 transitions. Word has length 16 [2019-11-28 00:22:50,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:50,952 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 159 transitions. [2019-11-28 00:22:50,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 00:22:50,953 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 159 transitions. [2019-11-28 00:22:50,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 00:22:50,954 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:50,954 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:50,955 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:50,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:50,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1027559007, now seen corresponding path program 1 times [2019-11-28 00:22:50,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:50,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696561868] [2019-11-28 00:22:50,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:51,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:51,080 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:51,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696561868] [2019-11-28 00:22:51,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:51,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:22:51,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288163331] [2019-11-28 00:22:51,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:22:51,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:51,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:22:51,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:22:51,084 INFO L87 Difference]: Start difference. First operand 109 states and 159 transitions. Second operand 3 states. [2019-11-28 00:22:51,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:51,105 INFO L93 Difference]: Finished difference Result 109 states and 159 transitions. [2019-11-28 00:22:51,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:22:51,107 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 00:22:51,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:51,109 INFO L225 Difference]: With dead ends: 109 [2019-11-28 00:22:51,109 INFO L226 Difference]: Without dead ends: 47 [2019-11-28 00:22:51,112 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:51,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-28 00:22:51,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-11-28 00:22:51,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-28 00:22:51,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 68 transitions. [2019-11-28 00:22:51,124 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 68 transitions. Word has length 17 [2019-11-28 00:22:51,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:51,125 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 68 transitions. [2019-11-28 00:22:51,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:22:51,125 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 68 transitions. [2019-11-28 00:22:51,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 00:22:51,128 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:51,128 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:51,128 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:51,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:51,129 INFO L82 PathProgramCache]: Analyzing trace with hash 109011716, now seen corresponding path program 1 times [2019-11-28 00:22:51,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:51,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170056311] [2019-11-28 00:22:51,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:51,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:51,311 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:51,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170056311] [2019-11-28 00:22:51,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:51,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:22:51,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382895766] [2019-11-28 00:22:51,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:22:51,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:51,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:22:51,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:22:51,316 INFO L87 Difference]: Start difference. First operand 47 states and 68 transitions. Second operand 5 states. [2019-11-28 00:22:51,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:51,420 INFO L93 Difference]: Finished difference Result 111 states and 164 transitions. [2019-11-28 00:22:51,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:22:51,421 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-28 00:22:51,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:51,422 INFO L225 Difference]: With dead ends: 111 [2019-11-28 00:22:51,422 INFO L226 Difference]: Without dead ends: 70 [2019-11-28 00:22:51,423 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 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:51,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-28 00:22:51,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2019-11-28 00:22:51,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-28 00:22:51,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 97 transitions. [2019-11-28 00:22:51,434 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 97 transitions. Word has length 22 [2019-11-28 00:22:51,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:51,435 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 97 transitions. [2019-11-28 00:22:51,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:22:51,435 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 97 transitions. [2019-11-28 00:22:51,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 00:22:51,436 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:51,436 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 00:22:51,437 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:51,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:51,437 INFO L82 PathProgramCache]: Analyzing trace with hash 60563277, now seen corresponding path program 1 times [2019-11-28 00:22:51,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:51,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294662454] [2019-11-28 00:22:51,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:51,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:51,517 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:51,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294662454] [2019-11-28 00:22:51,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:51,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:22:51,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719266963] [2019-11-28 00:22:51,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:22:51,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:51,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:22:51,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:22:51,520 INFO L87 Difference]: Start difference. First operand 66 states and 97 transitions. Second operand 3 states. [2019-11-28 00:22:51,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:51,570 INFO L93 Difference]: Finished difference Result 147 states and 218 transitions. [2019-11-28 00:22:51,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:22:51,571 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-28 00:22:51,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:51,574 INFO L225 Difference]: With dead ends: 147 [2019-11-28 00:22:51,575 INFO L226 Difference]: Without dead ends: 87 [2019-11-28 00:22:51,576 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:51,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-11-28 00:22:51,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2019-11-28 00:22:51,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-11-28 00:22:51,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 121 transitions. [2019-11-28 00:22:51,588 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 121 transitions. Word has length 24 [2019-11-28 00:22:51,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:51,588 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 121 transitions. [2019-11-28 00:22:51,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:22:51,589 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 121 transitions. [2019-11-28 00:22:51,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 00:22:51,590 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:51,590 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:51,590 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:51,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:51,591 INFO L82 PathProgramCache]: Analyzing trace with hash -445763815, now seen corresponding path program 1 times [2019-11-28 00:22:51,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:51,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140362433] [2019-11-28 00:22:51,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:51,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:51,804 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:51,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140362433] [2019-11-28 00:22:51,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:51,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 00:22:51,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810562201] [2019-11-28 00:22:51,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 00:22:51,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:51,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 00:22:51,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-28 00:22:51,808 INFO L87 Difference]: Start difference. First operand 85 states and 121 transitions. Second operand 8 states. [2019-11-28 00:22:52,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:52,272 INFO L93 Difference]: Finished difference Result 537 states and 787 transitions. [2019-11-28 00:22:52,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 00:22:52,276 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2019-11-28 00:22:52,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:52,281 INFO L225 Difference]: With dead ends: 537 [2019-11-28 00:22:52,283 INFO L226 Difference]: Without dead ends: 458 [2019-11-28 00:22:52,285 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-11-28 00:22:52,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2019-11-28 00:22:52,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 212. [2019-11-28 00:22:52,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-11-28 00:22:52,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 296 transitions. [2019-11-28 00:22:52,361 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 296 transitions. Word has length 25 [2019-11-28 00:22:52,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:52,362 INFO L462 AbstractCegarLoop]: Abstraction has 212 states and 296 transitions. [2019-11-28 00:22:52,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 00:22:52,362 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 296 transitions. [2019-11-28 00:22:52,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-28 00:22:52,367 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:52,367 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 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] [2019-11-28 00:22:52,368 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:52,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:52,368 INFO L82 PathProgramCache]: Analyzing trace with hash 371468141, now seen corresponding path program 1 times [2019-11-28 00:22:52,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:52,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253759645] [2019-11-28 00:22:52,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:52,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:52,485 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-28 00:22:52,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253759645] [2019-11-28 00:22:52,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:52,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:22:52,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760534404] [2019-11-28 00:22:52,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:22:52,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:52,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:22:52,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:22:52,490 INFO L87 Difference]: Start difference. First operand 212 states and 296 transitions. Second operand 5 states. [2019-11-28 00:22:52,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:52,673 INFO L93 Difference]: Finished difference Result 498 states and 707 transitions. [2019-11-28 00:22:52,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 00:22:52,674 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-11-28 00:22:52,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:52,677 INFO L225 Difference]: With dead ends: 498 [2019-11-28 00:22:52,677 INFO L226 Difference]: Without dead ends: 496 [2019-11-28 00:22:52,678 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:52,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2019-11-28 00:22:52,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 212. [2019-11-28 00:22:52,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-11-28 00:22:52,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 294 transitions. [2019-11-28 00:22:52,702 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 294 transitions. Word has length 41 [2019-11-28 00:22:52,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:52,702 INFO L462 AbstractCegarLoop]: Abstraction has 212 states and 294 transitions. [2019-11-28 00:22:52,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:22:52,703 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 294 transitions. [2019-11-28 00:22:52,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-28 00:22:52,705 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:52,705 INFO L410 BasicCegarLoop]: trace histogram [2, 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] [2019-11-28 00:22:52,706 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:52,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:52,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1694698835, now seen corresponding path program 1 times [2019-11-28 00:22:52,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:52,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616868182] [2019-11-28 00:22:52,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:52,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:52,768 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-28 00:22:52,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616868182] [2019-11-28 00:22:52,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:52,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:22:52,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980262009] [2019-11-28 00:22:52,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:22:52,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:52,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:22:52,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:22:52,771 INFO L87 Difference]: Start difference. First operand 212 states and 294 transitions. Second operand 5 states. [2019-11-28 00:22:52,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:52,878 INFO L93 Difference]: Finished difference Result 647 states and 890 transitions. [2019-11-28 00:22:52,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:22:52,879 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-11-28 00:22:52,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:52,882 INFO L225 Difference]: With dead ends: 647 [2019-11-28 00:22:52,882 INFO L226 Difference]: Without dead ends: 441 [2019-11-28 00:22:52,884 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:52,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2019-11-28 00:22:52,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 227. [2019-11-28 00:22:52,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-11-28 00:22:52,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 309 transitions. [2019-11-28 00:22:52,912 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 309 transitions. Word has length 48 [2019-11-28 00:22:52,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:52,913 INFO L462 AbstractCegarLoop]: Abstraction has 227 states and 309 transitions. [2019-11-28 00:22:52,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:22:52,913 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 309 transitions. [2019-11-28 00:22:52,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-28 00:22:52,915 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:52,915 INFO L410 BasicCegarLoop]: trace histogram [2, 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] [2019-11-28 00:22:52,916 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:52,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:52,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1301671825, now seen corresponding path program 1 times [2019-11-28 00:22:52,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:52,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326990156] [2019-11-28 00:22:52,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:52,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:52,996 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-28 00:22:52,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326990156] [2019-11-28 00:22:52,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:52,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 00:22:52,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120766203] [2019-11-28 00:22:52,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 00:22:52,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:53,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 00:22:53,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 00:22:53,000 INFO L87 Difference]: Start difference. First operand 227 states and 309 transitions. Second operand 6 states. [2019-11-28 00:22:53,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:53,168 INFO L93 Difference]: Finished difference Result 604 states and 821 transitions. [2019-11-28 00:22:53,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 00:22:53,168 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2019-11-28 00:22:53,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:53,171 INFO L225 Difference]: With dead ends: 604 [2019-11-28 00:22:53,171 INFO L226 Difference]: Without dead ends: 383 [2019-11-28 00:22:53,172 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-28 00:22:53,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2019-11-28 00:22:53,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 205. [2019-11-28 00:22:53,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-11-28 00:22:53,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 274 transitions. [2019-11-28 00:22:53,196 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 274 transitions. Word has length 48 [2019-11-28 00:22:53,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:53,198 INFO L462 AbstractCegarLoop]: Abstraction has 205 states and 274 transitions. [2019-11-28 00:22:53,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 00:22:53,198 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 274 transitions. [2019-11-28 00:22:53,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-28 00:22:53,200 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:53,200 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, 1, 1] [2019-11-28 00:22:53,201 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:53,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:53,201 INFO L82 PathProgramCache]: Analyzing trace with hash -103400707, now seen corresponding path program 1 times [2019-11-28 00:22:53,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:53,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21201147] [2019-11-28 00:22:53,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:53,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:53,291 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:53,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21201147] [2019-11-28 00:22:53,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [729334254] [2019-11-28 00:22:53,292 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:53,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:53,426 INFO L255 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 00:22:53,434 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:22:53,480 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:53,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:22:53,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2019-11-28 00:22:53,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175620042] [2019-11-28 00:22:53,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 00:22:53,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:53,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 00:22:53,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-28 00:22:53,484 INFO L87 Difference]: Start difference. First operand 205 states and 274 transitions. Second operand 8 states. [2019-11-28 00:22:53,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:53,782 INFO L93 Difference]: Finished difference Result 715 states and 980 transitions. [2019-11-28 00:22:53,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 00:22:53,782 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2019-11-28 00:22:53,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:53,786 INFO L225 Difference]: With dead ends: 715 [2019-11-28 00:22:53,786 INFO L226 Difference]: Without dead ends: 558 [2019-11-28 00:22:53,787 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 54 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:53,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2019-11-28 00:22:53,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 268. [2019-11-28 00:22:53,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-11-28 00:22:53,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 357 transitions. [2019-11-28 00:22:53,824 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 357 transitions. Word has length 50 [2019-11-28 00:22:53,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:53,825 INFO L462 AbstractCegarLoop]: Abstraction has 268 states and 357 transitions. [2019-11-28 00:22:53,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 00:22:53,825 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 357 transitions. [2019-11-28 00:22:53,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-28 00:22:53,826 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:53,826 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-28 00:22:54,031 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:22:54,032 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:54,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:54,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1377844072, now seen corresponding path program 2 times [2019-11-28 00:22:54,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:54,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071521585] [2019-11-28 00:22:54,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:54,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 00:22:54,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 00:22:54,202 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 00:22:54,202 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 00:22:54,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:22:54 BoogieIcfgContainer [2019-11-28 00:22:54,335 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 00:22:54,336 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 00:22:54,336 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 00:22:54,336 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 00:22:54,338 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:50" (3/4) ... [2019-11-28 00:22:54,344 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 00:22:54,583 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 00:22:54,583 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 00:22:54,588 INFO L168 Benchmark]: Toolchain (without parser) took 6004.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 212.3 MB). Free memory was 955.0 MB in the beginning and 994.1 MB in the end (delta: -39.1 MB). Peak memory consumption was 173.2 MB. Max. memory is 11.5 GB. [2019-11-28 00:22:54,588 INFO L168 Benchmark]: CDTParser took 0.19 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 00:22:54,588 INFO L168 Benchmark]: CACSL2BoogieTranslator took 655.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -157.2 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. [2019-11-28 00:22:54,591 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.92 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: 8.5 MB). Peak memory consumption was 8.5 MB. Max. memory is 11.5 GB. [2019-11-28 00:22:54,591 INFO L168 Benchmark]: Boogie Preprocessor took 47.22 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:54,591 INFO L168 Benchmark]: RCFGBuilder took 1016.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 59.3 MB). Peak memory consumption was 59.3 MB. Max. memory is 11.5 GB. [2019-11-28 00:22:54,592 INFO L168 Benchmark]: TraceAbstraction took 3954.73 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 82.8 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 17.7 MB). Peak memory consumption was 100.5 MB. Max. memory is 11.5 GB. [2019-11-28 00:22:54,593 INFO L168 Benchmark]: Witness Printer took 247.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 994.1 MB in the end (delta: 32.5 MB). Peak memory consumption was 32.5 MB. Max. memory is 11.5 GB. [2019-11-28 00:22:54,596 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.19 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 655.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -157.2 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 77.92 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: 8.5 MB). Peak memory consumption was 8.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 47.22 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 1016.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 59.3 MB). Peak memory consumption was 59.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3954.73 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 82.8 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 17.7 MB). Peak memory consumption was 100.5 MB. Max. memory is 11.5 GB. * Witness Printer took 247.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 994.1 MB in the end (delta: 32.5 MB). Peak memory consumption was 32.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 329]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L123] int pumpRunning = 0; [L124] int systemActive = 1; [L334] int cleanupTimeShifts = 4; [L434] int waterLevel = 1; [L435] int methaneLevelCritical = 0; [L697] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L410] int retValue_acc ; [L411] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L946] int retValue_acc ; [L949] retValue_acc = 1 [L950] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L417] tmp = valid_product() [L419] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L47] int splverifierCounter ; [L48] int tmp ; [L49] int tmp___0 ; [L50] int tmp___1 ; [L51] int tmp___2 ; [L54] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L56] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L58] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L64] tmp = __VERIFIER_nondet_int() [L66] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L452] COND TRUE waterLevel < 2 [L453] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L74] tmp___0 = __VERIFIER_nondet_int() [L76] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L84] tmp___2 = __VERIFIER_nondet_int() [L86] COND TRUE \read(tmp___2) [L320] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L131] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L138] COND TRUE \read(systemActive) [L186] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L189] COND FALSE !(\read(pumpRunning)) [L160] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L163] COND TRUE ! pumpRunning [L283] int retValue_acc ; [L284] int tmp ; [L285] int tmp___0 ; [L514] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L517] COND FALSE !(waterLevel < 2) [L521] retValue_acc = 0 [L522] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L289] tmp = isHighWaterSensorDry() [L291] COND FALSE !(\read(tmp)) [L294] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L296] retValue_acc = tmp___0 [L297] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L165] tmp = isHighWaterLevel() [L167] COND TRUE \read(tmp) [L214] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L895] int tmp ; [L896] int tmp___0 ; [L505] int retValue_acc ; [L508] retValue_acc = waterLevel [L509] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L900] tmp = getWaterLevel() [L902] COND FALSE !(tmp == 0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L56] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L58] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L64] tmp = __VERIFIER_nondet_int() [L66] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L74] tmp___0 = __VERIFIER_nondet_int() [L76] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L84] tmp___2 = __VERIFIER_nondet_int() [L86] COND TRUE \read(tmp___2) [L320] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L131] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L440] COND TRUE waterLevel > 0 [L441] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L138] COND TRUE \read(systemActive) [L186] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L189] COND TRUE \read(pumpRunning) [L227] int retValue_acc ; [L473] int retValue_acc ; [L476] retValue_acc = methaneLevelCritical [L477] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L231] retValue_acc = isMethaneLevelCritical() [L233] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L191] tmp = isMethaneAlarm() [L193] COND FALSE !(\read(tmp)) [L160] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L163] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L895] int tmp ; [L896] int tmp___0 ; [L505] int retValue_acc ; [L508] retValue_acc = waterLevel [L509] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L900] tmp = getWaterLevel() [L902] COND FALSE !(tmp == 0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L56] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L58] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L64] tmp = __VERIFIER_nondet_int() [L66] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L74] tmp___0 = __VERIFIER_nondet_int() [L76] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L84] tmp___2 = __VERIFIER_nondet_int() [L86] COND TRUE \read(tmp___2) [L320] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L131] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L440] COND TRUE waterLevel > 0 [L441] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L138] COND TRUE \read(systemActive) [L186] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L189] COND TRUE \read(pumpRunning) [L227] int retValue_acc ; [L473] int retValue_acc ; [L476] retValue_acc = methaneLevelCritical [L477] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L231] retValue_acc = isMethaneLevelCritical() [L233] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L191] tmp = isMethaneAlarm() [L193] COND FALSE !(\read(tmp)) [L160] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L163] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L895] int tmp ; [L896] int tmp___0 ; [L505] int retValue_acc ; [L508] retValue_acc = waterLevel [L509] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L900] tmp = getWaterLevel() [L902] COND TRUE tmp == 0 [L238] int retValue_acc ; [L241] retValue_acc = pumpRunning [L242] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L904] tmp___0 = isPumpRunning() [L906] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L329] __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, 113 locations, 3 error locations. Result: UNSAFE, OverallTime: 3.7s, OverallIterations: 10, TraceHistogramMax: 3, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 911 SDtfs, 1783 SDslu, 1953 SDs, 0 SdLazy, 309 SolverSat, 76 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 131 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=268occurred in iteration=9, 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, 9 MinimizatonAttempts, 1218 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 410 NumberOfCodeBlocks, 410 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 331 ConstructedInterpolants, 0 QuantifiedInterpolants, 24581 SizeOfPredicates, 4 NumberOfNonLiveVariables, 398 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 10 InterpolantComputations, 8 PerfectInterpolantSequences, 65/71 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...