./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec2_product33.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 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_spec2_product33.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 7aed16b7a73618bd36d72dc3243e4d7bd764fb49 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-678e011 [2019-11-19 21:22:27,002 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 21:22:27,005 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 21:22:27,023 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 21:22:27,023 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 21:22:27,025 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 21:22:27,027 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 21:22:27,036 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 21:22:27,040 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 21:22:27,044 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 21:22:27,045 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 21:22:27,046 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 21:22:27,047 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 21:22:27,050 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 21:22:27,051 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 21:22:27,052 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 21:22:27,053 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 21:22:27,054 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 21:22:27,056 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 21:22:27,060 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 21:22:27,064 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 21:22:27,066 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 21:22:27,068 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 21:22:27,070 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 21:22:27,072 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 21:22:27,072 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 21:22:27,072 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 21:22:27,074 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 21:22:27,074 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 21:22:27,075 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 21:22:27,075 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 21:22:27,076 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 21:22:27,077 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 21:22:27,077 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 21:22:27,079 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 21:22:27,079 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 21:22:27,080 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 21:22:27,080 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 21:22:27,080 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 21:22:27,081 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 21:22:27,082 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 21:22:27,083 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-19 21:22:27,118 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 21:22:27,119 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 21:22:27,120 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 21:22:27,120 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 21:22:27,120 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 21:22:27,120 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 21:22:27,121 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 21:22:27,121 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 21:22:27,121 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 21:22:27,121 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 21:22:27,121 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 21:22:27,122 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 21:22:27,122 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 21:22:27,122 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 21:22:27,122 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 21:22:27,122 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 21:22:27,123 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 21:22:27,123 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 21:22:27,123 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 21:22:27,123 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 21:22:27,123 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 21:22:27,124 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 21:22:27,124 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 21:22:27,124 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 21:22:27,124 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 21:22:27,125 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 21:22:27,125 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 21:22:27,125 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 21:22:27,125 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 -> 7aed16b7a73618bd36d72dc3243e4d7bd764fb49 [2019-11-19 21:22:27,416 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 21:22:27,440 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 21:22:27,444 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 21:22:27,445 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 21:22:27,445 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 21:22:27,447 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec2_product33.cil.c [2019-11-19 21:22:27,516 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66e6f6e41/d10ee742411547cca8f87afda3c51473/FLAGf8de82b36 [2019-11-19 21:22:28,047 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 21:22:28,048 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product33.cil.c [2019-11-19 21:22:28,061 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66e6f6e41/d10ee742411547cca8f87afda3c51473/FLAGf8de82b36 [2019-11-19 21:22:28,358 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66e6f6e41/d10ee742411547cca8f87afda3c51473 [2019-11-19 21:22:28,361 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 21:22:28,363 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 21:22:28,364 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 21:22:28,364 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 21:22:28,367 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 21:22:28,368 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:22:28" (1/1) ... [2019-11-19 21:22:28,371 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5efaf713 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:22:28, skipping insertion in model container [2019-11-19 21:22:28,371 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:22:28" (1/1) ... [2019-11-19 21:22:28,378 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 21:22:28,440 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 21:22:28,834 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 21:22:28,853 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 21:22:28,932 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 21:22:28,964 INFO L192 MainTranslator]: Completed translation [2019-11-19 21:22:28,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:22:28 WrapperNode [2019-11-19 21:22:28,964 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 21:22:28,965 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 21:22:28,965 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 21:22:28,965 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 21:22:28,974 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:22:28" (1/1) ... [2019-11-19 21:22:28,992 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:22:28" (1/1) ... [2019-11-19 21:22:29,032 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 21:22:29,033 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 21:22:29,033 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 21:22:29,033 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 21:22:29,043 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:22:28" (1/1) ... [2019-11-19 21:22:29,043 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:22:28" (1/1) ... [2019-11-19 21:22:29,047 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:22:28" (1/1) ... [2019-11-19 21:22:29,047 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:22:28" (1/1) ... [2019-11-19 21:22:29,057 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:22:28" (1/1) ... [2019-11-19 21:22:29,065 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:22:28" (1/1) ... [2019-11-19 21:22:29,070 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:22:28" (1/1) ... [2019-11-19 21:22:29,075 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 21:22:29,075 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 21:22:29,075 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 21:22:29,076 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 21:22:29,085 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:22:28" (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-19 21:22:29,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-19 21:22:29,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-19 21:22:29,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 21:22:29,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 21:22:29,933 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 21:22:29,934 INFO L285 CfgBuilder]: Removed 98 assume(true) statements. [2019-11-19 21:22:29,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:22:29 BoogieIcfgContainer [2019-11-19 21:22:29,936 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 21:22:29,937 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 21:22:29,937 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 21:22:29,941 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 21:22:29,942 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:22:28" (1/3) ... [2019-11-19 21:22:29,943 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@795ada21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:22:29, skipping insertion in model container [2019-11-19 21:22:29,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:22:28" (2/3) ... [2019-11-19 21:22:29,944 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@795ada21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:22:29, skipping insertion in model container [2019-11-19 21:22:29,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:22:29" (3/3) ... [2019-11-19 21:22:29,953 INFO L109 eAbstractionObserver]: Analyzing ICFG minepump_spec2_product33.cil.c [2019-11-19 21:22:29,961 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 21:22:29,968 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-19 21:22:29,979 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-19 21:22:30,000 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 21:22:30,000 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 21:22:30,001 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 21:22:30,001 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 21:22:30,001 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 21:22:30,001 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 21:22:30,001 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 21:22:30,002 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 21:22:30,016 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2019-11-19 21:22:30,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-19 21:22:30,023 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:22:30,023 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:22:30,024 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:22:30,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:22:30,030 INFO L82 PathProgramCache]: Analyzing trace with hash -816697532, now seen corresponding path program 1 times [2019-11-19 21:22:30,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:22:30,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680850849] [2019-11-19 21:22:30,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:22:30,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:22:30,301 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-19 21:22:30,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680850849] [2019-11-19 21:22:30,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:22:30,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 21:22:30,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080446330] [2019-11-19 21:22:30,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-19 21:22:30,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:22:30,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-19 21:22:30,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-19 21:22:30,324 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 2 states. [2019-11-19 21:22:30,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:22:30,354 INFO L93 Difference]: Finished difference Result 157 states and 240 transitions. [2019-11-19 21:22:30,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-19 21:22:30,356 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2019-11-19 21:22:30,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:22:30,366 INFO L225 Difference]: With dead ends: 157 [2019-11-19 21:22:30,367 INFO L226 Difference]: Without dead ends: 78 [2019-11-19 21:22:30,370 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-19 21:22:30,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-19 21:22:30,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-11-19 21:22:30,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-19 21:22:30,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 112 transitions. [2019-11-19 21:22:30,410 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 112 transitions. Word has length 18 [2019-11-19 21:22:30,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:22:30,410 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 112 transitions. [2019-11-19 21:22:30,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-19 21:22:30,411 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 112 transitions. [2019-11-19 21:22:30,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-19 21:22:30,412 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:22:30,412 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:22:30,412 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:22:30,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:22:30,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1035533501, now seen corresponding path program 1 times [2019-11-19 21:22:30,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:22:30,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876205189] [2019-11-19 21:22:30,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:22:30,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:22:30,534 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-19 21:22:30,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876205189] [2019-11-19 21:22:30,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:22:30,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 21:22:30,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465734678] [2019-11-19 21:22:30,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 21:22:30,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:22:30,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 21:22:30,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:22:30,541 INFO L87 Difference]: Start difference. First operand 78 states and 112 transitions. Second operand 3 states. [2019-11-19 21:22:30,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:22:30,562 INFO L93 Difference]: Finished difference Result 78 states and 112 transitions. [2019-11-19 21:22:30,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 21:22:30,563 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-19 21:22:30,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:22:30,566 INFO L225 Difference]: With dead ends: 78 [2019-11-19 21:22:30,566 INFO L226 Difference]: Without dead ends: 36 [2019-11-19 21:22:30,567 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-19 21:22:30,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-19 21:22:30,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-11-19 21:22:30,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-19 21:22:30,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 51 transitions. [2019-11-19 21:22:30,574 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 51 transitions. Word has length 19 [2019-11-19 21:22:30,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:22:30,574 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 51 transitions. [2019-11-19 21:22:30,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 21:22:30,575 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 51 transitions. [2019-11-19 21:22:30,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-19 21:22:30,576 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:22:30,576 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-19 21:22:30,576 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:22:30,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:22:30,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1153900874, now seen corresponding path program 1 times [2019-11-19 21:22:30,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:22:30,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558600761] [2019-11-19 21:22:30,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:22:30,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:22:30,725 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-19 21:22:30,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558600761] [2019-11-19 21:22:30,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:22:30,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 21:22:30,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212507115] [2019-11-19 21:22:30,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 21:22:30,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:22:30,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 21:22:30,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-19 21:22:30,729 INFO L87 Difference]: Start difference. First operand 36 states and 51 transitions. Second operand 6 states. [2019-11-19 21:22:30,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:22:30,852 INFO L93 Difference]: Finished difference Result 65 states and 95 transitions. [2019-11-19 21:22:30,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 21:22:30,854 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-11-19 21:22:30,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:22:30,855 INFO L225 Difference]: With dead ends: 65 [2019-11-19 21:22:30,855 INFO L226 Difference]: Without dead ends: 36 [2019-11-19 21:22:30,856 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-19 21:22:30,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-19 21:22:30,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-11-19 21:22:30,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-19 21:22:30,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 50 transitions. [2019-11-19 21:22:30,867 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 50 transitions. Word has length 24 [2019-11-19 21:22:30,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:22:30,870 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 50 transitions. [2019-11-19 21:22:30,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 21:22:30,870 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 50 transitions. [2019-11-19 21:22:30,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-19 21:22:30,872 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:22:30,873 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:22:30,873 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:22:30,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:22:30,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1264883623, now seen corresponding path program 1 times [2019-11-19 21:22:30,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:22:30,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942319161] [2019-11-19 21:22:30,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:22:30,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:22:30,967 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-19 21:22:30,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942319161] [2019-11-19 21:22:30,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:22:30,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 21:22:30,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950230522] [2019-11-19 21:22:30,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 21:22:30,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:22:30,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 21:22:30,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:22:30,969 INFO L87 Difference]: Start difference. First operand 36 states and 50 transitions. Second operand 3 states. [2019-11-19 21:22:30,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:22:30,992 INFO L93 Difference]: Finished difference Result 87 states and 125 transitions. [2019-11-19 21:22:30,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 21:22:30,993 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-19 21:22:30,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:22:30,994 INFO L225 Difference]: With dead ends: 87 [2019-11-19 21:22:30,994 INFO L226 Difference]: Without dead ends: 58 [2019-11-19 21:22:30,995 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-19 21:22:30,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-11-19 21:22:31,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2019-11-19 21:22:31,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-19 21:22:31,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 79 transitions. [2019-11-19 21:22:31,004 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 79 transitions. Word has length 25 [2019-11-19 21:22:31,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:22:31,005 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 79 transitions. [2019-11-19 21:22:31,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 21:22:31,005 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 79 transitions. [2019-11-19 21:22:31,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-19 21:22:31,006 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:22:31,006 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-19 21:22:31,007 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:22:31,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:22:31,007 INFO L82 PathProgramCache]: Analyzing trace with hash -703728504, now seen corresponding path program 1 times [2019-11-19 21:22:31,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:22:31,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218187718] [2019-11-19 21:22:31,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:22:31,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:22:31,091 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-19 21:22:31,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218187718] [2019-11-19 21:22:31,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:22:31,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 21:22:31,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944367811] [2019-11-19 21:22:31,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 21:22:31,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:22:31,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 21:22:31,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:22:31,094 INFO L87 Difference]: Start difference. First operand 56 states and 79 transitions. Second operand 5 states. [2019-11-19 21:22:31,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:22:31,163 INFO L93 Difference]: Finished difference Result 145 states and 205 transitions. [2019-11-19 21:22:31,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 21:22:31,164 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-11-19 21:22:31,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:22:31,165 INFO L225 Difference]: With dead ends: 145 [2019-11-19 21:22:31,165 INFO L226 Difference]: Without dead ends: 96 [2019-11-19 21:22:31,166 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-19 21:22:31,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-11-19 21:22:31,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 59. [2019-11-19 21:22:31,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-19 21:22:31,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 82 transitions. [2019-11-19 21:22:31,177 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 82 transitions. Word has length 31 [2019-11-19 21:22:31,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:22:31,177 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 82 transitions. [2019-11-19 21:22:31,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 21:22:31,178 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 82 transitions. [2019-11-19 21:22:31,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-19 21:22:31,179 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:22:31,179 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-19 21:22:31,180 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:22:31,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:22:31,180 INFO L82 PathProgramCache]: Analyzing trace with hash 229735205, now seen corresponding path program 1 times [2019-11-19 21:22:31,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:22:31,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453385866] [2019-11-19 21:22:31,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:22:31,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:22:31,273 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-19 21:22:31,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453385866] [2019-11-19 21:22:31,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:22:31,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 21:22:31,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285866013] [2019-11-19 21:22:31,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 21:22:31,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:22:31,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 21:22:31,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:22:31,276 INFO L87 Difference]: Start difference. First operand 59 states and 82 transitions. Second operand 5 states. [2019-11-19 21:22:31,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:22:31,397 INFO L93 Difference]: Finished difference Result 207 states and 293 transitions. [2019-11-19 21:22:31,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 21:22:31,399 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-11-19 21:22:31,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:22:31,401 INFO L225 Difference]: With dead ends: 207 [2019-11-19 21:22:31,401 INFO L226 Difference]: Without dead ends: 155 [2019-11-19 21:22:31,402 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-19 21:22:31,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-11-19 21:22:31,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 58. [2019-11-19 21:22:31,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-19 21:22:31,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 79 transitions. [2019-11-19 21:22:31,418 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 79 transitions. Word has length 31 [2019-11-19 21:22:31,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:22:31,419 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 79 transitions. [2019-11-19 21:22:31,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 21:22:31,419 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 79 transitions. [2019-11-19 21:22:31,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-19 21:22:31,420 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:22:31,420 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-19 21:22:31,421 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:22:31,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:22:31,421 INFO L82 PathProgramCache]: Analyzing trace with hash -2663926, now seen corresponding path program 1 times [2019-11-19 21:22:31,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:22:31,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621349412] [2019-11-19 21:22:31,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:22:31,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:22:31,473 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-19 21:22:31,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621349412] [2019-11-19 21:22:31,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:22:31,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 21:22:31,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649899222] [2019-11-19 21:22:31,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:22:31,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:22:31,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:22:31,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:22:31,475 INFO L87 Difference]: Start difference. First operand 58 states and 79 transitions. Second operand 4 states. [2019-11-19 21:22:31,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:22:31,510 INFO L93 Difference]: Finished difference Result 133 states and 183 transitions. [2019-11-19 21:22:31,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:22:31,511 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-11-19 21:22:31,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:22:31,512 INFO L225 Difference]: With dead ends: 133 [2019-11-19 21:22:31,512 INFO L226 Difference]: Without dead ends: 82 [2019-11-19 21:22:31,513 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:22:31,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-11-19 21:22:31,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 60. [2019-11-19 21:22:31,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-19 21:22:31,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 81 transitions. [2019-11-19 21:22:31,522 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 81 transitions. Word has length 31 [2019-11-19 21:22:31,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:22:31,523 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 81 transitions. [2019-11-19 21:22:31,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:22:31,523 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 81 transitions. [2019-11-19 21:22:31,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-19 21:22:31,524 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:22:31,524 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-19 21:22:31,525 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:22:31,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:22:31,525 INFO L82 PathProgramCache]: Analyzing trace with hash -589469940, now seen corresponding path program 1 times [2019-11-19 21:22:31,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:22:31,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999050419] [2019-11-19 21:22:31,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:22:31,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:22:31,580 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-19 21:22:31,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999050419] [2019-11-19 21:22:31,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:22:31,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 21:22:31,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895236828] [2019-11-19 21:22:31,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 21:22:31,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:22:31,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 21:22:31,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:22:31,583 INFO L87 Difference]: Start difference. First operand 60 states and 81 transitions. Second operand 3 states. [2019-11-19 21:22:31,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:22:31,606 INFO L93 Difference]: Finished difference Result 138 states and 188 transitions. [2019-11-19 21:22:31,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 21:22:31,607 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-19 21:22:31,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:22:31,608 INFO L225 Difference]: With dead ends: 138 [2019-11-19 21:22:31,608 INFO L226 Difference]: Without dead ends: 85 [2019-11-19 21:22:31,609 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-19 21:22:31,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-11-19 21:22:31,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-11-19 21:22:31,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-11-19 21:22:31,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 112 transitions. [2019-11-19 21:22:31,622 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 112 transitions. Word has length 31 [2019-11-19 21:22:31,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:22:31,622 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 112 transitions. [2019-11-19 21:22:31,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 21:22:31,623 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 112 transitions. [2019-11-19 21:22:31,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-19 21:22:31,624 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:22:31,624 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] [2019-11-19 21:22:31,625 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:22:31,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:22:31,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1606491700, now seen corresponding path program 1 times [2019-11-19 21:22:31,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:22:31,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946883812] [2019-11-19 21:22:31,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:22:31,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:22:31,697 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-19 21:22:31,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946883812] [2019-11-19 21:22:31,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:22:31,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 21:22:31,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495766416] [2019-11-19 21:22:31,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 21:22:31,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:22:31,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 21:22:31,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:22:31,702 INFO L87 Difference]: Start difference. First operand 85 states and 112 transitions. Second operand 3 states. [2019-11-19 21:22:31,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:22:31,737 INFO L93 Difference]: Finished difference Result 126 states and 168 transitions. [2019-11-19 21:22:31,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 21:22:31,738 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-19 21:22:31,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:22:31,739 INFO L225 Difference]: With dead ends: 126 [2019-11-19 21:22:31,739 INFO L226 Difference]: Without dead ends: 124 [2019-11-19 21:22:31,740 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-19 21:22:31,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-11-19 21:22:31,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 114. [2019-11-19 21:22:31,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-19 21:22:31,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 155 transitions. [2019-11-19 21:22:31,755 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 155 transitions. Word has length 32 [2019-11-19 21:22:31,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:22:31,756 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 155 transitions. [2019-11-19 21:22:31,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 21:22:31,756 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 155 transitions. [2019-11-19 21:22:31,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-19 21:22:31,758 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:22:31,759 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:22:31,760 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:22:31,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:22:31,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1682990208, now seen corresponding path program 1 times [2019-11-19 21:22:31,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:22:31,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733310431] [2019-11-19 21:22:31,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:22:31,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:22:31,877 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-19 21:22:31,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733310431] [2019-11-19 21:22:31,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:22:31,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 21:22:31,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373888729] [2019-11-19 21:22:31,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 21:22:31,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:22:31,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 21:22:31,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:22:31,880 INFO L87 Difference]: Start difference. First operand 114 states and 155 transitions. Second operand 5 states. [2019-11-19 21:22:31,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:22:31,981 INFO L93 Difference]: Finished difference Result 358 states and 492 transitions. [2019-11-19 21:22:31,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 21:22:31,982 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-11-19 21:22:31,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:22:31,984 INFO L225 Difference]: With dead ends: 358 [2019-11-19 21:22:31,984 INFO L226 Difference]: Without dead ends: 251 [2019-11-19 21:22:31,985 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-19 21:22:31,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-11-19 21:22:32,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 183. [2019-11-19 21:22:32,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-11-19 21:22:32,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 244 transitions. [2019-11-19 21:22:32,008 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 244 transitions. Word has length 50 [2019-11-19 21:22:32,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:22:32,009 INFO L462 AbstractCegarLoop]: Abstraction has 183 states and 244 transitions. [2019-11-19 21:22:32,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 21:22:32,009 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 244 transitions. [2019-11-19 21:22:32,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-19 21:22:32,011 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:22:32,011 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:22:32,011 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:22:32,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:22:32,012 INFO L82 PathProgramCache]: Analyzing trace with hash 967205496, now seen corresponding path program 1 times [2019-11-19 21:22:32,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:22:32,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929764433] [2019-11-19 21:22:32,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:22:32,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 21:22:32,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 21:22:32,221 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 21:22:32,221 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-19 21:22:32,430 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 09:22:32 BoogieIcfgContainer [2019-11-19 21:22:32,432 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 21:22:32,432 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 21:22:32,433 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 21:22:32,433 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 21:22:32,434 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:22:29" (3/4) ... [2019-11-19 21:22:32,438 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-19 21:22:32,672 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-19 21:22:32,672 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 21:22:32,676 INFO L168 Benchmark]: Toolchain (without parser) took 4311.20 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 227.0 MB). Free memory was 951.0 MB in the beginning and 1.2 GB in the end (delta: -244.1 MB). Peak memory consumption was 284.2 MB. Max. memory is 11.5 GB. [2019-11-19 21:22:32,676 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 21:22:32,677 INFO L168 Benchmark]: CACSL2BoogieTranslator took 601.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -176.8 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. [2019-11-19 21:22:32,677 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB. [2019-11-19 21:22:32,678 INFO L168 Benchmark]: Boogie Preprocessor took 42.42 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-19 21:22:32,678 INFO L168 Benchmark]: RCFGBuilder took 860.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 57.0 MB). Peak memory consumption was 57.0 MB. Max. memory is 11.5 GB. [2019-11-19 21:22:32,678 INFO L168 Benchmark]: TraceAbstraction took 2495.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 825.8 MB in the end (delta: 236.7 MB). Peak memory consumption was 236.7 MB. Max. memory is 11.5 GB. [2019-11-19 21:22:32,679 INFO L168 Benchmark]: Witness Printer took 239.54 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 82.8 MB). Free memory was 825.8 MB in the beginning and 1.2 GB in the end (delta: -369.3 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. [2019-11-19 21:22:32,681 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.23 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 601.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -176.8 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 67.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.42 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 860.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 57.0 MB). Peak memory consumption was 57.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2495.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 825.8 MB in the end (delta: 236.7 MB). Peak memory consumption was 236.7 MB. Max. memory is 11.5 GB. * Witness Printer took 239.54 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 82.8 MB). Free memory was 825.8 MB in the beginning and 1.2 GB in the end (delta: -369.3 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 284]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L85] int waterLevel = 1; [L86] int methaneLevelCritical = 0; [L179] int cleanupTimeShifts = 4; [L292] int pumpRunning = 0; [L293] int systemActive = 1; [L679] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L876] int methAndRunningLastTime ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L257] int retValue_acc ; [L258] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L69] int retValue_acc ; [L72] retValue_acc = 1 [L73] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L264] tmp = valid_product() [L266] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L881] methAndRunningLastTime = 0 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L446] int splverifierCounter ; [L447] int tmp ; [L448] int tmp___0 ; [L449] int tmp___1 ; [L450] int tmp___2 ; [L453] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L455] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L457] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L463] tmp = __VERIFIER_nondet_int() [L465] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L103] COND TRUE waterLevel < 2 [L104] waterLevel = waterLevel + 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L473] tmp___0 = __VERIFIER_nondet_int() [L475] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L115] COND FALSE !(\read(methaneLevelCritical)) [L118] methaneLevelCritical = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L483] tmp___2 = __VERIFIER_nondet_int() [L485] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L300] COND FALSE !(\read(pumpRunning)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L307] COND TRUE \read(systemActive) [L329] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L332] COND TRUE ! pumpRunning [L426] int retValue_acc ; [L427] int tmp ; [L428] int tmp___0 ; [L165] int retValue_acc ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L168] COND FALSE !(waterLevel < 2) [L172] retValue_acc = 0 [L173] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L432] tmp = isHighWaterSensorDry() [L434] COND FALSE !(\read(tmp)) [L437] tmp___0 = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L439] retValue_acc = tmp___0 [L440] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L334] tmp = isHighWaterLevel() [L336] COND TRUE \read(tmp) [L357] pumpRunning = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L886] int tmp ; [L887] int tmp___0 ; [L124] int retValue_acc ; [L127] retValue_acc = methaneLevelCritical [L128] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L891] tmp = isMethaneLevelCritical() [L893] COND TRUE \read(tmp) [L381] int retValue_acc ; [L384] retValue_acc = pumpRunning [L385] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L895] tmp___0 = isPumpRunning() [L897] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L898] COND FALSE !(\read(methAndRunningLastTime)) [L903] methAndRunningLastTime = 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L455] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L457] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L463] tmp = __VERIFIER_nondet_int() [L465] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L473] tmp___0 = __VERIFIER_nondet_int() [L475] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L483] tmp___2 = __VERIFIER_nondet_int() [L485] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L300] COND TRUE \read(pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L91] COND TRUE waterLevel > 0 [L92] waterLevel = waterLevel - 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L307] COND TRUE \read(systemActive) [L329] int tmp ; VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L332] COND FALSE !(! pumpRunning) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L886] int tmp ; [L887] int tmp___0 ; [L124] int retValue_acc ; [L127] retValue_acc = methaneLevelCritical [L128] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L891] tmp = isMethaneLevelCritical() [L893] COND TRUE \read(tmp) [L381] int retValue_acc ; [L384] retValue_acc = pumpRunning [L385] return (retValue_acc); VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L895] tmp___0 = isPumpRunning() [L897] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L898] COND TRUE \read(methAndRunningLastTime) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L284] __VERIFIER_error() VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 82 locations, 3 error locations. Result: UNSAFE, OverallTime: 2.4s, OverallIterations: 11, TraceHistogramMax: 2, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 659 SDtfs, 686 SDslu, 743 SDs, 0 SdLazy, 102 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=183occurred 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, 236 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 343 NumberOfCodeBlocks, 343 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 282 ConstructedInterpolants, 0 QuantifiedInterpolants, 18228 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 17/17 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...