./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec1_product43.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_spec1_product43.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 63b48aee14c7431a4aa25f8de4f2dd8129d50ad4 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:20:17,457 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 00:20:17,460 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 00:20:17,481 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 00:20:17,481 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 00:20:17,483 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 00:20:17,485 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 00:20:17,495 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 00:20:17,500 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 00:20:17,503 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 00:20:17,504 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 00:20:17,506 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 00:20:17,506 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 00:20:17,510 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 00:20:17,511 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 00:20:17,513 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 00:20:17,514 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 00:20:17,515 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 00:20:17,517 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 00:20:17,518 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 00:20:17,520 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 00:20:17,521 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 00:20:17,522 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 00:20:17,523 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 00:20:17,525 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 00:20:17,525 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 00:20:17,525 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 00:20:17,526 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 00:20:17,527 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 00:20:17,529 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 00:20:17,529 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 00:20:17,530 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 00:20:17,531 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 00:20:17,532 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 00:20:17,534 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 00:20:17,534 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 00:20:17,535 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 00:20:17,535 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 00:20:17,535 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 00:20:17,536 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 00:20:17,538 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 00:20:17,539 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:20:17,572 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 00:20:17,574 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 00:20:17,575 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 00:20:17,576 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 00:20:17,576 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 00:20:17,576 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 00:20:17,577 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 00:20:17,577 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 00:20:17,577 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 00:20:17,577 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 00:20:17,578 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 00:20:17,579 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 00:20:17,579 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 00:20:17,579 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 00:20:17,580 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 00:20:17,580 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 00:20:17,580 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 00:20:17,581 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 00:20:17,581 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 00:20:17,581 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 00:20:17,581 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 00:20:17,582 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:20:17,582 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 00:20:17,582 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 00:20:17,583 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 00:20:17,583 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 00:20:17,583 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 00:20:17,583 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 00:20:17,584 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 -> 63b48aee14c7431a4aa25f8de4f2dd8129d50ad4 [2019-11-28 00:20:17,886 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 00:20:17,900 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 00:20:17,904 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 00:20:17,905 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 00:20:17,906 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 00:20:17,907 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec1_product43.cil.c [2019-11-28 00:20:17,984 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/063bae239/eeeccaa5d83c48cca67ecd6a0df7365c/FLAG6e7fdbf09 [2019-11-28 00:20:18,545 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 00:20:18,546 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product43.cil.c [2019-11-28 00:20:18,561 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/063bae239/eeeccaa5d83c48cca67ecd6a0df7365c/FLAG6e7fdbf09 [2019-11-28 00:20:18,841 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/063bae239/eeeccaa5d83c48cca67ecd6a0df7365c [2019-11-28 00:20:18,845 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 00:20:18,846 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 00:20:18,847 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 00:20:18,847 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 00:20:18,851 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 00:20:18,852 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:20:18" (1/1) ... [2019-11-28 00:20:18,857 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2277f3fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:18, skipping insertion in model container [2019-11-28 00:20:18,857 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:20:18" (1/1) ... [2019-11-28 00:20:18,865 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 00:20:18,934 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 00:20:19,375 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:20:19,392 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 00:20:19,474 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:20:19,509 INFO L208 MainTranslator]: Completed translation [2019-11-28 00:20:19,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:19 WrapperNode [2019-11-28 00:20:19,510 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 00:20:19,512 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 00:20:19,512 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 00:20:19,512 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 00:20:19,521 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:20:19" (1/1) ... [2019-11-28 00:20:19,544 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:20:19" (1/1) ... [2019-11-28 00:20:19,584 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 00:20:19,585 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 00:20:19,585 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 00:20:19,585 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 00:20:19,594 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:19" (1/1) ... [2019-11-28 00:20:19,594 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:19" (1/1) ... [2019-11-28 00:20:19,598 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:19" (1/1) ... [2019-11-28 00:20:19,599 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:19" (1/1) ... [2019-11-28 00:20:19,609 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:19" (1/1) ... [2019-11-28 00:20:19,617 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:19" (1/1) ... [2019-11-28 00:20:19,621 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:19" (1/1) ... [2019-11-28 00:20:19,626 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 00:20:19,626 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 00:20:19,626 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 00:20:19,626 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 00:20:19,627 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:19" (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:20:19,706 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 00:20:19,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-28 00:20:19,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 00:20:19,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 00:20:20,540 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 00:20:20,542 INFO L297 CfgBuilder]: Removed 118 assume(true) statements. [2019-11-28 00:20:20,544 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:20:20 BoogieIcfgContainer [2019-11-28 00:20:20,544 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 00:20:20,547 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 00:20:20,548 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 00:20:20,552 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 00:20:20,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:20:18" (1/3) ... [2019-11-28 00:20:20,554 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44d21e62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:20:20, skipping insertion in model container [2019-11-28 00:20:20,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:19" (2/3) ... [2019-11-28 00:20:20,555 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44d21e62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:20:20, skipping insertion in model container [2019-11-28 00:20:20,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:20:20" (3/3) ... [2019-11-28 00:20:20,561 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product43.cil.c [2019-11-28 00:20:20,573 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 00:20:20,581 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-28 00:20:20,594 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-28 00:20:20,620 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 00:20:20,620 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 00:20:20,620 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 00:20:20,620 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 00:20:20,620 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 00:20:20,621 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 00:20:20,621 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 00:20:20,621 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 00:20:20,639 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states. [2019-11-28 00:20:20,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 00:20:20,649 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:20,650 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:20:20,651 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:20,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:20,656 INFO L82 PathProgramCache]: Analyzing trace with hash 929673937, now seen corresponding path program 1 times [2019-11-28 00:20:20,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:20,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640588039] [2019-11-28 00:20:20,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:20,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:20,894 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:20:20,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640588039] [2019-11-28 00:20:20,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:20,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:20:20,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583389484] [2019-11-28 00:20:20,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 00:20:20,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:20,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 00:20:20,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 00:20:20,915 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 2 states. [2019-11-28 00:20:20,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:20,948 INFO L93 Difference]: Finished difference Result 172 states and 257 transitions. [2019-11-28 00:20:20,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 00:20:20,950 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-11-28 00:20:20,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:20,964 INFO L225 Difference]: With dead ends: 172 [2019-11-28 00:20:20,964 INFO L226 Difference]: Without dead ends: 85 [2019-11-28 00:20:20,969 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:20:20,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-11-28 00:20:21,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-11-28 00:20:21,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-11-28 00:20:21,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 120 transitions. [2019-11-28 00:20:21,022 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 120 transitions. Word has length 16 [2019-11-28 00:20:21,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:21,022 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 120 transitions. [2019-11-28 00:20:21,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 00:20:21,023 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 120 transitions. [2019-11-28 00:20:21,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 00:20:21,024 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:21,024 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:20:21,024 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:21,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:21,025 INFO L82 PathProgramCache]: Analyzing trace with hash -117082960, now seen corresponding path program 1 times [2019-11-28 00:20:21,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:21,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655252829] [2019-11-28 00:20:21,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:21,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:21,150 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:20:21,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655252829] [2019-11-28 00:20:21,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:21,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:20:21,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280691840] [2019-11-28 00:20:21,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:20:21,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:21,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:20:21,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:20:21,157 INFO L87 Difference]: Start difference. First operand 85 states and 120 transitions. Second operand 3 states. [2019-11-28 00:20:21,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:21,182 INFO L93 Difference]: Finished difference Result 85 states and 120 transitions. [2019-11-28 00:20:21,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:20:21,185 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 00:20:21,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:21,187 INFO L225 Difference]: With dead ends: 85 [2019-11-28 00:20:21,187 INFO L226 Difference]: Without dead ends: 39 [2019-11-28 00:20:21,189 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:20:21,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-11-28 00:20:21,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-11-28 00:20:21,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-28 00:20:21,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 55 transitions. [2019-11-28 00:20:21,204 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 55 transitions. Word has length 17 [2019-11-28 00:20:21,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:21,205 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 55 transitions. [2019-11-28 00:20:21,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:20:21,205 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 55 transitions. [2019-11-28 00:20:21,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 00:20:21,208 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:21,208 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:20:21,209 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:21,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:21,209 INFO L82 PathProgramCache]: Analyzing trace with hash 337421565, now seen corresponding path program 1 times [2019-11-28 00:20:21,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:21,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074077621] [2019-11-28 00:20:21,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:21,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:21,365 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:20:21,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074077621] [2019-11-28 00:20:21,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:21,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:20:21,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601672763] [2019-11-28 00:20:21,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 00:20:21,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:21,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 00:20:21,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 00:20:21,368 INFO L87 Difference]: Start difference. First operand 39 states and 55 transitions. Second operand 6 states. [2019-11-28 00:20:21,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:21,527 INFO L93 Difference]: Finished difference Result 128 states and 187 transitions. [2019-11-28 00:20:21,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:20:21,529 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-11-28 00:20:21,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:21,531 INFO L225 Difference]: With dead ends: 128 [2019-11-28 00:20:21,531 INFO L226 Difference]: Without dead ends: 95 [2019-11-28 00:20:21,532 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-28 00:20:21,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-11-28 00:20:21,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 58. [2019-11-28 00:20:21,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-28 00:20:21,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 84 transitions. [2019-11-28 00:20:21,544 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 84 transitions. Word has length 22 [2019-11-28 00:20:21,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:21,544 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 84 transitions. [2019-11-28 00:20:21,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 00:20:21,545 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 84 transitions. [2019-11-28 00:20:21,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 00:20:21,546 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:21,546 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:20:21,547 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:21,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:21,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1224569535, now seen corresponding path program 1 times [2019-11-28 00:20:21,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:21,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333952765] [2019-11-28 00:20:21,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:21,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:21,600 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:20:21,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333952765] [2019-11-28 00:20:21,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:21,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:20:21,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376628578] [2019-11-28 00:20:21,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:20:21,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:21,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:20:21,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:20:21,602 INFO L87 Difference]: Start difference. First operand 58 states and 84 transitions. Second operand 3 states. [2019-11-28 00:20:21,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:21,641 INFO L93 Difference]: Finished difference Result 131 states and 192 transitions. [2019-11-28 00:20:21,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:20:21,642 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-28 00:20:21,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:21,643 INFO L225 Difference]: With dead ends: 131 [2019-11-28 00:20:21,643 INFO L226 Difference]: Without dead ends: 79 [2019-11-28 00:20:21,644 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:20:21,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-11-28 00:20:21,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2019-11-28 00:20:21,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-28 00:20:21,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 109 transitions. [2019-11-28 00:20:21,656 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 109 transitions. Word has length 23 [2019-11-28 00:20:21,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:21,656 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 109 transitions. [2019-11-28 00:20:21,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:20:21,657 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 109 transitions. [2019-11-28 00:20:21,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 00:20:21,658 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:21,658 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:20:21,658 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:21,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:21,659 INFO L82 PathProgramCache]: Analyzing trace with hash -840484654, now seen corresponding path program 1 times [2019-11-28 00:20:21,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:21,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871914932] [2019-11-28 00:20:21,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:21,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:21,736 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:20:21,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871914932] [2019-11-28 00:20:21,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:21,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:20:21,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106063692] [2019-11-28 00:20:21,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:20:21,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:21,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:20:21,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:20:21,740 INFO L87 Difference]: Start difference. First operand 77 states and 109 transitions. Second operand 5 states. [2019-11-28 00:20:21,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:21,901 INFO L93 Difference]: Finished difference Result 371 states and 539 transitions. [2019-11-28 00:20:21,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 00:20:21,902 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-11-28 00:20:21,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:21,904 INFO L225 Difference]: With dead ends: 371 [2019-11-28 00:20:21,904 INFO L226 Difference]: Without dead ends: 300 [2019-11-28 00:20:21,907 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:20:21,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-11-28 00:20:21,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 140. [2019-11-28 00:20:21,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-11-28 00:20:21,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 196 transitions. [2019-11-28 00:20:21,953 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 196 transitions. Word has length 25 [2019-11-28 00:20:21,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:21,954 INFO L462 AbstractCegarLoop]: Abstraction has 140 states and 196 transitions. [2019-11-28 00:20:21,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:20:21,954 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 196 transitions. [2019-11-28 00:20:21,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 00:20:21,955 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:21,958 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:20:21,958 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:21,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:21,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1044291748, now seen corresponding path program 1 times [2019-11-28 00:20:21,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:21,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720862650] [2019-11-28 00:20:21,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:22,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:22,065 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:20:22,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720862650] [2019-11-28 00:20:22,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:22,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:20:22,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214455018] [2019-11-28 00:20:22,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:20:22,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:22,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:20:22,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:20:22,068 INFO L87 Difference]: Start difference. First operand 140 states and 196 transitions. Second operand 5 states. [2019-11-28 00:20:22,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:22,230 INFO L93 Difference]: Finished difference Result 392 states and 553 transitions. [2019-11-28 00:20:22,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 00:20:22,231 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-28 00:20:22,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:22,234 INFO L225 Difference]: With dead ends: 392 [2019-11-28 00:20:22,234 INFO L226 Difference]: Without dead ends: 390 [2019-11-28 00:20:22,236 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:20:22,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2019-11-28 00:20:22,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 140. [2019-11-28 00:20:22,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-11-28 00:20:22,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 194 transitions. [2019-11-28 00:20:22,269 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 194 transitions. Word has length 26 [2019-11-28 00:20:22,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:22,270 INFO L462 AbstractCegarLoop]: Abstraction has 140 states and 194 transitions. [2019-11-28 00:20:22,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:20:22,270 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 194 transitions. [2019-11-28 00:20:22,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-28 00:20:22,277 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:22,278 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:20:22,281 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:22,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:22,282 INFO L82 PathProgramCache]: Analyzing trace with hash 895513141, now seen corresponding path program 1 times [2019-11-28 00:20:22,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:22,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804705981] [2019-11-28 00:20:22,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:22,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:22,377 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:20:22,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804705981] [2019-11-28 00:20:22,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:22,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:20:22,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522777503] [2019-11-28 00:20:22,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:20:22,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:22,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:20:22,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:20:22,380 INFO L87 Difference]: Start difference. First operand 140 states and 194 transitions. Second operand 5 states. [2019-11-28 00:20:22,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:22,470 INFO L93 Difference]: Finished difference Result 426 states and 588 transitions. [2019-11-28 00:20:22,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:20:22,471 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-11-28 00:20:22,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:22,473 INFO L225 Difference]: With dead ends: 426 [2019-11-28 00:20:22,473 INFO L226 Difference]: Without dead ends: 292 [2019-11-28 00:20:22,474 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:20:22,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-11-28 00:20:22,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 146. [2019-11-28 00:20:22,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-28 00:20:22,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 200 transitions. [2019-11-28 00:20:22,494 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 200 transitions. Word has length 33 [2019-11-28 00:20:22,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:22,495 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 200 transitions. [2019-11-28 00:20:22,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:20:22,495 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 200 transitions. [2019-11-28 00:20:22,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-28 00:20:22,496 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:22,496 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:20:22,497 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:22,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:22,497 INFO L82 PathProgramCache]: Analyzing trace with hash 308707127, now seen corresponding path program 1 times [2019-11-28 00:20:22,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:22,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45042646] [2019-11-28 00:20:22,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:22,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:22,568 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:20:22,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45042646] [2019-11-28 00:20:22,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:22,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 00:20:22,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20659884] [2019-11-28 00:20:22,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 00:20:22,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:22,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 00:20:22,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 00:20:22,570 INFO L87 Difference]: Start difference. First operand 146 states and 200 transitions. Second operand 6 states. [2019-11-28 00:20:22,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:22,666 INFO L93 Difference]: Finished difference Result 444 states and 606 transitions. [2019-11-28 00:20:22,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 00:20:22,666 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-11-28 00:20:22,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:22,668 INFO L225 Difference]: With dead ends: 444 [2019-11-28 00:20:22,668 INFO L226 Difference]: Without dead ends: 304 [2019-11-28 00:20:22,669 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:20:22,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-11-28 00:20:22,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 150. [2019-11-28 00:20:22,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-11-28 00:20:22,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 204 transitions. [2019-11-28 00:20:22,693 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 204 transitions. Word has length 33 [2019-11-28 00:20:22,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:22,693 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 204 transitions. [2019-11-28 00:20:22,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 00:20:22,694 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 204 transitions. [2019-11-28 00:20:22,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-28 00:20:22,695 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:22,695 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:20:22,695 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:22,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:22,696 INFO L82 PathProgramCache]: Analyzing trace with hash -971156551, now seen corresponding path program 1 times [2019-11-28 00:20:22,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:22,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624445083] [2019-11-28 00:20:22,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:22,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:22,743 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:20:22,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624445083] [2019-11-28 00:20:22,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:22,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:20:22,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381106576] [2019-11-28 00:20:22,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:20:22,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:22,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:20:22,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:20:22,746 INFO L87 Difference]: Start difference. First operand 150 states and 204 transitions. Second operand 3 states. [2019-11-28 00:20:22,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:22,795 INFO L93 Difference]: Finished difference Result 380 states and 516 transitions. [2019-11-28 00:20:22,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:20:22,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-28 00:20:22,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:22,797 INFO L225 Difference]: With dead ends: 380 [2019-11-28 00:20:22,797 INFO L226 Difference]: Without dead ends: 236 [2019-11-28 00:20:22,798 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:20:22,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-11-28 00:20:22,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2019-11-28 00:20:22,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-11-28 00:20:22,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 312 transitions. [2019-11-28 00:20:22,837 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 312 transitions. Word has length 33 [2019-11-28 00:20:22,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:22,838 INFO L462 AbstractCegarLoop]: Abstraction has 236 states and 312 transitions. [2019-11-28 00:20:22,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:20:22,838 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 312 transitions. [2019-11-28 00:20:22,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-28 00:20:22,839 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:22,839 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:20:22,840 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:22,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:22,840 INFO L82 PathProgramCache]: Analyzing trace with hash 186139387, now seen corresponding path program 1 times [2019-11-28 00:20:22,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:22,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529442762] [2019-11-28 00:20:22,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:22,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:22,992 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:20:22,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529442762] [2019-11-28 00:20:22,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:22,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 00:20:22,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587595146] [2019-11-28 00:20:22,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 00:20:22,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:22,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 00:20:22,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-28 00:20:22,994 INFO L87 Difference]: Start difference. First operand 236 states and 312 transitions. Second operand 8 states. [2019-11-28 00:20:23,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:23,423 INFO L93 Difference]: Finished difference Result 874 states and 1160 transitions. [2019-11-28 00:20:23,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-28 00:20:23,424 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-11-28 00:20:23,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:23,428 INFO L225 Difference]: With dead ends: 874 [2019-11-28 00:20:23,428 INFO L226 Difference]: Without dead ends: 644 [2019-11-28 00:20:23,430 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=281, Unknown=0, NotChecked=0, Total=420 [2019-11-28 00:20:23,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2019-11-28 00:20:23,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 236. [2019-11-28 00:20:23,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-11-28 00:20:23,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 306 transitions. [2019-11-28 00:20:23,464 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 306 transitions. Word has length 34 [2019-11-28 00:20:23,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:23,465 INFO L462 AbstractCegarLoop]: Abstraction has 236 states and 306 transitions. [2019-11-28 00:20:23,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 00:20:23,465 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 306 transitions. [2019-11-28 00:20:23,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-28 00:20:23,466 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:23,467 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:20:23,467 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:23,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:23,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1466712466, now seen corresponding path program 1 times [2019-11-28 00:20:23,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:23,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164699893] [2019-11-28 00:20:23,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:23,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 00:20:23,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 00:20:23,638 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 00:20:23,638 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 00:20:23,760 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:20:23 BoogieIcfgContainer [2019-11-28 00:20:23,762 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 00:20:23,763 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 00:20:23,763 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 00:20:23,764 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 00:20:23,764 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:20:20" (3/4) ... [2019-11-28 00:20:23,767 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 00:20:23,998 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 00:20:23,999 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 00:20:24,003 INFO L168 Benchmark]: Toolchain (without parser) took 5154.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 212.3 MB). Free memory was 960.4 MB in the beginning and 1.0 GB in the end (delta: -86.0 MB). Peak memory consumption was 126.3 MB. Max. memory is 11.5 GB. [2019-11-28 00:20:24,004 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:20:24,005 INFO L168 Benchmark]: CACSL2BoogieTranslator took 664.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -156.7 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2019-11-28 00:20:24,005 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.50 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:20:24,005 INFO L168 Benchmark]: Boogie Preprocessor took 41.04 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:20:24,006 INFO L168 Benchmark]: RCFGBuilder took 918.14 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: 66.3 MB). Peak memory consumption was 66.3 MB. Max. memory is 11.5 GB. [2019-11-28 00:20:24,007 INFO L168 Benchmark]: TraceAbstraction took 3215.71 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 78.6 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -25.7 MB). Peak memory consumption was 52.9 MB. Max. memory is 11.5 GB. [2019-11-28 00:20:24,007 INFO L168 Benchmark]: Witness Printer took 235.74 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: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. [2019-11-28 00:20:24,009 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 664.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -156.7 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 72.50 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 41.04 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 918.14 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: 66.3 MB). Peak memory consumption was 66.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3215.71 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 78.6 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -25.7 MB). Peak memory consumption was 52.9 MB. Max. memory is 11.5 GB. * Witness Printer took 235.74 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: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 405]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L47] int waterLevel = 1; [L48] int methaneLevelCritical = 0; [L147] int pumpRunning = 0; [L148] int systemActive = 1; [L436] int cleanupTimeShifts = 4; [L704] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L512] int retValue_acc ; [L513] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L927] int retValue_acc ; [L930] retValue_acc = 1 [L931] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L519] tmp = valid_product() [L521] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L335] int splverifierCounter ; [L336] int tmp ; [L337] int tmp___0 ; [L338] int tmp___1 ; [L339] int tmp___2 ; [L342] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L344] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L346] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L352] tmp = __VERIFIER_nondet_int() [L354] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L65] COND TRUE waterLevel < 2 [L66] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L362] tmp___0 = __VERIFIER_nondet_int() [L364] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L372] tmp___2 = __VERIFIER_nondet_int() [L374] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L155] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L162] COND TRUE \read(systemActive) [L184] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L187] COND TRUE ! pumpRunning [L299] int retValue_acc ; [L300] int tmp ; [L301] int tmp___0 ; [L127] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L130] COND FALSE !(waterLevel < 2) [L134] retValue_acc = 0 [L135] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L305] tmp = isHighWaterSensorDry() [L307] COND FALSE !(\read(tmp)) [L310] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L312] retValue_acc = tmp___0 [L313] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L189] tmp = isHighWaterLevel() [L191] COND TRUE \read(tmp) [L218] int tmp ; [L243] int retValue_acc ; [L86] int retValue_acc ; [L89] retValue_acc = methaneLevelCritical [L90] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L247] retValue_acc = isMethaneLevelCritical() [L249] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L222] tmp = isMethaneAlarm() [L224] COND FALSE !(\read(tmp)) [L212] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L411] int tmp ; [L412] int tmp___0 ; [L86] int retValue_acc ; [L89] retValue_acc = methaneLevelCritical [L90] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L416] tmp = isMethaneLevelCritical() [L418] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L344] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L346] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L352] tmp = __VERIFIER_nondet_int() [L354] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L362] tmp___0 = __VERIFIER_nondet_int() [L364] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L77] COND FALSE !(\read(methaneLevelCritical)) [L80] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L372] tmp___2 = __VERIFIER_nondet_int() [L374] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L155] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L53] COND TRUE waterLevel > 0 [L54] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L162] COND TRUE \read(systemActive) [L184] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L187] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L411] int tmp ; [L412] int tmp___0 ; [L86] int retValue_acc ; [L89] retValue_acc = methaneLevelCritical [L90] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L416] tmp = isMethaneLevelCritical() [L418] COND TRUE \read(tmp) [L254] int retValue_acc ; [L257] retValue_acc = pumpRunning [L258] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L420] tmp___0 = isPumpRunning() [L422] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L405] __VERIFIER_error() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 89 locations, 3 error locations. Result: UNSAFE, OverallTime: 3.0s, OverallIterations: 11, TraceHistogramMax: 2, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 870 SDtfs, 1375 SDslu, 1757 SDs, 0 SdLazy, 219 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 83 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=236occurred 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, 10 MinimizatonAttempts, 1157 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 311 NumberOfCodeBlocks, 311 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 252 ConstructedInterpolants, 0 QuantifiedInterpolants, 13787 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 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...