./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec4_product46.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/minepump_spec4_product46.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 209a5f451d4da606f6f89775a0cb8490169e98a1 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 00:22:51,556 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 00:22:51,558 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 00:22:51,571 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 00:22:51,571 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 00:22:51,573 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 00:22:51,574 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 00:22:51,577 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 00:22:51,579 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 00:22:51,580 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 00:22:51,581 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 00:22:51,583 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 00:22:51,583 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 00:22:51,584 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 00:22:51,585 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 00:22:51,587 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 00:22:51,588 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 00:22:51,589 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 00:22:51,591 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 00:22:51,594 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 00:22:51,596 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 00:22:51,597 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 00:22:51,598 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 00:22:51,599 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 00:22:51,602 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 00:22:51,602 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 00:22:51,603 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 00:22:51,604 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 00:22:51,604 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 00:22:51,605 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 00:22:51,606 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 00:22:51,607 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 00:22:51,607 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 00:22:51,608 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 00:22:51,610 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 00:22:51,610 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 00:22:51,611 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 00:22:51,611 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 00:22:51,611 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 00:22:51,613 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 00:22:51,613 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 00:22:51,614 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 00:22:51,635 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 00:22:51,636 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 00:22:51,638 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 00:22:51,638 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 00:22:51,638 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 00:22:51,639 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 00:22:51,639 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 00:22:51,639 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 00:22:51,640 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 00:22:51,640 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 00:22:51,641 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 00:22:51,641 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 00:22:51,642 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 00:22:51,642 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 00:22:51,642 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 00:22:51,643 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 00:22:51,643 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 00:22:51,643 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 00:22:51,644 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 00:22:51,644 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 00:22:51,644 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 00:22:51,645 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:22:51,645 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 00:22:51,645 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 00:22:51,646 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 00:22:51,646 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 00:22:51,646 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 00:22:51,646 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 00:22:51,647 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 -> 209a5f451d4da606f6f89775a0cb8490169e98a1 [2019-11-28 00:22:52,017 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 00:22:52,031 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 00:22:52,035 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 00:22:52,036 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 00:22:52,037 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 00:22:52,038 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec4_product46.cil.c [2019-11-28 00:22:52,116 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9922bf258/d5915b0a990c4fb18218bbc7009c5a10/FLAG20cfd9991 [2019-11-28 00:22:52,686 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 00:22:52,687 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product46.cil.c [2019-11-28 00:22:52,706 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9922bf258/d5915b0a990c4fb18218bbc7009c5a10/FLAG20cfd9991 [2019-11-28 00:22:52,956 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9922bf258/d5915b0a990c4fb18218bbc7009c5a10 [2019-11-28 00:22:52,962 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 00:22:52,964 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 00:22:52,968 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 00:22:52,968 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 00:22:52,972 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 00:22:52,973 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:22:52" (1/1) ... [2019-11-28 00:22:52,977 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b0e12b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:52, skipping insertion in model container [2019-11-28 00:22:52,977 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:22:52" (1/1) ... [2019-11-28 00:22:52,986 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 00:22:53,052 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 00:22:53,407 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:22:53,421 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 00:22:53,526 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:22:53,572 INFO L208 MainTranslator]: Completed translation [2019-11-28 00:22:53,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:53 WrapperNode [2019-11-28 00:22:53,573 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 00:22:53,574 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 00:22:53,574 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 00:22:53,574 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 00:22:53,583 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:53" (1/1) ... [2019-11-28 00:22:53,611 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:53" (1/1) ... [2019-11-28 00:22:53,664 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 00:22:53,665 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 00:22:53,665 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 00:22:53,666 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 00:22:53,683 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:53" (1/1) ... [2019-11-28 00:22:53,683 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:53" (1/1) ... [2019-11-28 00:22:53,690 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:53" (1/1) ... [2019-11-28 00:22:53,690 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:53" (1/1) ... [2019-11-28 00:22:53,705 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:53" (1/1) ... [2019-11-28 00:22:53,716 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:53" (1/1) ... [2019-11-28 00:22:53,720 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:53" (1/1) ... [2019-11-28 00:22:53,727 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 00:22:53,728 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 00:22:53,728 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 00:22:53,729 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 00:22:53,730 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:22:53,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 00:22:53,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-28 00:22:53,789 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 00:22:53,789 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 00:22:54,719 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 00:22:54,719 INFO L297 CfgBuilder]: Removed 194 assume(true) statements. [2019-11-28 00:22:54,721 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:22:54 BoogieIcfgContainer [2019-11-28 00:22:54,721 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 00:22:54,724 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 00:22:54,725 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 00:22:54,728 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 00:22:54,729 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:22:52" (1/3) ... [2019-11-28 00:22:54,729 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@460b1fd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:22:54, skipping insertion in model container [2019-11-28 00:22:54,730 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:22:53" (2/3) ... [2019-11-28 00:22:54,730 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@460b1fd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:22:54, skipping insertion in model container [2019-11-28 00:22:54,731 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:22:54" (3/3) ... [2019-11-28 00:22:54,732 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec4_product46.cil.c [2019-11-28 00:22:54,743 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 00:22:54,751 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-28 00:22:54,762 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-28 00:22:54,786 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 00:22:54,787 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 00:22:54,787 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 00:22:54,787 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 00:22:54,787 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 00:22:54,788 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 00:22:54,788 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 00:22:54,788 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 00:22:54,812 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states. [2019-11-28 00:22:54,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 00:22:54,819 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:54,821 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:22:54,821 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:54,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:54,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1027746333, now seen corresponding path program 1 times [2019-11-28 00:22:54,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:54,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190440483] [2019-11-28 00:22:54,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:55,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:55,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:22:55,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190440483] [2019-11-28 00:22:55,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:55,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:22:55,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825575527] [2019-11-28 00:22:55,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 00:22:55,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:55,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 00:22:55,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 00:22:55,166 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 2 states. [2019-11-28 00:22:55,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:55,203 INFO L93 Difference]: Finished difference Result 252 states and 377 transitions. [2019-11-28 00:22:55,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 00:22:55,205 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-11-28 00:22:55,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:55,218 INFO L225 Difference]: With dead ends: 252 [2019-11-28 00:22:55,219 INFO L226 Difference]: Without dead ends: 125 [2019-11-28 00:22:55,223 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 00:22:55,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-11-28 00:22:55,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2019-11-28 00:22:55,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-11-28 00:22:55,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 180 transitions. [2019-11-28 00:22:55,272 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 180 transitions. Word has length 16 [2019-11-28 00:22:55,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:55,273 INFO L462 AbstractCegarLoop]: Abstraction has 125 states and 180 transitions. [2019-11-28 00:22:55,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 00:22:55,273 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 180 transitions. [2019-11-28 00:22:55,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 00:22:55,275 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:55,275 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:22:55,275 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:55,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:55,276 INFO L82 PathProgramCache]: Analyzing trace with hash -2074503230, now seen corresponding path program 1 times [2019-11-28 00:22:55,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:55,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606921447] [2019-11-28 00:22:55,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:55,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:55,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:22:55,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606921447] [2019-11-28 00:22:55,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:55,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:22:55,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299454007] [2019-11-28 00:22:55,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:22:55,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:55,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:22:55,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:22:55,379 INFO L87 Difference]: Start difference. First operand 125 states and 180 transitions. Second operand 3 states. [2019-11-28 00:22:55,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:55,394 INFO L93 Difference]: Finished difference Result 125 states and 180 transitions. [2019-11-28 00:22:55,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:22:55,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 00:22:55,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:55,396 INFO L225 Difference]: With dead ends: 125 [2019-11-28 00:22:55,397 INFO L226 Difference]: Without dead ends: 51 [2019-11-28 00:22:55,398 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:22:55,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-28 00:22:55,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-11-28 00:22:55,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-28 00:22:55,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 73 transitions. [2019-11-28 00:22:55,407 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 73 transitions. Word has length 17 [2019-11-28 00:22:55,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:55,407 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 73 transitions. [2019-11-28 00:22:55,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:22:55,408 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 73 transitions. [2019-11-28 00:22:55,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 00:22:55,409 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:55,409 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:22:55,410 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:55,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:55,410 INFO L82 PathProgramCache]: Analyzing trace with hash 640818778, now seen corresponding path program 1 times [2019-11-28 00:22:55,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:55,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035589761] [2019-11-28 00:22:55,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:55,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:55,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:22:55,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035589761] [2019-11-28 00:22:55,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:55,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:22:55,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419614203] [2019-11-28 00:22:55,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:22:55,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:55,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:22:55,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:22:55,598 INFO L87 Difference]: Start difference. First operand 51 states and 73 transitions. Second operand 5 states. [2019-11-28 00:22:55,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:55,686 INFO L93 Difference]: Finished difference Result 96 states and 140 transitions. [2019-11-28 00:22:55,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 00:22:55,689 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-28 00:22:55,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:55,691 INFO L225 Difference]: With dead ends: 96 [2019-11-28 00:22:55,693 INFO L226 Difference]: Without dead ends: 51 [2019-11-28 00:22:55,695 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 00:22:55,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-28 00:22:55,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-11-28 00:22:55,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-28 00:22:55,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 72 transitions. [2019-11-28 00:22:55,713 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 72 transitions. Word has length 22 [2019-11-28 00:22:55,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:55,714 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 72 transitions. [2019-11-28 00:22:55,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:22:55,716 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 72 transitions. [2019-11-28 00:22:55,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 00:22:55,717 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:55,718 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:22:55,718 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:55,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:55,719 INFO L82 PathProgramCache]: Analyzing trace with hash -855709928, now seen corresponding path program 1 times [2019-11-28 00:22:55,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:55,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381206335] [2019-11-28 00:22:55,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:55,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:55,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:22:55,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381206335] [2019-11-28 00:22:55,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:55,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:22:55,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267764720] [2019-11-28 00:22:55,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:22:55,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:55,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:22:55,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:22:55,849 INFO L87 Difference]: Start difference. First operand 51 states and 72 transitions. Second operand 3 states. [2019-11-28 00:22:55,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:55,916 INFO L93 Difference]: Finished difference Result 117 states and 168 transitions. [2019-11-28 00:22:55,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:22:55,917 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-28 00:22:55,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:55,918 INFO L225 Difference]: With dead ends: 117 [2019-11-28 00:22:55,918 INFO L226 Difference]: Without dead ends: 72 [2019-11-28 00:22:55,919 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:22:55,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-11-28 00:22:55,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2019-11-28 00:22:55,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-28 00:22:55,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 98 transitions. [2019-11-28 00:22:55,930 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 98 transitions. Word has length 24 [2019-11-28 00:22:55,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:55,931 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 98 transitions. [2019-11-28 00:22:55,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:22:55,931 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 98 transitions. [2019-11-28 00:22:55,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 00:22:55,932 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:55,933 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:22:55,933 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:55,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:55,933 INFO L82 PathProgramCache]: Analyzing trace with hash -407287284, now seen corresponding path program 1 times [2019-11-28 00:22:55,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:55,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004879891] [2019-11-28 00:22:55,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:55,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:56,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:22:56,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004879891] [2019-11-28 00:22:56,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:56,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:22:56,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897128387] [2019-11-28 00:22:56,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:22:56,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:56,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:22:56,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:22:56,016 INFO L87 Difference]: Start difference. First operand 70 states and 98 transitions. Second operand 5 states. [2019-11-28 00:22:56,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:56,150 INFO L93 Difference]: Finished difference Result 247 states and 354 transitions. [2019-11-28 00:22:56,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:22:56,151 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-11-28 00:22:56,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:56,153 INFO L225 Difference]: With dead ends: 247 [2019-11-28 00:22:56,153 INFO L226 Difference]: Without dead ends: 183 [2019-11-28 00:22:56,154 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-28 00:22:56,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-11-28 00:22:56,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 113. [2019-11-28 00:22:56,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-11-28 00:22:56,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 155 transitions. [2019-11-28 00:22:56,173 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 155 transitions. Word has length 30 [2019-11-28 00:22:56,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:56,174 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 155 transitions. [2019-11-28 00:22:56,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:22:56,174 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 155 transitions. [2019-11-28 00:22:56,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 00:22:56,177 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:56,177 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] [2019-11-28 00:22:56,178 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:56,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:56,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1879863818, now seen corresponding path program 1 times [2019-11-28 00:22:56,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:56,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020578722] [2019-11-28 00:22:56,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:56,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:56,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:22:56,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020578722] [2019-11-28 00:22:56,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:56,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:22:56,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260084578] [2019-11-28 00:22:56,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:22:56,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:56,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:22:56,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:22:56,252 INFO L87 Difference]: Start difference. First operand 113 states and 155 transitions. Second operand 5 states. [2019-11-28 00:22:56,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:56,387 INFO L93 Difference]: Finished difference Result 241 states and 338 transitions. [2019-11-28 00:22:56,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 00:22:56,387 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-11-28 00:22:56,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:56,389 INFO L225 Difference]: With dead ends: 241 [2019-11-28 00:22:56,390 INFO L226 Difference]: Without dead ends: 239 [2019-11-28 00:22:56,390 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-28 00:22:56,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2019-11-28 00:22:56,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 113. [2019-11-28 00:22:56,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-11-28 00:22:56,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 154 transitions. [2019-11-28 00:22:56,418 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 154 transitions. Word has length 31 [2019-11-28 00:22:56,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:56,418 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 154 transitions. [2019-11-28 00:22:56,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:22:56,419 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 154 transitions. [2019-11-28 00:22:56,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-28 00:22:56,422 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:56,422 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:22:56,423 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:56,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:56,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1871204221, now seen corresponding path program 1 times [2019-11-28 00:22:56,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:56,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126383453] [2019-11-28 00:22:56,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:56,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:56,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:22:56,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126383453] [2019-11-28 00:22:56,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:56,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:22:56,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123623600] [2019-11-28 00:22:56,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:22:56,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:56,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:22:56,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:22:56,494 INFO L87 Difference]: Start difference. First operand 113 states and 154 transitions. Second operand 5 states. [2019-11-28 00:22:56,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:56,589 INFO L93 Difference]: Finished difference Result 303 states and 412 transitions. [2019-11-28 00:22:56,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:22:56,590 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-11-28 00:22:56,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:56,592 INFO L225 Difference]: With dead ends: 303 [2019-11-28 00:22:56,593 INFO L226 Difference]: Without dead ends: 196 [2019-11-28 00:22:56,594 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 00:22:56,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-11-28 00:22:56,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 122. [2019-11-28 00:22:56,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-11-28 00:22:56,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 163 transitions. [2019-11-28 00:22:56,611 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 163 transitions. Word has length 34 [2019-11-28 00:22:56,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:56,612 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 163 transitions. [2019-11-28 00:22:56,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:22:56,613 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 163 transitions. [2019-11-28 00:22:56,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-28 00:22:56,615 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:56,615 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:22:56,616 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:56,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:56,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1284398207, now seen corresponding path program 1 times [2019-11-28 00:22:56,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:56,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975397846] [2019-11-28 00:22:56,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:56,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:56,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:22:56,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975397846] [2019-11-28 00:22:56,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:56,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 00:22:56,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941983977] [2019-11-28 00:22:56,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 00:22:56,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:56,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 00:22:56,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 00:22:56,698 INFO L87 Difference]: Start difference. First operand 122 states and 163 transitions. Second operand 6 states. [2019-11-28 00:22:56,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:56,817 INFO L93 Difference]: Finished difference Result 281 states and 376 transitions. [2019-11-28 00:22:56,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 00:22:56,819 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-11-28 00:22:56,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:56,821 INFO L225 Difference]: With dead ends: 281 [2019-11-28 00:22:56,822 INFO L226 Difference]: Without dead ends: 165 [2019-11-28 00:22:56,823 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-28 00:22:56,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-11-28 00:22:56,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 104. [2019-11-28 00:22:56,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-28 00:22:56,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 136 transitions. [2019-11-28 00:22:56,842 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 136 transitions. Word has length 34 [2019-11-28 00:22:56,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:56,842 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 136 transitions. [2019-11-28 00:22:56,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 00:22:56,843 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 136 transitions. [2019-11-28 00:22:56,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-28 00:22:56,851 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:56,851 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:22:56,851 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:56,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:56,852 INFO L82 PathProgramCache]: Analyzing trace with hash 4534529, now seen corresponding path program 1 times [2019-11-28 00:22:56,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:56,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881905279] [2019-11-28 00:22:56,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:56,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:56,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:22:56,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881905279] [2019-11-28 00:22:56,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:22:56,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:22:56,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830667930] [2019-11-28 00:22:56,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:22:56,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:56,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:22:56,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:22:56,953 INFO L87 Difference]: Start difference. First operand 104 states and 136 transitions. Second operand 5 states. [2019-11-28 00:22:57,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:57,096 INFO L93 Difference]: Finished difference Result 283 states and 381 transitions. [2019-11-28 00:22:57,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:22:57,097 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-11-28 00:22:57,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:57,098 INFO L225 Difference]: With dead ends: 283 [2019-11-28 00:22:57,098 INFO L226 Difference]: Without dead ends: 209 [2019-11-28 00:22:57,099 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-28 00:22:57,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-11-28 00:22:57,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 145. [2019-11-28 00:22:57,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-11-28 00:22:57,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 188 transitions. [2019-11-28 00:22:57,120 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 188 transitions. Word has length 34 [2019-11-28 00:22:57,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:57,122 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 188 transitions. [2019-11-28 00:22:57,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:22:57,122 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 188 transitions. [2019-11-28 00:22:57,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-28 00:22:57,125 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:57,125 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:22:57,126 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:57,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:57,126 INFO L82 PathProgramCache]: Analyzing trace with hash 596801484, now seen corresponding path program 1 times [2019-11-28 00:22:57,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:57,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704319092] [2019-11-28 00:22:57,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:57,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:57,251 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:22:57,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704319092] [2019-11-28 00:22:57,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606702664] [2019-11-28 00:22:57,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:22:57,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:22:57,408 INFO L255 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 00:22:57,417 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:22:57,457 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:22:57,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:22:57,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-11-28 00:22:57,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652980751] [2019-11-28 00:22:57,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 00:22:57,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:22:57,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 00:22:57,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 00:22:57,463 INFO L87 Difference]: Start difference. First operand 145 states and 188 transitions. Second operand 6 states. [2019-11-28 00:22:57,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:22:57,667 INFO L93 Difference]: Finished difference Result 449 states and 597 transitions. [2019-11-28 00:22:57,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 00:22:57,668 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-11-28 00:22:57,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:22:57,671 INFO L225 Difference]: With dead ends: 449 [2019-11-28 00:22:57,675 INFO L226 Difference]: Without dead ends: 334 [2019-11-28 00:22:57,676 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-11-28 00:22:57,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-11-28 00:22:57,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 197. [2019-11-28 00:22:57,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-11-28 00:22:57,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 258 transitions. [2019-11-28 00:22:57,704 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 258 transitions. Word has length 53 [2019-11-28 00:22:57,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:22:57,705 INFO L462 AbstractCegarLoop]: Abstraction has 197 states and 258 transitions. [2019-11-28 00:22:57,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 00:22:57,705 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 258 transitions. [2019-11-28 00:22:57,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-28 00:22:57,707 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:22:57,707 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:22:57,916 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:22:57,917 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:22:57,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:22:57,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1994887391, now seen corresponding path program 2 times [2019-11-28 00:22:57,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:22:57,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155653481] [2019-11-28 00:22:57,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:22:58,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 00:22:58,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 00:22:58,183 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 00:22:58,184 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 00:22:58,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:22:58 BoogieIcfgContainer [2019-11-28 00:22:58,358 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 00:22:58,359 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 00:22:58,359 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 00:22:58,359 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 00:22:58,360 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:22:54" (3/4) ... [2019-11-28 00:22:58,363 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 00:22:58,566 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 00:22:58,567 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 00:22:58,569 INFO L168 Benchmark]: Toolchain (without parser) took 5605.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 201.3 MB). Free memory was 961.7 MB in the beginning and 1.0 GB in the end (delta: -69.6 MB). Peak memory consumption was 131.7 MB. Max. memory is 11.5 GB. [2019-11-28 00:22:58,570 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:22:58,570 INFO L168 Benchmark]: CACSL2BoogieTranslator took 605.41 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -131.7 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2019-11-28 00:22:58,571 INFO L168 Benchmark]: Boogie Procedure Inliner took 90.73 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.5 MB). Peak memory consumption was 8.5 MB. Max. memory is 11.5 GB. [2019-11-28 00:22:58,571 INFO L168 Benchmark]: Boogie Preprocessor took 63.14 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:22:58,571 INFO L168 Benchmark]: RCFGBuilder took 994.40 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 66.5 MB). Peak memory consumption was 66.5 MB. Max. memory is 11.5 GB. [2019-11-28 00:22:58,572 INFO L168 Benchmark]: TraceAbstraction took 3634.66 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 83.4 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -45.2 MB). Peak memory consumption was 38.1 MB. Max. memory is 11.5 GB. [2019-11-28 00:22:58,572 INFO L168 Benchmark]: Witness Printer took 208.25 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: 32.4 MB). Peak memory consumption was 32.4 MB. Max. memory is 11.5 GB. [2019-11-28 00:22:58,574 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 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 605.41 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -131.7 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 90.73 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.5 MB). Peak memory consumption was 8.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 63.14 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 994.40 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 66.5 MB). Peak memory consumption was 66.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3634.66 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 83.4 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -45.2 MB). Peak memory consumption was 38.1 MB. Max. memory is 11.5 GB. * Witness Printer took 208.25 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: 32.4 MB). Peak memory consumption was 32.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 543]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L40] int cleanupTimeShifts = 4; [L342] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L555] int pumpRunning = 0; [L556] int systemActive = 1; [L758] int waterLevel = 1; [L759] int methaneLevelCritical = 0; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L121] int retValue_acc ; [L122] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L945] int retValue_acc ; [L948] retValue_acc = 1 [L949] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L128] tmp = valid_product() [L130] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L853] int splverifierCounter ; [L854] int tmp ; [L855] int tmp___0 ; [L856] int tmp___1 ; [L857] int tmp___2 ; [L860] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L862] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L864] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L870] tmp = __VERIFIER_nondet_int() [L872] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L776] COND TRUE waterLevel < 2 [L777] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L880] tmp___0 = __VERIFIER_nondet_int() [L882] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L890] tmp___2 = __VERIFIER_nondet_int() [L892] COND TRUE \read(tmp___2) [L753] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L562] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L569] COND TRUE \read(systemActive) [L617] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L620] COND FALSE !(\read(pumpRunning)) [L591] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L594] COND TRUE ! pumpRunning [L731] int retValue_acc ; [L732] int tmp ; [L733] int tmp___0 ; [L838] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L841] COND FALSE !(waterLevel < 2) [L845] retValue_acc = 0 [L846] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L737] tmp = isHighWaterSensorDry() [L739] COND FALSE !(\read(tmp)) [L742] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L744] retValue_acc = tmp___0 [L745] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L596] tmp = isHighWaterLevel() [L598] COND TRUE \read(tmp) [L650] int tmp ; [L675] int retValue_acc ; [L797] int retValue_acc ; [L800] retValue_acc = methaneLevelCritical [L801] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L679] retValue_acc = isMethaneLevelCritical() [L681] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L654] tmp = isMethaneAlarm() [L656] COND FALSE !(\read(tmp)) [L645] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L148] int tmp ; [L149] int tmp___0 ; [L829] int retValue_acc ; [L832] retValue_acc = waterLevel [L833] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L153] tmp = getWaterLevel() [L155] COND FALSE !(tmp == 0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L862] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L864] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L870] tmp = __VERIFIER_nondet_int() [L872] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L880] tmp___0 = __VERIFIER_nondet_int() [L882] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L890] tmp___2 = __VERIFIER_nondet_int() [L892] COND TRUE \read(tmp___2) [L753] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L562] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L764] COND TRUE waterLevel > 0 [L765] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L569] COND TRUE \read(systemActive) [L617] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L620] COND TRUE \read(pumpRunning) [L675] int retValue_acc ; [L797] int retValue_acc ; [L800] retValue_acc = methaneLevelCritical [L801] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L679] retValue_acc = isMethaneLevelCritical() [L681] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L622] tmp = isMethaneAlarm() [L624] COND FALSE !(\read(tmp)) [L591] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L594] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L148] int tmp ; [L149] int tmp___0 ; [L829] int retValue_acc ; [L832] retValue_acc = waterLevel [L833] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L153] tmp = getWaterLevel() [L155] COND FALSE !(tmp == 0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L862] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L864] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L870] tmp = __VERIFIER_nondet_int() [L872] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L880] tmp___0 = __VERIFIER_nondet_int() [L882] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L890] tmp___2 = __VERIFIER_nondet_int() [L892] COND TRUE \read(tmp___2) [L753] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L562] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L764] COND TRUE waterLevel > 0 [L765] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L569] COND TRUE \read(systemActive) [L617] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L620] COND TRUE \read(pumpRunning) [L675] int retValue_acc ; [L797] int retValue_acc ; [L800] retValue_acc = methaneLevelCritical [L801] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L679] retValue_acc = isMethaneLevelCritical() [L681] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L622] tmp = isMethaneAlarm() [L624] COND FALSE !(\read(tmp)) [L591] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L594] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L148] int tmp ; [L149] int tmp___0 ; [L829] int retValue_acc ; [L832] retValue_acc = waterLevel [L833] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L153] tmp = getWaterLevel() [L155] COND TRUE tmp == 0 [L686] int retValue_acc ; [L689] retValue_acc = pumpRunning [L690] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L157] tmp___0 = isPumpRunning() [L159] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L543] __VERIFIER_error() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 129 locations, 3 error locations. Result: UNSAFE, OverallTime: 3.4s, OverallIterations: 11, TraceHistogramMax: 3, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1058 SDtfs, 1599 SDslu, 1503 SDs, 0 SdLazy, 235 SolverSat, 57 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 130 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=197occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 534 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 420 NumberOfCodeBlocks, 420 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 337 ConstructedInterpolants, 0 QuantifiedInterpolants, 23665 SizeOfPredicates, 4 NumberOfNonLiveVariables, 414 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 11 InterpolantComputations, 9 PerfectInterpolantSequences, 22/28 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...