./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/product-lines/minepump_spec1_product42.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_a1e039d5-9cde-4b90-ac40-21a2d708cc6b/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a1e039d5-9cde-4b90-ac40-21a2d708cc6b/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a1e039d5-9cde-4b90-ac40-21a2d708cc6b/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a1e039d5-9cde-4b90-ac40-21a2d708cc6b/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/product-lines/minepump_spec1_product42.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_a1e039d5-9cde-4b90-ac40-21a2d708cc6b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a1e039d5-9cde-4b90-ac40-21a2d708cc6b/bin/uautomizer --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 0f3978068d3e88eb2e8d08ee6f85f2ba09bbc729 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-cad4683 [2019-11-15 22:17:55,476 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:17:55,478 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:17:55,492 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:17:55,492 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:17:55,493 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:17:55,495 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:17:55,504 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:17:55,508 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:17:55,512 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:17:55,513 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:17:55,515 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:17:55,515 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:17:55,517 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:17:55,518 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:17:55,519 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:17:55,520 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:17:55,520 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:17:55,523 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:17:55,526 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:17:55,529 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:17:55,531 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:17:55,534 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:17:55,534 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:17:55,537 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:17:55,537 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:17:55,537 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:17:55,538 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:17:55,539 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:17:55,540 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:17:55,540 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:17:55,541 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:17:55,541 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:17:55,542 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:17:55,543 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:17:55,543 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:17:55,544 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:17:55,544 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:17:55,544 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:17:55,545 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:17:55,546 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:17:55,547 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a1e039d5-9cde-4b90-ac40-21a2d708cc6b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 22:17:55,571 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:17:55,580 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:17:55,582 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:17:55,582 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:17:55,582 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:17:55,583 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:17:55,583 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:17:55,583 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:17:55,583 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:17:55,584 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:17:55,584 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 22:17:55,584 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 22:17:55,584 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 22:17:55,585 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:17:55,585 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:17:55,585 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:17:55,586 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 22:17:55,586 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:17:55,586 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:17:55,586 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 22:17:55,587 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 22:17:55,587 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:17:55,587 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:17:55,587 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 22:17:55,588 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 22:17:55,588 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:17:55,588 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 22:17:55,589 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 22:17:55,589 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_a1e039d5-9cde-4b90-ac40-21a2d708cc6b/bin/uautomizer 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 -> 0f3978068d3e88eb2e8d08ee6f85f2ba09bbc729 [2019-11-15 22:17:55,622 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:17:55,636 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:17:55,639 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:17:55,640 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:17:55,640 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:17:55,642 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a1e039d5-9cde-4b90-ac40-21a2d708cc6b/bin/uautomizer/../../sv-benchmarks/c/product-lines/minepump_spec1_product42.cil.c [2019-11-15 22:17:55,697 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a1e039d5-9cde-4b90-ac40-21a2d708cc6b/bin/uautomizer/data/dd50107ee/63b751c2abcb4c14968f13a744bfd1a4/FLAG5df531fb5 [2019-11-15 22:17:56,133 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:17:56,133 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a1e039d5-9cde-4b90-ac40-21a2d708cc6b/sv-benchmarks/c/product-lines/minepump_spec1_product42.cil.c [2019-11-15 22:17:56,150 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a1e039d5-9cde-4b90-ac40-21a2d708cc6b/bin/uautomizer/data/dd50107ee/63b751c2abcb4c14968f13a744bfd1a4/FLAG5df531fb5 [2019-11-15 22:17:56,501 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a1e039d5-9cde-4b90-ac40-21a2d708cc6b/bin/uautomizer/data/dd50107ee/63b751c2abcb4c14968f13a744bfd1a4 [2019-11-15 22:17:56,504 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:17:56,505 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:17:56,506 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:17:56,506 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:17:56,509 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:17:56,510 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:17:56" (1/1) ... [2019-11-15 22:17:56,512 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27fb289e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:17:56, skipping insertion in model container [2019-11-15 22:17:56,513 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:17:56" (1/1) ... [2019-11-15 22:17:56,519 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:17:56,565 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:17:56,929 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:17:56,941 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:17:57,029 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:17:57,058 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:17:57,058 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:17:57 WrapperNode [2019-11-15 22:17:57,058 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:17:57,059 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:17:57,059 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:17:57,059 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:17:57,065 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:17:57" (1/1) ... [2019-11-15 22:17:57,081 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:17:57" (1/1) ... [2019-11-15 22:17:57,133 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:17:57,134 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:17:57,134 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:17:57,134 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:17:57,144 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:17:57" (1/1) ... [2019-11-15 22:17:57,145 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:17:57" (1/1) ... [2019-11-15 22:17:57,159 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:17:57" (1/1) ... [2019-11-15 22:17:57,160 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:17:57" (1/1) ... [2019-11-15 22:17:57,194 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:17:57" (1/1) ... [2019-11-15 22:17:57,200 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:17:57" (1/1) ... [2019-11-15 22:17:57,202 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:17:57" (1/1) ... [2019-11-15 22:17:57,206 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:17:57,206 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:17:57,206 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:17:57,206 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:17:57,207 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:17:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a1e039d5-9cde-4b90-ac40-21a2d708cc6b/bin/uautomizer/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-15 22:17:57,285 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 22:17:57,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-15 22:17:57,286 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:17:57,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:17:58,059 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:17:58,060 INFO L284 CfgBuilder]: Removed 116 assume(true) statements. [2019-11-15 22:17:58,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:17:58 BoogieIcfgContainer [2019-11-15 22:17:58,061 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:17:58,062 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 22:17:58,062 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 22:17:58,065 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 22:17:58,065 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:17:56" (1/3) ... [2019-11-15 22:17:58,066 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45534a4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:17:58, skipping insertion in model container [2019-11-15 22:17:58,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:17:57" (2/3) ... [2019-11-15 22:17:58,067 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45534a4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:17:58, skipping insertion in model container [2019-11-15 22:17:58,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:17:58" (3/3) ... [2019-11-15 22:17:58,069 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product42.cil.c [2019-11-15 22:17:58,077 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 22:17:58,084 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-15 22:17:58,094 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-15 22:17:58,116 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 22:17:58,116 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 22:17:58,117 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 22:17:58,117 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:17:58,117 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:17:58,117 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 22:17:58,117 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:17:58,117 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 22:17:58,133 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states. [2019-11-15 22:17:58,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-15 22:17:58,140 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:17:58,140 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:17:58,142 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:17:58,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:17:58,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1594902839, now seen corresponding path program 1 times [2019-11-15 22:17:58,155 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:17:58,155 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646763827] [2019-11-15 22:17:58,156 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:17:58,156 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:17:58,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:17:58,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:17:58,389 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-15 22:17:58,390 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646763827] [2019-11-15 22:17:58,391 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:17:58,391 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:17:58,391 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433517904] [2019-11-15 22:17:58,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-15 22:17:58,394 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:17:58,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-15 22:17:58,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-15 22:17:58,405 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 2 states. [2019-11-15 22:17:58,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:17:58,431 INFO L93 Difference]: Finished difference Result 168 states and 251 transitions. [2019-11-15 22:17:58,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-15 22:17:58,432 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-11-15 22:17:58,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:17:58,443 INFO L225 Difference]: With dead ends: 168 [2019-11-15 22:17:58,443 INFO L226 Difference]: Without dead ends: 83 [2019-11-15 22:17:58,446 INFO L600 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-15 22:17:58,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-15 22:17:58,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-11-15 22:17:58,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-15 22:17:58,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 117 transitions. [2019-11-15 22:17:58,495 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 117 transitions. Word has length 16 [2019-11-15 22:17:58,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:17:58,496 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 117 transitions. [2019-11-15 22:17:58,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-15 22:17:58,496 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 117 transitions. [2019-11-15 22:17:58,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-15 22:17:58,497 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:17:58,497 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:17:58,498 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:17:58,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:17:58,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1653307560, now seen corresponding path program 1 times [2019-11-15 22:17:58,498 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:17:58,498 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907367539] [2019-11-15 22:17:58,499 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:17:58,499 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:17:58,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:17:58,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:17:58,637 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-15 22:17:58,637 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907367539] [2019-11-15 22:17:58,637 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:17:58,638 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:17:58,638 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139730570] [2019-11-15 22:17:58,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:17:58,639 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:17:58,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:17:58,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:17:58,640 INFO L87 Difference]: Start difference. First operand 83 states and 117 transitions. Second operand 3 states. [2019-11-15 22:17:58,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:17:58,650 INFO L93 Difference]: Finished difference Result 83 states and 117 transitions. [2019-11-15 22:17:58,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:17:58,651 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-15 22:17:58,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:17:58,652 INFO L225 Difference]: With dead ends: 83 [2019-11-15 22:17:58,652 INFO L226 Difference]: Without dead ends: 37 [2019-11-15 22:17:58,653 INFO L600 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-15 22:17:58,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-11-15 22:17:58,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-11-15 22:17:58,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-15 22:17:58,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 52 transitions. [2019-11-15 22:17:58,658 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 52 transitions. Word has length 17 [2019-11-15 22:17:58,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:17:58,659 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 52 transitions. [2019-11-15 22:17:58,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:17:58,659 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 52 transitions. [2019-11-15 22:17:58,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-15 22:17:58,660 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:17:58,660 INFO L380 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-15 22:17:58,660 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:17:58,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:17:58,661 INFO L82 PathProgramCache]: Analyzing trace with hash 533078269, now seen corresponding path program 1 times [2019-11-15 22:17:58,661 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:17:58,661 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738298863] [2019-11-15 22:17:58,661 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:17:58,661 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:17:58,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:17:58,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:17:58,794 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-15 22:17:58,794 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738298863] [2019-11-15 22:17:58,794 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:17:58,795 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:17:58,795 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272996066] [2019-11-15 22:17:58,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:17:58,795 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:17:58,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:17:58,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:17:58,796 INFO L87 Difference]: Start difference. First operand 37 states and 52 transitions. Second operand 5 states. [2019-11-15 22:17:58,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:17:58,899 INFO L93 Difference]: Finished difference Result 68 states and 98 transitions. [2019-11-15 22:17:58,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:17:58,900 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-15 22:17:58,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:17:58,901 INFO L225 Difference]: With dead ends: 68 [2019-11-15 22:17:58,901 INFO L226 Difference]: Without dead ends: 37 [2019-11-15 22:17:58,901 INFO L600 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-15 22:17:58,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-11-15 22:17:58,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-11-15 22:17:58,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-15 22:17:58,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2019-11-15 22:17:58,907 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 22 [2019-11-15 22:17:58,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:17:58,908 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2019-11-15 22:17:58,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:17:58,908 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2019-11-15 22:17:58,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-15 22:17:58,909 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:17:58,909 INFO L380 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-15 22:17:58,910 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:17:58,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:17:58,910 INFO L82 PathProgramCache]: Analyzing trace with hash 545820985, now seen corresponding path program 1 times [2019-11-15 22:17:58,910 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:17:58,911 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317793906] [2019-11-15 22:17:58,911 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:17:58,911 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:17:58,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:17:58,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:17:58,996 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-15 22:17:58,996 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317793906] [2019-11-15 22:17:58,996 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:17:58,996 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:17:58,997 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167301804] [2019-11-15 22:17:58,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:17:58,997 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:17:58,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:17:58,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:17:58,998 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand 3 states. [2019-11-15 22:17:59,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:17:59,046 INFO L93 Difference]: Finished difference Result 89 states and 126 transitions. [2019-11-15 22:17:59,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:17:59,047 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-15 22:17:59,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:17:59,048 INFO L225 Difference]: With dead ends: 89 [2019-11-15 22:17:59,048 INFO L226 Difference]: Without dead ends: 58 [2019-11-15 22:17:59,049 INFO L600 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-15 22:17:59,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-11-15 22:17:59,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2019-11-15 22:17:59,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-15 22:17:59,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 78 transitions. [2019-11-15 22:17:59,061 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 78 transitions. Word has length 23 [2019-11-15 22:17:59,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:17:59,062 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 78 transitions. [2019-11-15 22:17:59,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:17:59,062 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 78 transitions. [2019-11-15 22:17:59,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-15 22:17:59,062 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:17:59,063 INFO L380 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-15 22:17:59,063 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:17:59,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:17:59,063 INFO L82 PathProgramCache]: Analyzing trace with hash 2110814541, now seen corresponding path program 1 times [2019-11-15 22:17:59,063 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:17:59,063 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465655080] [2019-11-15 22:17:59,063 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:17:59,064 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:17:59,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:17:59,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:17:59,160 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-15 22:17:59,160 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465655080] [2019-11-15 22:17:59,160 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:17:59,160 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:17:59,161 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242257869] [2019-11-15 22:17:59,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:17:59,161 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:17:59,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:17:59,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:17:59,162 INFO L87 Difference]: Start difference. First operand 56 states and 78 transitions. Second operand 5 states. [2019-11-15 22:17:59,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:17:59,378 INFO L93 Difference]: Finished difference Result 266 states and 385 transitions. [2019-11-15 22:17:59,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:17:59,378 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-11-15 22:17:59,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:17:59,381 INFO L225 Difference]: With dead ends: 266 [2019-11-15 22:17:59,381 INFO L226 Difference]: Without dead ends: 216 [2019-11-15 22:17:59,382 INFO L600 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-15 22:17:59,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-11-15 22:17:59,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 100. [2019-11-15 22:17:59,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-15 22:17:59,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 139 transitions. [2019-11-15 22:17:59,417 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 139 transitions. Word has length 29 [2019-11-15 22:17:59,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:17:59,418 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 139 transitions. [2019-11-15 22:17:59,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:17:59,418 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 139 transitions. [2019-11-15 22:17:59,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-15 22:17:59,419 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:17:59,419 INFO L380 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-15 22:17:59,420 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:17:59,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:17:59,420 INFO L82 PathProgramCache]: Analyzing trace with hash 331369175, now seen corresponding path program 1 times [2019-11-15 22:17:59,421 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:17:59,421 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553610848] [2019-11-15 22:17:59,421 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:17:59,421 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:17:59,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:17:59,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:17:59,488 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-15 22:17:59,488 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553610848] [2019-11-15 22:17:59,488 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:17:59,488 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:17:59,489 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434955065] [2019-11-15 22:17:59,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:17:59,489 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:17:59,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:17:59,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:17:59,490 INFO L87 Difference]: Start difference. First operand 100 states and 139 transitions. Second operand 5 states. [2019-11-15 22:17:59,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:17:59,630 INFO L93 Difference]: Finished difference Result 280 states and 394 transitions. [2019-11-15 22:17:59,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 22:17:59,631 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-11-15 22:17:59,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:17:59,634 INFO L225 Difference]: With dead ends: 280 [2019-11-15 22:17:59,634 INFO L226 Difference]: Without dead ends: 278 [2019-11-15 22:17:59,635 INFO L600 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-15 22:17:59,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-11-15 22:17:59,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 100. [2019-11-15 22:17:59,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-15 22:17:59,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 138 transitions. [2019-11-15 22:17:59,653 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 138 transitions. Word has length 30 [2019-11-15 22:17:59,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:17:59,654 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 138 transitions. [2019-11-15 22:17:59,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:17:59,654 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 138 transitions. [2019-11-15 22:17:59,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-15 22:17:59,655 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:17:59,656 INFO L380 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-15 22:17:59,656 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:17:59,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:17:59,656 INFO L82 PathProgramCache]: Analyzing trace with hash 261712181, now seen corresponding path program 1 times [2019-11-15 22:17:59,657 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:17:59,657 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969661383] [2019-11-15 22:17:59,657 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:17:59,657 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:17:59,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:17:59,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:17:59,720 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-15 22:17:59,720 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969661383] [2019-11-15 22:17:59,720 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:17:59,720 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:17:59,721 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866679410] [2019-11-15 22:17:59,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:17:59,721 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:17:59,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:17:59,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:17:59,722 INFO L87 Difference]: Start difference. First operand 100 states and 138 transitions. Second operand 5 states. [2019-11-15 22:17:59,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:17:59,782 INFO L93 Difference]: Finished difference Result 270 states and 372 transitions. [2019-11-15 22:17:59,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 22:17:59,785 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-11-15 22:17:59,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:17:59,787 INFO L225 Difference]: With dead ends: 270 [2019-11-15 22:17:59,787 INFO L226 Difference]: Without dead ends: 176 [2019-11-15 22:17:59,788 INFO L600 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-15 22:17:59,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-11-15 22:17:59,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 106. [2019-11-15 22:17:59,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-15 22:17:59,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 144 transitions. [2019-11-15 22:17:59,816 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 144 transitions. Word has length 33 [2019-11-15 22:17:59,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:17:59,816 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 144 transitions. [2019-11-15 22:17:59,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:17:59,816 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 144 transitions. [2019-11-15 22:17:59,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-15 22:17:59,823 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:17:59,823 INFO L380 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-15 22:17:59,823 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:17:59,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:17:59,824 INFO L82 PathProgramCache]: Analyzing trace with hash -325093833, now seen corresponding path program 1 times [2019-11-15 22:17:59,824 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:17:59,824 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234052574] [2019-11-15 22:17:59,824 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:17:59,824 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:17:59,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:17:59,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:17:59,888 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-15 22:17:59,889 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234052574] [2019-11-15 22:17:59,889 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:17:59,889 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:17:59,889 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994150614] [2019-11-15 22:17:59,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:17:59,890 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:17:59,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:17:59,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:17:59,891 INFO L87 Difference]: Start difference. First operand 106 states and 144 transitions. Second operand 4 states. [2019-11-15 22:17:59,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:17:59,932 INFO L93 Difference]: Finished difference Result 252 states and 342 transitions. [2019-11-15 22:17:59,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:17:59,933 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-11-15 22:17:59,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:17:59,934 INFO L225 Difference]: With dead ends: 252 [2019-11-15 22:17:59,934 INFO L226 Difference]: Without dead ends: 152 [2019-11-15 22:17:59,935 INFO L600 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-15 22:17:59,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-11-15 22:17:59,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 110. [2019-11-15 22:17:59,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-15 22:17:59,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 148 transitions. [2019-11-15 22:17:59,958 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 148 transitions. Word has length 33 [2019-11-15 22:17:59,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:17:59,959 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 148 transitions. [2019-11-15 22:17:59,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:17:59,959 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 148 transitions. [2019-11-15 22:17:59,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-15 22:17:59,963 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:17:59,963 INFO L380 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-15 22:17:59,964 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:17:59,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:17:59,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1604957511, now seen corresponding path program 1 times [2019-11-15 22:17:59,964 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:17:59,964 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323129827] [2019-11-15 22:17:59,965 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:17:59,965 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:17:59,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:17:59,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:18:00,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:18:00,044 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323129827] [2019-11-15 22:18:00,044 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:18:00,045 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:18:00,045 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304680330] [2019-11-15 22:18:00,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:18:00,045 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:18:00,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:18:00,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:18:00,046 INFO L87 Difference]: Start difference. First operand 110 states and 148 transitions. Second operand 3 states. [2019-11-15 22:18:00,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:18:00,076 INFO L93 Difference]: Finished difference Result 262 states and 352 transitions. [2019-11-15 22:18:00,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:18:00,077 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-15 22:18:00,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:18:00,078 INFO L225 Difference]: With dead ends: 262 [2019-11-15 22:18:00,079 INFO L226 Difference]: Without dead ends: 158 [2019-11-15 22:18:00,079 INFO L600 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-15 22:18:00,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-15 22:18:00,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2019-11-15 22:18:00,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-11-15 22:18:00,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 206 transitions. [2019-11-15 22:18:00,097 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 206 transitions. Word has length 33 [2019-11-15 22:18:00,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:18:00,097 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 206 transitions. [2019-11-15 22:18:00,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:18:00,097 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 206 transitions. [2019-11-15 22:18:00,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-15 22:18:00,098 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:18:00,098 INFO L380 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-15 22:18:00,099 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:18:00,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:18:00,099 INFO L82 PathProgramCache]: Analyzing trace with hash -447661573, now seen corresponding path program 1 times [2019-11-15 22:18:00,099 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:18:00,099 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773094137] [2019-11-15 22:18:00,100 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:18:00,100 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:18:00,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:18:00,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:18:00,170 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-15 22:18:00,170 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773094137] [2019-11-15 22:18:00,171 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:18:00,171 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:18:00,171 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950693750] [2019-11-15 22:18:00,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:18:00,171 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:18:00,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:18:00,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:18:00,172 INFO L87 Difference]: Start difference. First operand 158 states and 206 transitions. Second operand 6 states. [2019-11-15 22:18:00,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:18:00,397 INFO L93 Difference]: Finished difference Result 482 states and 630 transitions. [2019-11-15 22:18:00,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 22:18:00,397 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-11-15 22:18:00,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:18:00,400 INFO L225 Difference]: With dead ends: 482 [2019-11-15 22:18:00,400 INFO L226 Difference]: Without dead ends: 330 [2019-11-15 22:18:00,405 INFO L600 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-15 22:18:00,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-11-15 22:18:00,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 158. [2019-11-15 22:18:00,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-11-15 22:18:00,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 202 transitions. [2019-11-15 22:18:00,426 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 202 transitions. Word has length 34 [2019-11-15 22:18:00,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:18:00,426 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 202 transitions. [2019-11-15 22:18:00,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:18:00,426 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 202 transitions. [2019-11-15 22:18:00,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-15 22:18:00,427 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:18:00,428 INFO L380 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-15 22:18:00,428 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:18:00,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:18:00,428 INFO L82 PathProgramCache]: Analyzing trace with hash -2059222374, now seen corresponding path program 1 times [2019-11-15 22:18:00,429 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:18:00,429 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990163932] [2019-11-15 22:18:00,429 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:18:00,429 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:18:00,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:18:00,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:18:01,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:18:01,230 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:18:01,230 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 22:18:01,367 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 10:18:01 BoogieIcfgContainer [2019-11-15 22:18:01,367 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 22:18:01,367 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:18:01,367 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:18:01,368 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:18:01,368 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:17:58" (3/4) ... [2019-11-15 22:18:01,370 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-15 22:18:01,516 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_a1e039d5-9cde-4b90-ac40-21a2d708cc6b/bin/uautomizer/witness.graphml [2019-11-15 22:18:01,516 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:18:01,518 INFO L168 Benchmark]: Toolchain (without parser) took 5012.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 179.3 MB). Free memory was 952.8 MB in the beginning and 1.2 GB in the end (delta: -221.0 MB). Peak memory consumption was 228.3 MB. Max. memory is 11.5 GB. [2019-11-15 22:18:01,518 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:18:01,519 INFO L168 Benchmark]: CACSL2BoogieTranslator took 552.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 947.4 MB in the beginning and 1.1 GB in the end (delta: -158.4 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-11-15 22:18:01,519 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.81 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-15 22:18:01,520 INFO L168 Benchmark]: Boogie Preprocessor took 72.31 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-15 22:18:01,520 INFO L168 Benchmark]: RCFGBuilder took 854.97 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: 60.0 MB). Peak memory consumption was 60.0 MB. Max. memory is 11.5 GB. [2019-11-15 22:18:01,520 INFO L168 Benchmark]: TraceAbstraction took 3304.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 866.5 MB in the end (delta: 172.6 MB). Peak memory consumption was 172.6 MB. Max. memory is 11.5 GB. [2019-11-15 22:18:01,521 INFO L168 Benchmark]: Witness Printer took 149.11 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 56.1 MB). Free memory was 866.5 MB in the beginning and 1.2 GB in the end (delta: -307.2 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. [2019-11-15 22:18:01,522 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 552.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 947.4 MB in the beginning and 1.1 GB in the end (delta: -158.4 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 74.81 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. * Boogie Preprocessor took 72.31 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 854.97 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: 60.0 MB). Peak memory consumption was 60.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3304.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 866.5 MB in the end (delta: 172.6 MB). Peak memory consumption was 172.6 MB. Max. memory is 11.5 GB. * Witness Printer took 149.11 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 56.1 MB). Free memory was 866.5 MB in the beginning and 1.2 GB in the end (delta: -307.2 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 764]: 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; [L413] int waterLevel = 1; [L414] int methaneLevelCritical = 0; [L581] int pumpRunning = 0; [L582] int systemActive = 1; [L833] int cleanupTimeShifts = 4; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L906] int retValue_acc ; [L907] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L824] int retValue_acc ; [L827] retValue_acc = 1 [L828] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L913] tmp = valid_product() [L915] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L511] int splverifierCounter ; [L512] int tmp ; [L513] int tmp___0 ; [L514] int tmp___1 ; [L515] int tmp___2 ; [L518] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L520] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L522] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L528] tmp = __VERIFIER_nondet_int() [L530] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L431] COND TRUE waterLevel < 2 [L432] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L538] tmp___0 = __VERIFIER_nondet_int() [L540] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L548] tmp___2 = __VERIFIER_nondet_int() [L550] COND TRUE \read(tmp___2) [L755] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L589] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L596] COND TRUE \read(systemActive) [L618] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L621] COND TRUE ! pumpRunning [L733] int retValue_acc ; [L734] int tmp ; [L735] int tmp___0 ; [L493] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L496] COND FALSE !(waterLevel < 2) [L500] retValue_acc = 0 [L501] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L739] tmp = isHighWaterSensorDry() [L741] COND FALSE !(\read(tmp)) [L744] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L746] retValue_acc = tmp___0 [L747] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L623] tmp = isHighWaterLevel() [L625] COND TRUE \read(tmp) [L652] int tmp ; [L677] int retValue_acc ; [L452] int retValue_acc ; [L455] retValue_acc = methaneLevelCritical [L456] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L681] retValue_acc = isMethaneLevelCritical() [L683] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L656] tmp = isMethaneAlarm() [L658] COND FALSE !(\read(tmp)) [L646] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L770] int tmp ; [L771] int tmp___0 ; [L452] int retValue_acc ; [L455] retValue_acc = methaneLevelCritical [L456] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L775] tmp = isMethaneLevelCritical() [L777] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L520] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L522] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L528] tmp = __VERIFIER_nondet_int() [L530] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L538] tmp___0 = __VERIFIER_nondet_int() [L540] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L443] COND FALSE !(\read(methaneLevelCritical)) [L446] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L548] tmp___2 = __VERIFIER_nondet_int() [L550] COND TRUE \read(tmp___2) [L755] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L589] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L419] COND TRUE waterLevel > 0 [L420] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L596] COND TRUE \read(systemActive) [L618] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L621] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L770] int tmp ; [L771] int tmp___0 ; [L452] int retValue_acc ; [L455] retValue_acc = methaneLevelCritical [L456] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L775] tmp = isMethaneLevelCritical() [L777] COND TRUE \read(tmp) [L688] int retValue_acc ; [L691] retValue_acc = pumpRunning [L692] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L779] tmp___0 = isPumpRunning() [L781] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L764] __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: 3.2s, OverallIterations: 11, TraceHistogramMax: 2, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 748 SDtfs, 1018 SDslu, 1178 SDs, 0 SdLazy, 167 SolverSat, 24 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s 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.6s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 319 NumberOfCodeBlocks, 319 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 260 ConstructedInterpolants, 0 QuantifiedInterpolants, 13590 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...