./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec1_product41.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_product41.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 5a2d3ce20e3d26ebf70024607ecab77b852f9995 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:16,447 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 00:20:16,454 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 00:20:16,471 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 00:20:16,471 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 00:20:16,474 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 00:20:16,476 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 00:20:16,490 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 00:20:16,492 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 00:20:16,493 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 00:20:16,494 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 00:20:16,497 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 00:20:16,497 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 00:20:16,501 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 00:20:16,502 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 00:20:16,504 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 00:20:16,506 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 00:20:16,508 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 00:20:16,511 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 00:20:16,518 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 00:20:16,523 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 00:20:16,526 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 00:20:16,527 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 00:20:16,529 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 00:20:16,533 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 00:20:16,533 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 00:20:16,534 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 00:20:16,536 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 00:20:16,536 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 00:20:16,537 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 00:20:16,537 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 00:20:16,538 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 00:20:16,539 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 00:20:16,540 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 00:20:16,541 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 00:20:16,542 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 00:20:16,543 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 00:20:16,543 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 00:20:16,543 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 00:20:16,546 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 00:20:16,547 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 00:20:16,548 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:16,571 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 00:20:16,572 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 00:20:16,574 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 00:20:16,574 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 00:20:16,574 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 00:20:16,575 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 00:20:16,575 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 00:20:16,575 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 00:20:16,575 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 00:20:16,576 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 00:20:16,577 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 00:20:16,577 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 00:20:16,577 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 00:20:16,578 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 00:20:16,578 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 00:20:16,578 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 00:20:16,578 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 00:20:16,579 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 00:20:16,579 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 00:20:16,579 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 00:20:16,579 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 00:20:16,579 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:20:16,580 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 00:20:16,580 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 00:20:16,580 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 00:20:16,580 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 00:20:16,581 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 00:20:16,581 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 00:20:16,581 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 -> 5a2d3ce20e3d26ebf70024607ecab77b852f9995 [2019-11-28 00:20:16,902 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 00:20:16,916 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 00:20:16,920 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 00:20:16,921 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 00:20:16,922 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 00:20:16,923 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec1_product41.cil.c [2019-11-28 00:20:16,999 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c95c687ac/3073c4ed2e404e65b1bb8490bb786fb2/FLAGf363cb361 [2019-11-28 00:20:17,529 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 00:20:17,530 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product41.cil.c [2019-11-28 00:20:17,548 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c95c687ac/3073c4ed2e404e65b1bb8490bb786fb2/FLAGf363cb361 [2019-11-28 00:20:17,809 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c95c687ac/3073c4ed2e404e65b1bb8490bb786fb2 [2019-11-28 00:20:17,813 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 00:20:17,814 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 00:20:17,815 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 00:20:17,815 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 00:20:17,819 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 00:20:17,820 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:20:17" (1/1) ... [2019-11-28 00:20:17,823 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34097ed9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:17, skipping insertion in model container [2019-11-28 00:20:17,823 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:20:17" (1/1) ... [2019-11-28 00:20:17,831 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 00:20:17,882 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 00:20:18,296 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:20:18,319 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 00:20:18,460 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:20:18,498 INFO L208 MainTranslator]: Completed translation [2019-11-28 00:20:18,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:18 WrapperNode [2019-11-28 00:20:18,500 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 00:20:18,501 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 00:20:18,501 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 00:20:18,501 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 00:20:18,511 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:18" (1/1) ... [2019-11-28 00:20:18,545 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:18" (1/1) ... [2019-11-28 00:20:18,592 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 00:20:18,592 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 00:20:18,592 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 00:20:18,593 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 00:20:18,601 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:18" (1/1) ... [2019-11-28 00:20:18,601 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:18" (1/1) ... [2019-11-28 00:20:18,606 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:18" (1/1) ... [2019-11-28 00:20:18,606 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:18" (1/1) ... [2019-11-28 00:20:18,616 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:18" (1/1) ... [2019-11-28 00:20:18,628 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:18" (1/1) ... [2019-11-28 00:20:18,635 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:18" (1/1) ... [2019-11-28 00:20:18,640 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 00:20:18,641 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 00:20:18,641 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 00:20:18,641 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 00:20:18,642 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:18" (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:18,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 00:20:18,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-28 00:20:18,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 00:20:18,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 00:20:19,538 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 00:20:19,539 INFO L297 CfgBuilder]: Removed 114 assume(true) statements. [2019-11-28 00:20:19,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:20:19 BoogieIcfgContainer [2019-11-28 00:20:19,540 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 00:20:19,542 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 00:20:19,542 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 00:20:19,545 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 00:20:19,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:20:17" (1/3) ... [2019-11-28 00:20:19,546 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@266ccf50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:20:19, skipping insertion in model container [2019-11-28 00:20:19,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:20:18" (2/3) ... [2019-11-28 00:20:19,547 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@266ccf50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:20:19, skipping insertion in model container [2019-11-28 00:20:19,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:20:19" (3/3) ... [2019-11-28 00:20:19,550 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product41.cil.c [2019-11-28 00:20:19,562 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 00:20:19,570 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-28 00:20:19,580 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-28 00:20:19,612 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 00:20:19,612 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 00:20:19,612 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 00:20:19,612 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 00:20:19,613 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 00:20:19,613 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 00:20:19,613 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 00:20:19,613 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 00:20:19,629 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states. [2019-11-28 00:20:19,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 00:20:19,637 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:19,638 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:19,638 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:19,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:19,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1847621448, now seen corresponding path program 1 times [2019-11-28 00:20:19,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:19,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651845929] [2019-11-28 00:20:19,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:19,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:19,913 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:19,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651845929] [2019-11-28 00:20:19,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:19,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:20:19,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059017271] [2019-11-28 00:20:19,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 00:20:19,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:19,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 00:20:19,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 00:20:19,936 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 2 states. [2019-11-28 00:20:19,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:19,969 INFO L93 Difference]: Finished difference Result 168 states and 251 transitions. [2019-11-28 00:20:19,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 00:20:19,971 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-11-28 00:20:19,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:19,983 INFO L225 Difference]: With dead ends: 168 [2019-11-28 00:20:19,983 INFO L226 Difference]: Without dead ends: 83 [2019-11-28 00:20:19,987 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,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-28 00:20:20,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-11-28 00:20:20,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-28 00:20:20,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 117 transitions. [2019-11-28 00:20:20,037 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 117 transitions. Word has length 16 [2019-11-28 00:20:20,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:20,038 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 117 transitions. [2019-11-28 00:20:20,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 00:20:20,038 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 117 transitions. [2019-11-28 00:20:20,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 00:20:20,040 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:20,041 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:20,042 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:20,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:20,042 INFO L82 PathProgramCache]: Analyzing trace with hash 800864551, now seen corresponding path program 1 times [2019-11-28 00:20:20,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:20,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819494402] [2019-11-28 00:20:20,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:20,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:20,171 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,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819494402] [2019-11-28 00:20:20,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:20,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:20:20,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271071819] [2019-11-28 00:20:20,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:20:20,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:20,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:20:20,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:20:20,177 INFO L87 Difference]: Start difference. First operand 83 states and 117 transitions. Second operand 3 states. [2019-11-28 00:20:20,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:20,190 INFO L93 Difference]: Finished difference Result 83 states and 117 transitions. [2019-11-28 00:20:20,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:20:20,190 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 00:20:20,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:20,191 INFO L225 Difference]: With dead ends: 83 [2019-11-28 00:20:20,192 INFO L226 Difference]: Without dead ends: 37 [2019-11-28 00:20:20,193 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:20:20,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-11-28 00:20:20,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-11-28 00:20:20,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-28 00:20:20,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 52 transitions. [2019-11-28 00:20:20,200 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 52 transitions. Word has length 17 [2019-11-28 00:20:20,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:20,200 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 52 transitions. [2019-11-28 00:20:20,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:20:20,201 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 52 transitions. [2019-11-28 00:20:20,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 00:20:20,202 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:20,202 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:20,202 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:20,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:20,203 INFO L82 PathProgramCache]: Analyzing trace with hash -2126819203, now seen corresponding path program 1 times [2019-11-28 00:20:20,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:20,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005069965] [2019-11-28 00:20:20,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:20,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:20,324 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,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005069965] [2019-11-28 00:20:20,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:20,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:20:20,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919783530] [2019-11-28 00:20:20,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:20:20,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:20,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:20:20,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:20:20,328 INFO L87 Difference]: Start difference. First operand 37 states and 52 transitions. Second operand 3 states. [2019-11-28 00:20:20,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:20,341 INFO L93 Difference]: Finished difference Result 68 states and 98 transitions. [2019-11-28 00:20:20,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:20:20,342 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-28 00:20:20,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:20,343 INFO L225 Difference]: With dead ends: 68 [2019-11-28 00:20:20,343 INFO L226 Difference]: Without dead ends: 37 [2019-11-28 00:20:20,344 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:20,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-11-28 00:20:20,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-11-28 00:20:20,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-28 00:20:20,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2019-11-28 00:20:20,350 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 22 [2019-11-28 00:20:20,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:20,350 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2019-11-28 00:20:20,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:20:20,351 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2019-11-28 00:20:20,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 00:20:20,352 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:20,352 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:20,352 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:20,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:20,353 INFO L82 PathProgramCache]: Analyzing trace with hash -306622024, now seen corresponding path program 1 times [2019-11-28 00:20:20,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:20,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025526095] [2019-11-28 00:20:20,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:20,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:20,419 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,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025526095] [2019-11-28 00:20:20,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:20,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:20:20,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265724954] [2019-11-28 00:20:20,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:20:20,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:20,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:20:20,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:20:20,424 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand 3 states. [2019-11-28 00:20:20,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:20,456 INFO L93 Difference]: Finished difference Result 89 states and 126 transitions. [2019-11-28 00:20:20,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:20:20,457 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-28 00:20:20,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:20,458 INFO L225 Difference]: With dead ends: 89 [2019-11-28 00:20:20,458 INFO L226 Difference]: Without dead ends: 58 [2019-11-28 00:20:20,459 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:20,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-11-28 00:20:20,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2019-11-28 00:20:20,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-28 00:20:20,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 78 transitions. [2019-11-28 00:20:20,469 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 78 transitions. Word has length 23 [2019-11-28 00:20:20,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:20,470 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 78 transitions. [2019-11-28 00:20:20,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:20:20,470 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 78 transitions. [2019-11-28 00:20:20,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-28 00:20:20,471 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:20,472 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] [2019-11-28 00:20:20,472 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:20,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:20,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1880803796, now seen corresponding path program 1 times [2019-11-28 00:20:20,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:20,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799696612] [2019-11-28 00:20:20,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:20,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:20,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:20,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799696612] [2019-11-28 00:20:20,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:20,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:20:20,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832961391] [2019-11-28 00:20:20,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:20:20,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:20,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:20:20,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:20:20,571 INFO L87 Difference]: Start difference. First operand 56 states and 78 transitions. Second operand 5 states. [2019-11-28 00:20:20,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:20,794 INFO L93 Difference]: Finished difference Result 266 states and 385 transitions. [2019-11-28 00:20:20,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 00:20:20,795 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-11-28 00:20:20,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:20,797 INFO L225 Difference]: With dead ends: 266 [2019-11-28 00:20:20,797 INFO L226 Difference]: Without dead ends: 216 [2019-11-28 00:20:20,798 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-28 00:20:20,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-11-28 00:20:20,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 100. [2019-11-28 00:20:20,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-28 00:20:20,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 139 transitions. [2019-11-28 00:20:20,817 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 139 transitions. Word has length 29 [2019-11-28 00:20:20,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:20,817 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 139 transitions. [2019-11-28 00:20:20,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:20:20,818 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 139 transitions. [2019-11-28 00:20:20,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 00:20:20,819 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:20,819 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] [2019-11-28 00:20:20,819 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:20,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:20,820 INFO L82 PathProgramCache]: Analyzing trace with hash 634718134, now seen corresponding path program 1 times [2019-11-28 00:20:20,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:20,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351040379] [2019-11-28 00:20:20,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:20,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:20,914 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,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351040379] [2019-11-28 00:20:20,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:20,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:20:20,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729763116] [2019-11-28 00:20:20,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:20:20,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:20,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:20:20,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:20:20,918 INFO L87 Difference]: Start difference. First operand 100 states and 139 transitions. Second operand 5 states. [2019-11-28 00:20:21,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:21,065 INFO L93 Difference]: Finished difference Result 280 states and 394 transitions. [2019-11-28 00:20:21,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 00:20:21,066 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-11-28 00:20:21,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:21,068 INFO L225 Difference]: With dead ends: 280 [2019-11-28 00:20:21,068 INFO L226 Difference]: Without dead ends: 278 [2019-11-28 00:20:21,069 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,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-11-28 00:20:21,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 100. [2019-11-28 00:20:21,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-28 00:20:21,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 138 transitions. [2019-11-28 00:20:21,098 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 138 transitions. Word has length 30 [2019-11-28 00:20:21,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:21,099 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 138 transitions. [2019-11-28 00:20:21,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:20:21,100 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 138 transitions. [2019-11-28 00:20:21,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-28 00:20:21,105 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:21,106 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:21,110 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:21,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:21,112 INFO L82 PathProgramCache]: Analyzing trace with hash 719357973, now seen corresponding path program 1 times [2019-11-28 00:20:21,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:21,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664532725] [2019-11-28 00:20:21,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:21,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:21,213 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,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664532725] [2019-11-28 00:20:21,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:21,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:20:21,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60655559] [2019-11-28 00:20:21,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:20:21,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:21,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:20:21,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:20:21,216 INFO L87 Difference]: Start difference. First operand 100 states and 138 transitions. Second operand 5 states. [2019-11-28 00:20:21,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:21,296 INFO L93 Difference]: Finished difference Result 270 states and 372 transitions. [2019-11-28 00:20:21,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:20:21,297 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-11-28 00:20:21,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:21,301 INFO L225 Difference]: With dead ends: 270 [2019-11-28 00:20:21,303 INFO L226 Difference]: Without dead ends: 176 [2019-11-28 00:20:21,304 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:21,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-11-28 00:20:21,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 106. [2019-11-28 00:20:21,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-28 00:20:21,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 144 transitions. [2019-11-28 00:20:21,330 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 144 transitions. Word has length 33 [2019-11-28 00:20:21,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:21,331 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 144 transitions. [2019-11-28 00:20:21,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:20:21,331 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 144 transitions. [2019-11-28 00:20:21,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-28 00:20:21,336 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:21,336 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:21,336 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:21,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:21,337 INFO L82 PathProgramCache]: Analyzing trace with hash 132551959, now seen corresponding path program 1 times [2019-11-28 00:20:21,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:21,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765710535] [2019-11-28 00:20:21,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:21,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:21,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:20:21,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765710535] [2019-11-28 00:20:21,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:21,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:20:21,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503886270] [2019-11-28 00:20:21,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 00:20:21,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:21,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 00:20:21,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 00:20:21,401 INFO L87 Difference]: Start difference. First operand 106 states and 144 transitions. Second operand 4 states. [2019-11-28 00:20:21,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:21,440 INFO L93 Difference]: Finished difference Result 252 states and 342 transitions. [2019-11-28 00:20:21,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 00:20:21,441 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-11-28 00:20:21,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:21,442 INFO L225 Difference]: With dead ends: 252 [2019-11-28 00:20:21,443 INFO L226 Difference]: Without dead ends: 152 [2019-11-28 00:20:21,445 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:20:21,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-11-28 00:20:21,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 110. [2019-11-28 00:20:21,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-28 00:20:21,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 148 transitions. [2019-11-28 00:20:21,461 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 148 transitions. Word has length 33 [2019-11-28 00:20:21,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:21,462 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 148 transitions. [2019-11-28 00:20:21,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 00:20:21,462 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 148 transitions. [2019-11-28 00:20:21,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-28 00:20:21,466 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:21,467 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:21,467 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:21,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:21,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1147311719, now seen corresponding path program 1 times [2019-11-28 00:20:21,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:21,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164919140] [2019-11-28 00:20:21,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:21,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:21,525 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,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164919140] [2019-11-28 00:20:21,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:21,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:20:21,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898097717] [2019-11-28 00:20:21,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:20:21,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:21,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:20:21,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:20:21,528 INFO L87 Difference]: Start difference. First operand 110 states and 148 transitions. Second operand 3 states. [2019-11-28 00:20:21,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:21,563 INFO L93 Difference]: Finished difference Result 262 states and 352 transitions. [2019-11-28 00:20:21,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:20:21,564 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-28 00:20:21,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:21,565 INFO L225 Difference]: With dead ends: 262 [2019-11-28 00:20:21,566 INFO L226 Difference]: Without dead ends: 158 [2019-11-28 00:20:21,567 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,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-28 00:20:21,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2019-11-28 00:20:21,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-11-28 00:20:21,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 206 transitions. [2019-11-28 00:20:21,592 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 206 transitions. Word has length 33 [2019-11-28 00:20:21,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:21,592 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 206 transitions. [2019-11-28 00:20:21,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:20:21,593 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 206 transitions. [2019-11-28 00:20:21,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-28 00:20:21,594 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:21,595 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:21,595 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:21,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:21,595 INFO L82 PathProgramCache]: Analyzing trace with hash 9984219, now seen corresponding path program 1 times [2019-11-28 00:20:21,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:21,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789551068] [2019-11-28 00:20:21,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:21,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:20:21,684 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,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789551068] [2019-11-28 00:20:21,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:20:21,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 00:20:21,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506391985] [2019-11-28 00:20:21,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 00:20:21,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:20:21,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 00:20:21,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 00:20:21,687 INFO L87 Difference]: Start difference. First operand 158 states and 206 transitions. Second operand 6 states. [2019-11-28 00:20:21,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:20:21,880 INFO L93 Difference]: Finished difference Result 482 states and 630 transitions. [2019-11-28 00:20:21,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 00:20:21,881 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-11-28 00:20:21,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:20:21,883 INFO L225 Difference]: With dead ends: 482 [2019-11-28 00:20:21,883 INFO L226 Difference]: Without dead ends: 330 [2019-11-28 00:20:21,884 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-11-28 00:20:21,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-11-28 00:20:21,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 158. [2019-11-28 00:20:21,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-11-28 00:20:21,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 202 transitions. [2019-11-28 00:20:21,905 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 202 transitions. Word has length 34 [2019-11-28 00:20:21,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:20:21,906 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 202 transitions. [2019-11-28 00:20:21,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 00:20:21,907 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 202 transitions. [2019-11-28 00:20:21,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-28 00:20:21,908 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:20:21,908 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:21,908 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:20:21,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:20:21,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1795003067, now seen corresponding path program 1 times [2019-11-28 00:20:21,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:20:21,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617931184] [2019-11-28 00:20:21,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:20:21,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 00:20:22,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 00:20:22,171 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 00:20:22,171 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 00:20:22,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:20:22 BoogieIcfgContainer [2019-11-28 00:20:22,366 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 00:20:22,369 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 00:20:22,369 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 00:20:22,369 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 00:20:22,370 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:19" (3/4) ... [2019-11-28 00:20:22,373 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 00:20:22,582 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 00:20:22,582 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 00:20:22,585 INFO L168 Benchmark]: Toolchain (without parser) took 4770.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 219.7 MB). Free memory was 951.0 MB in the beginning and 1.2 GB in the end (delta: -219.8 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:20:22,585 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:20:22,586 INFO L168 Benchmark]: CACSL2BoogieTranslator took 685.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -171.1 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. [2019-11-28 00:20:22,586 INFO L168 Benchmark]: Boogie Procedure Inliner took 90.91 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:20:22,588 INFO L168 Benchmark]: Boogie Preprocessor took 47.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 00:20:22,589 INFO L168 Benchmark]: RCFGBuilder took 899.98 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: 57.8 MB). Peak memory consumption was 57.8 MB. Max. memory is 11.5 GB. [2019-11-28 00:20:22,589 INFO L168 Benchmark]: TraceAbstraction took 2826.24 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.1 GB in the beginning and 1.2 GB in the end (delta: -129.0 MB). Peak memory consumption was 255.4 MB. Max. memory is 11.5 GB. [2019-11-28 00:20:22,589 INFO L168 Benchmark]: Witness Printer took 213.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 15.8 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. [2019-11-28 00:20:22,592 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.32 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 685.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -171.1 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 90.91 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 47.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 899.98 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: 57.8 MB). Peak memory consumption was 57.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2826.24 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.1 GB in the beginning and 1.2 GB in the end (delta: -129.0 MB). Peak memory consumption was 255.4 MB. Max. memory is 11.5 GB. * Witness Printer took 213.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 15.8 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 887]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L209] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L480] int waterLevel = 1; [L481] int methaneLevelCritical = 0; [L578] int pumpRunning = 0; [L579] int systemActive = 1; [L749] int cleanupTimeShifts = 4; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L825] int retValue_acc ; [L826] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L874] int retValue_acc ; [L877] retValue_acc = 1 [L878] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L832] tmp = valid_product() [L834] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L411] int splverifierCounter ; [L412] int tmp ; [L413] int tmp___0 ; [L414] int tmp___1 ; [L415] int tmp___2 ; [L418] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L420] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L422] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L428] tmp = __VERIFIER_nondet_int() [L430] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L498] COND TRUE waterLevel < 2 [L499] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L438] tmp___0 = __VERIFIER_nondet_int() [L440] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L448] tmp___2 = __VERIFIER_nondet_int() [L450] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L586] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L593] COND TRUE \read(systemActive) [L615] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L618] COND TRUE ! pumpRunning [L730] int retValue_acc ; [L731] int tmp ; [L732] int tmp___0 ; [L560] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L563] COND FALSE !(waterLevel < 2) [L567] retValue_acc = 0 [L568] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L736] tmp = isHighWaterSensorDry() [L738] COND FALSE !(\read(tmp)) [L741] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L743] retValue_acc = tmp___0 [L744] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L620] tmp = isHighWaterLevel() [L622] COND TRUE \read(tmp) [L649] int tmp ; [L674] int retValue_acc ; [L519] int retValue_acc ; [L522] retValue_acc = methaneLevelCritical [L523] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L678] retValue_acc = isMethaneLevelCritical() [L680] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L653] tmp = isMethaneAlarm() [L655] COND FALSE !(\read(tmp)) [L643] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L893] int tmp ; [L894] int tmp___0 ; [L519] int retValue_acc ; [L522] retValue_acc = methaneLevelCritical [L523] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L898] tmp = isMethaneLevelCritical() [L900] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L420] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L422] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L428] tmp = __VERIFIER_nondet_int() [L430] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L438] tmp___0 = __VERIFIER_nondet_int() [L440] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L510] COND FALSE !(\read(methaneLevelCritical)) [L513] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L448] tmp___2 = __VERIFIER_nondet_int() [L450] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L586] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L486] COND TRUE waterLevel > 0 [L487] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L593] COND TRUE \read(systemActive) [L615] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L618] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L893] int tmp ; [L894] int tmp___0 ; [L519] int retValue_acc ; [L522] retValue_acc = methaneLevelCritical [L523] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L898] tmp = isMethaneLevelCritical() [L900] COND TRUE \read(tmp) [L685] int retValue_acc ; [L688] retValue_acc = pumpRunning [L689] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L902] tmp___0 = isPumpRunning() [L904] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L887] __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, 87 locations, 3 error locations. Result: UNSAFE, OverallTime: 2.5s, OverallIterations: 11, TraceHistogramMax: 2, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 750 SDtfs, 911 SDslu, 1174 SDs, 0 SdLazy, 164 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=158occurred 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.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 580 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 319 NumberOfCodeBlocks, 319 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 260 ConstructedInterpolants, 0 QuantifiedInterpolants, 14010 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...