./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec3_product19.cil.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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_spec3_product19.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(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 310c99156af564276fd2307b8bd19d77055bd9a88be466df2e869c4dbf78e36f --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:08:48,082 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:08:48,083 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:08:48,113 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:08:48,115 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:08:48,119 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:08:48,120 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:08:48,123 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:08:48,125 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:08:48,129 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:08:48,129 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:08:48,130 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:08:48,130 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:08:48,132 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:08:48,133 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:08:48,135 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:08:48,136 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:08:48,136 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:08:48,140 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:08:48,144 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:08:48,145 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:08:48,146 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:08:48,147 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:08:48,148 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:08:48,151 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:08:48,151 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:08:48,152 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:08:48,153 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:08:48,153 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:08:48,154 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:08:48,154 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:08:48,155 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:08:48,156 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:08:48,157 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:08:48,157 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:08:48,158 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:08:48,158 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:08:48,158 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:08:48,158 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:08:48,159 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:08:48,160 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:08:48,160 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 18:08:48,187 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:08:48,187 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:08:48,187 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:08:48,188 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:08:48,188 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:08:48,188 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:08:48,189 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:08:48,189 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:08:48,189 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:08:48,189 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:08:48,190 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:08:48,190 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:08:48,190 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:08:48,190 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:08:48,191 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:08:48,191 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:08:48,191 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:08:48,191 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:08:48,191 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:08:48,191 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:08:48,192 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:08:48,192 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:08:48,192 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:08:48,192 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:08:48,192 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:08:48,192 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:08:48,192 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:08:48,194 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:08:48,194 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:08:48,194 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:08:48,194 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:08:48,194 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:08:48,194 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:08:48,195 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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(reach_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 -> 310c99156af564276fd2307b8bd19d77055bd9a88be466df2e869c4dbf78e36f [2022-02-20 18:08:48,415 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:08:48,434 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:08:48,437 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:08:48,438 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:08:48,438 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:08:48,440 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec3_product19.cil.c [2022-02-20 18:08:48,498 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/daa3f17ba/6345237eb8704cf4b312ccb7d73e01aa/FLAGc201b9403 [2022-02-20 18:08:48,872 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:08:48,873 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec3_product19.cil.c [2022-02-20 18:08:48,890 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/daa3f17ba/6345237eb8704cf4b312ccb7d73e01aa/FLAGc201b9403 [2022-02-20 18:08:49,251 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/daa3f17ba/6345237eb8704cf4b312ccb7d73e01aa [2022-02-20 18:08:49,253 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:08:49,254 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:08:49,260 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:08:49,260 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:08:49,262 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:08:49,263 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:08:49" (1/1) ... [2022-02-20 18:08:49,264 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@447b7420 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:08:49, skipping insertion in model container [2022-02-20 18:08:49,264 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:08:49" (1/1) ... [2022-02-20 18:08:49,269 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:08:49,299 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:08:49,427 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec3_product19.cil.c[1605,1618] [2022-02-20 18:08:49,503 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:08:49,517 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:08:49,532 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec3_product19.cil.c[1605,1618] [2022-02-20 18:08:49,592 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:08:49,616 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:08:49,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:08:49 WrapperNode [2022-02-20 18:08:49,617 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:08:49,618 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:08:49,618 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:08:49,619 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:08:49,623 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:08:49" (1/1) ... [2022-02-20 18:08:49,635 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:08:49" (1/1) ... [2022-02-20 18:08:49,659 INFO L137 Inliner]: procedures = 53, calls = 152, calls flagged for inlining = 20, calls inlined = 17, statements flattened = 228 [2022-02-20 18:08:49,659 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:08:49,660 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:08:49,660 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:08:49,660 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:08:49,667 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:08:49" (1/1) ... [2022-02-20 18:08:49,668 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:08:49" (1/1) ... [2022-02-20 18:08:49,678 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:08:49" (1/1) ... [2022-02-20 18:08:49,679 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:08:49" (1/1) ... [2022-02-20 18:08:49,684 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:08:49" (1/1) ... [2022-02-20 18:08:49,688 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:08:49" (1/1) ... [2022-02-20 18:08:49,689 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:08:49" (1/1) ... [2022-02-20 18:08:49,691 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:08:49,692 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:08:49,692 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:08:49,692 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:08:49,693 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:08:49" (1/1) ... [2022-02-20 18:08:49,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:08:49,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:08:49,733 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 18:08:49,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 18:08:49,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:08:49,761 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2022-02-20 18:08:49,761 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2022-02-20 18:08:49,762 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2022-02-20 18:08:49,762 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2022-02-20 18:08:49,762 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2022-02-20 18:08:49,762 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2022-02-20 18:08:49,762 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2022-02-20 18:08:49,763 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2022-02-20 18:08:49,765 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2022-02-20 18:08:49,765 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2022-02-20 18:08:49,765 INFO L130 BoogieDeclarations]: Found specification of procedure deactivatePump [2022-02-20 18:08:49,765 INFO L138 BoogieDeclarations]: Found implementation of procedure deactivatePump [2022-02-20 18:08:49,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:08:49,765 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2022-02-20 18:08:49,766 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2022-02-20 18:08:49,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:08:49,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:08:49,820 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:08:49,822 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:08:50,171 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:08:50,182 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:08:50,187 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 18:08:50,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:08:50 BoogieIcfgContainer [2022-02-20 18:08:50,189 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:08:50,190 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:08:50,200 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:08:50,203 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:08:50,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:08:49" (1/3) ... [2022-02-20 18:08:50,204 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52c50fab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:08:50, skipping insertion in model container [2022-02-20 18:08:50,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:08:49" (2/3) ... [2022-02-20 18:08:50,204 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52c50fab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:08:50, skipping insertion in model container [2022-02-20 18:08:50,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:08:50" (3/3) ... [2022-02-20 18:08:50,206 INFO L111 eAbstractionObserver]: Analyzing ICFG minepump_spec3_product19.cil.c [2022-02-20 18:08:50,209 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:08:50,209 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:08:50,269 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:08:50,275 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 18:08:50,276 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:08:50,306 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 62 states have (on average 1.3870967741935485) internal successors, (86), 69 states have internal predecessors, (86), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 18:08:50,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 18:08:50,313 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:08:50,314 INFO L514 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] [2022-02-20 18:08:50,314 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:08:50,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:08:50,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1452553281, now seen corresponding path program 1 times [2022-02-20 18:08:50,326 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:08:50,326 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817219922] [2022-02-20 18:08:50,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:08:50,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:08:50,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:08:50,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-20 18:08:50,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:08:50,560 INFO L290 TraceCheckUtils]: 0: Hoare triple {85#true} havoc ~retValue_acc~6;~retValue_acc~6 := ~methaneLevelCritical~0;#res := ~retValue_acc~6; {85#true} is VALID [2022-02-20 18:08:50,560 INFO L290 TraceCheckUtils]: 1: Hoare triple {85#true} assume true; {85#true} is VALID [2022-02-20 18:08:50,561 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {85#true} {86#false} #216#return; {86#false} is VALID [2022-02-20 18:08:50,566 INFO L290 TraceCheckUtils]: 0: Hoare triple {85#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(31, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(30, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(21, 6);call #Ultimate.allocInit(30, 7);call #Ultimate.allocInit(9, 8);call #Ultimate.allocInit(21, 9);call #Ultimate.allocInit(30, 10);call #Ultimate.allocInit(9, 11);call #Ultimate.allocInit(25, 12);call #Ultimate.allocInit(30, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(25, 15);call #Ultimate.allocInit(13, 16);call #Ultimate.allocInit(7, 17);call write~init~int(44, 17, 0, 1);call write~init~int(77, 17, 1, 1);call write~init~int(101, 17, 2, 1);call write~init~int(116, 17, 3, 1);call write~init~int(104, 17, 4, 1);call write~init~int(58, 17, 5, 1);call write~init~int(0, 17, 6, 1);call #Ultimate.allocInit(5, 18);call write~init~int(67, 18, 0, 1);call write~init~int(82, 18, 1, 1);call write~init~int(73, 18, 2, 1);call write~init~int(84, 18, 3, 1);call write~init~int(0, 18, 4, 1);call #Ultimate.allocInit(3, 19);call write~init~int(79, 19, 0, 1);call write~init~int(75, 19, 1, 1);call write~init~int(0, 19, 2, 1);call #Ultimate.allocInit(2, 20);call write~init~int(41, 20, 0, 1);call write~init~int(0, 20, 1, 1);call #Ultimate.allocInit(13, 21);call #Ultimate.allocInit(3, 22);call write~init~int(79, 22, 0, 1);call write~init~int(110, 22, 1, 1);call write~init~int(0, 22, 2, 1);call #Ultimate.allocInit(4, 23);call write~init~int(79, 23, 0, 1);call write~init~int(102, 23, 1, 1);call write~init~int(102, 23, 2, 1);call write~init~int(0, 23, 3, 1);call #Ultimate.allocInit(7, 24);call write~init~int(44, 24, 0, 1);call write~init~int(80, 24, 1, 1);call write~init~int(117, 24, 2, 1);call write~init~int(109, 24, 3, 1);call write~init~int(112, 24, 4, 1);call write~init~int(58, 24, 5, 1);call write~init~int(0, 24, 6, 1);call #Ultimate.allocInit(3, 25);call write~init~int(79, 25, 0, 1);call write~init~int(110, 25, 1, 1);call write~init~int(0, 25, 2, 1);call #Ultimate.allocInit(4, 26);call write~init~int(79, 26, 0, 1);call write~init~int(102, 26, 1, 1);call write~init~int(102, 26, 2, 1);call write~init~int(0, 26, 3, 1);call #Ultimate.allocInit(3, 27);call write~init~int(41, 27, 0, 1);call write~init~int(32, 27, 1, 1);call write~init~int(0, 27, 2, 1);call #Ultimate.allocInit(2, 28);call write~init~int(10, 28, 0, 1);call write~init~int(0, 28, 1, 1);~head~0.base, ~head~0.offset := 0, 0;~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~pumpRunning~0 := 0;~systemActive~0 := 1; {85#true} is VALID [2022-02-20 18:08:50,566 INFO L290 TraceCheckUtils]: 1: Hoare triple {85#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret31#1, main_~retValue_acc~5#1, main_~tmp~4#1;havoc main_~retValue_acc~5#1;havoc main_~tmp~4#1;assume { :begin_inline_select_helpers } true; {85#true} is VALID [2022-02-20 18:08:50,567 INFO L290 TraceCheckUtils]: 2: Hoare triple {85#true} assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; {85#true} is VALID [2022-02-20 18:08:50,567 INFO L290 TraceCheckUtils]: 3: Hoare triple {85#true} assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~1#1;havoc valid_product_~retValue_acc~1#1;valid_product_~retValue_acc~1#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~1#1; {85#true} is VALID [2022-02-20 18:08:50,568 INFO L290 TraceCheckUtils]: 4: Hoare triple {85#true} main_#t~ret31#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;assume -2147483648 <= main_#t~ret31#1 && main_#t~ret31#1 <= 2147483647;main_~tmp~4#1 := main_#t~ret31#1;havoc main_#t~ret31#1; {85#true} is VALID [2022-02-20 18:08:50,568 INFO L290 TraceCheckUtils]: 5: Hoare triple {85#true} assume 0 != main_~tmp~4#1;assume { :begin_inline_setup } true; {85#true} is VALID [2022-02-20 18:08:50,568 INFO L290 TraceCheckUtils]: 6: Hoare triple {85#true} assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;havoc test_#t~nondet37#1, test_#t~nondet38#1, test_#t~nondet39#1, test_#t~nondet40#1, test_~splverifierCounter~0#1, test_~tmp~5#1, test_~tmp___0~1#1, test_~tmp___1~1#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~5#1;havoc test_~tmp___0~1#1;havoc test_~tmp___1~1#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0; {85#true} is VALID [2022-02-20 18:08:50,570 INFO L290 TraceCheckUtils]: 7: Hoare triple {85#true} assume false; {86#false} is VALID [2022-02-20 18:08:50,570 INFO L272 TraceCheckUtils]: 8: Hoare triple {86#false} call cleanup(); {86#false} is VALID [2022-02-20 18:08:50,570 INFO L290 TraceCheckUtils]: 9: Hoare triple {86#false} havoc ~i~0;havoc ~__cil_tmp2~0; {86#false} is VALID [2022-02-20 18:08:50,571 INFO L272 TraceCheckUtils]: 10: Hoare triple {86#false} call timeShift(); {86#false} is VALID [2022-02-20 18:08:50,571 INFO L290 TraceCheckUtils]: 11: Hoare triple {86#false} assume !(0 != ~pumpRunning~0); {86#false} is VALID [2022-02-20 18:08:50,571 INFO L290 TraceCheckUtils]: 12: Hoare triple {86#false} assume !(0 != ~systemActive~0); {86#false} is VALID [2022-02-20 18:08:50,571 INFO L290 TraceCheckUtils]: 13: Hoare triple {86#false} assume { :begin_inline___utac_acc__Specification3_spec__1 } true;havoc __utac_acc__Specification3_spec__1_#t~ret5#1, __utac_acc__Specification3_spec__1_#t~ret6#1, __utac_acc__Specification3_spec__1_#t~ret7#1, __utac_acc__Specification3_spec__1_~tmp~0#1, __utac_acc__Specification3_spec__1_~tmp___0~0#1, __utac_acc__Specification3_spec__1_~tmp___1~0#1;havoc __utac_acc__Specification3_spec__1_~tmp~0#1;havoc __utac_acc__Specification3_spec__1_~tmp___0~0#1;havoc __utac_acc__Specification3_spec__1_~tmp___1~0#1; {86#false} is VALID [2022-02-20 18:08:50,572 INFO L272 TraceCheckUtils]: 14: Hoare triple {86#false} call __utac_acc__Specification3_spec__1_#t~ret5#1 := isMethaneLevelCritical(); {85#true} is VALID [2022-02-20 18:08:50,572 INFO L290 TraceCheckUtils]: 15: Hoare triple {85#true} havoc ~retValue_acc~6;~retValue_acc~6 := ~methaneLevelCritical~0;#res := ~retValue_acc~6; {85#true} is VALID [2022-02-20 18:08:50,573 INFO L290 TraceCheckUtils]: 16: Hoare triple {85#true} assume true; {85#true} is VALID [2022-02-20 18:08:50,573 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {85#true} {86#false} #216#return; {86#false} is VALID [2022-02-20 18:08:50,573 INFO L290 TraceCheckUtils]: 18: Hoare triple {86#false} assume -2147483648 <= __utac_acc__Specification3_spec__1_#t~ret5#1 && __utac_acc__Specification3_spec__1_#t~ret5#1 <= 2147483647;__utac_acc__Specification3_spec__1_~tmp~0#1 := __utac_acc__Specification3_spec__1_#t~ret5#1;havoc __utac_acc__Specification3_spec__1_#t~ret5#1; {86#false} is VALID [2022-02-20 18:08:50,573 INFO L290 TraceCheckUtils]: 19: Hoare triple {86#false} assume !(0 != __utac_acc__Specification3_spec__1_~tmp~0#1);assume { :begin_inline_getWaterLevel } true;havoc getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~7#1;havoc getWaterLevel_~retValue_acc~7#1;getWaterLevel_~retValue_acc~7#1 := ~waterLevel~0;getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~7#1; {86#false} is VALID [2022-02-20 18:08:50,574 INFO L290 TraceCheckUtils]: 20: Hoare triple {86#false} __utac_acc__Specification3_spec__1_#t~ret6#1 := getWaterLevel_#res#1;assume { :end_inline_getWaterLevel } true;assume -2147483648 <= __utac_acc__Specification3_spec__1_#t~ret6#1 && __utac_acc__Specification3_spec__1_#t~ret6#1 <= 2147483647;__utac_acc__Specification3_spec__1_~tmp___0~0#1 := __utac_acc__Specification3_spec__1_#t~ret6#1;havoc __utac_acc__Specification3_spec__1_#t~ret6#1; {86#false} is VALID [2022-02-20 18:08:50,574 INFO L290 TraceCheckUtils]: 21: Hoare triple {86#false} assume 2 == __utac_acc__Specification3_spec__1_~tmp___0~0#1;assume { :begin_inline_isPumpRunning } true;havoc isPumpRunning_#res#1;havoc isPumpRunning_~retValue_acc~10#1;havoc isPumpRunning_~retValue_acc~10#1;isPumpRunning_~retValue_acc~10#1 := ~pumpRunning~0;isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~10#1; {86#false} is VALID [2022-02-20 18:08:50,575 INFO L290 TraceCheckUtils]: 22: Hoare triple {86#false} __utac_acc__Specification3_spec__1_#t~ret7#1 := isPumpRunning_#res#1;assume { :end_inline_isPumpRunning } true;assume -2147483648 <= __utac_acc__Specification3_spec__1_#t~ret7#1 && __utac_acc__Specification3_spec__1_#t~ret7#1 <= 2147483647;__utac_acc__Specification3_spec__1_~tmp___1~0#1 := __utac_acc__Specification3_spec__1_#t~ret7#1;havoc __utac_acc__Specification3_spec__1_#t~ret7#1; {86#false} is VALID [2022-02-20 18:08:50,575 INFO L290 TraceCheckUtils]: 23: Hoare triple {86#false} assume !(0 != __utac_acc__Specification3_spec__1_~tmp___1~0#1);assume { :begin_inline___automaton_fail } true; {86#false} is VALID [2022-02-20 18:08:50,576 INFO L290 TraceCheckUtils]: 24: Hoare triple {86#false} assume !false; {86#false} is VALID [2022-02-20 18:08:50,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:08:50,576 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:08:50,577 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817219922] [2022-02-20 18:08:50,578 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817219922] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:08:50,578 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:08:50,578 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 18:08:50,580 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032249616] [2022-02-20 18:08:50,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:08:50,585 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-02-20 18:08:50,586 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:08:50,589 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:08:50,631 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:08:50,632 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 18:08:50,632 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:08:50,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 18:08:50,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 18:08:50,657 INFO L87 Difference]: Start difference. First operand has 82 states, 62 states have (on average 1.3870967741935485) internal successors, (86), 69 states have internal predecessors, (86), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:08:50,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:08:50,767 INFO L93 Difference]: Finished difference Result 156 states and 211 transitions. [2022-02-20 18:08:50,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 18:08:50,768 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-02-20 18:08:50,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:08:50,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:08:50,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 211 transitions. [2022-02-20 18:08:50,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:08:50,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 211 transitions. [2022-02-20 18:08:50,796 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 211 transitions. [2022-02-20 18:08:50,981 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 211 edges. 211 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:08:50,999 INFO L225 Difference]: With dead ends: 156 [2022-02-20 18:08:50,999 INFO L226 Difference]: Without dead ends: 73 [2022-02-20 18:08:51,002 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 18:08:51,005 INFO L933 BasicCegarLoop]: 102 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:08:51,005 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:08:51,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-02-20 18:08:51,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-02-20 18:08:51,036 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:08:51,039 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 73 states, 55 states have (on average 1.309090909090909) internal successors, (72), 61 states have internal predecessors, (72), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 18:08:51,042 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 73 states, 55 states have (on average 1.309090909090909) internal successors, (72), 61 states have internal predecessors, (72), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 18:08:51,043 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 73 states, 55 states have (on average 1.309090909090909) internal successors, (72), 61 states have internal predecessors, (72), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 18:08:51,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:08:51,053 INFO L93 Difference]: Finished difference Result 73 states and 93 transitions. [2022-02-20 18:08:51,053 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 93 transitions. [2022-02-20 18:08:51,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:08:51,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:08:51,057 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 55 states have (on average 1.309090909090909) internal successors, (72), 61 states have internal predecessors, (72), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) Second operand 73 states. [2022-02-20 18:08:51,061 INFO L87 Difference]: Start difference. First operand has 73 states, 55 states have (on average 1.309090909090909) internal successors, (72), 61 states have internal predecessors, (72), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) Second operand 73 states. [2022-02-20 18:08:51,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:08:51,070 INFO L93 Difference]: Finished difference Result 73 states and 93 transitions. [2022-02-20 18:08:51,071 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 93 transitions. [2022-02-20 18:08:51,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:08:51,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:08:51,072 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:08:51,072 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:08:51,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 55 states have (on average 1.309090909090909) internal successors, (72), 61 states have internal predecessors, (72), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 18:08:51,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 93 transitions. [2022-02-20 18:08:51,080 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 93 transitions. Word has length 25 [2022-02-20 18:08:51,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:08:51,080 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 93 transitions. [2022-02-20 18:08:51,080 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:08:51,081 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 93 transitions. [2022-02-20 18:08:51,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 18:08:51,082 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:08:51,082 INFO L514 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] [2022-02-20 18:08:51,082 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:08:51,082 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:08:51,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:08:51,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1317189843, now seen corresponding path program 1 times [2022-02-20 18:08:51,085 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:08:51,085 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103010533] [2022-02-20 18:08:51,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:08:51,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:08:51,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:08:51,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-20 18:08:51,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:08:51,146 INFO L290 TraceCheckUtils]: 0: Hoare triple {568#true} havoc ~retValue_acc~6;~retValue_acc~6 := ~methaneLevelCritical~0;#res := ~retValue_acc~6; {568#true} is VALID [2022-02-20 18:08:51,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {568#true} assume true; {568#true} is VALID [2022-02-20 18:08:51,147 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {568#true} {569#false} #216#return; {569#false} is VALID [2022-02-20 18:08:51,147 INFO L290 TraceCheckUtils]: 0: Hoare triple {568#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(31, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(30, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(21, 6);call #Ultimate.allocInit(30, 7);call #Ultimate.allocInit(9, 8);call #Ultimate.allocInit(21, 9);call #Ultimate.allocInit(30, 10);call #Ultimate.allocInit(9, 11);call #Ultimate.allocInit(25, 12);call #Ultimate.allocInit(30, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(25, 15);call #Ultimate.allocInit(13, 16);call #Ultimate.allocInit(7, 17);call write~init~int(44, 17, 0, 1);call write~init~int(77, 17, 1, 1);call write~init~int(101, 17, 2, 1);call write~init~int(116, 17, 3, 1);call write~init~int(104, 17, 4, 1);call write~init~int(58, 17, 5, 1);call write~init~int(0, 17, 6, 1);call #Ultimate.allocInit(5, 18);call write~init~int(67, 18, 0, 1);call write~init~int(82, 18, 1, 1);call write~init~int(73, 18, 2, 1);call write~init~int(84, 18, 3, 1);call write~init~int(0, 18, 4, 1);call #Ultimate.allocInit(3, 19);call write~init~int(79, 19, 0, 1);call write~init~int(75, 19, 1, 1);call write~init~int(0, 19, 2, 1);call #Ultimate.allocInit(2, 20);call write~init~int(41, 20, 0, 1);call write~init~int(0, 20, 1, 1);call #Ultimate.allocInit(13, 21);call #Ultimate.allocInit(3, 22);call write~init~int(79, 22, 0, 1);call write~init~int(110, 22, 1, 1);call write~init~int(0, 22, 2, 1);call #Ultimate.allocInit(4, 23);call write~init~int(79, 23, 0, 1);call write~init~int(102, 23, 1, 1);call write~init~int(102, 23, 2, 1);call write~init~int(0, 23, 3, 1);call #Ultimate.allocInit(7, 24);call write~init~int(44, 24, 0, 1);call write~init~int(80, 24, 1, 1);call write~init~int(117, 24, 2, 1);call write~init~int(109, 24, 3, 1);call write~init~int(112, 24, 4, 1);call write~init~int(58, 24, 5, 1);call write~init~int(0, 24, 6, 1);call #Ultimate.allocInit(3, 25);call write~init~int(79, 25, 0, 1);call write~init~int(110, 25, 1, 1);call write~init~int(0, 25, 2, 1);call #Ultimate.allocInit(4, 26);call write~init~int(79, 26, 0, 1);call write~init~int(102, 26, 1, 1);call write~init~int(102, 26, 2, 1);call write~init~int(0, 26, 3, 1);call #Ultimate.allocInit(3, 27);call write~init~int(41, 27, 0, 1);call write~init~int(32, 27, 1, 1);call write~init~int(0, 27, 2, 1);call #Ultimate.allocInit(2, 28);call write~init~int(10, 28, 0, 1);call write~init~int(0, 28, 1, 1);~head~0.base, ~head~0.offset := 0, 0;~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~pumpRunning~0 := 0;~systemActive~0 := 1; {568#true} is VALID [2022-02-20 18:08:51,147 INFO L290 TraceCheckUtils]: 1: Hoare triple {568#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret31#1, main_~retValue_acc~5#1, main_~tmp~4#1;havoc main_~retValue_acc~5#1;havoc main_~tmp~4#1;assume { :begin_inline_select_helpers } true; {568#true} is VALID [2022-02-20 18:08:51,147 INFO L290 TraceCheckUtils]: 2: Hoare triple {568#true} assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; {568#true} is VALID [2022-02-20 18:08:51,147 INFO L290 TraceCheckUtils]: 3: Hoare triple {568#true} assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~1#1;havoc valid_product_~retValue_acc~1#1;valid_product_~retValue_acc~1#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~1#1; {568#true} is VALID [2022-02-20 18:08:51,148 INFO L290 TraceCheckUtils]: 4: Hoare triple {568#true} main_#t~ret31#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;assume -2147483648 <= main_#t~ret31#1 && main_#t~ret31#1 <= 2147483647;main_~tmp~4#1 := main_#t~ret31#1;havoc main_#t~ret31#1; {568#true} is VALID [2022-02-20 18:08:51,148 INFO L290 TraceCheckUtils]: 5: Hoare triple {568#true} assume 0 != main_~tmp~4#1;assume { :begin_inline_setup } true; {568#true} is VALID [2022-02-20 18:08:51,148 INFO L290 TraceCheckUtils]: 6: Hoare triple {568#true} assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;havoc test_#t~nondet37#1, test_#t~nondet38#1, test_#t~nondet39#1, test_#t~nondet40#1, test_~splverifierCounter~0#1, test_~tmp~5#1, test_~tmp___0~1#1, test_~tmp___1~1#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~5#1;havoc test_~tmp___0~1#1;havoc test_~tmp___1~1#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0; {570#(= |ULTIMATE.start_test_~splverifierCounter~0#1| 0)} is VALID [2022-02-20 18:08:51,149 INFO L290 TraceCheckUtils]: 7: Hoare triple {570#(= |ULTIMATE.start_test_~splverifierCounter~0#1| 0)} assume !false; {570#(= |ULTIMATE.start_test_~splverifierCounter~0#1| 0)} is VALID [2022-02-20 18:08:51,149 INFO L290 TraceCheckUtils]: 8: Hoare triple {570#(= |ULTIMATE.start_test_~splverifierCounter~0#1| 0)} assume !(test_~splverifierCounter~0#1 < 4); {569#false} is VALID [2022-02-20 18:08:51,149 INFO L272 TraceCheckUtils]: 9: Hoare triple {569#false} call cleanup(); {569#false} is VALID [2022-02-20 18:08:51,149 INFO L290 TraceCheckUtils]: 10: Hoare triple {569#false} havoc ~i~0;havoc ~__cil_tmp2~0; {569#false} is VALID [2022-02-20 18:08:51,149 INFO L272 TraceCheckUtils]: 11: Hoare triple {569#false} call timeShift(); {569#false} is VALID [2022-02-20 18:08:51,150 INFO L290 TraceCheckUtils]: 12: Hoare triple {569#false} assume !(0 != ~pumpRunning~0); {569#false} is VALID [2022-02-20 18:08:51,150 INFO L290 TraceCheckUtils]: 13: Hoare triple {569#false} assume !(0 != ~systemActive~0); {569#false} is VALID [2022-02-20 18:08:51,150 INFO L290 TraceCheckUtils]: 14: Hoare triple {569#false} assume { :begin_inline___utac_acc__Specification3_spec__1 } true;havoc __utac_acc__Specification3_spec__1_#t~ret5#1, __utac_acc__Specification3_spec__1_#t~ret6#1, __utac_acc__Specification3_spec__1_#t~ret7#1, __utac_acc__Specification3_spec__1_~tmp~0#1, __utac_acc__Specification3_spec__1_~tmp___0~0#1, __utac_acc__Specification3_spec__1_~tmp___1~0#1;havoc __utac_acc__Specification3_spec__1_~tmp~0#1;havoc __utac_acc__Specification3_spec__1_~tmp___0~0#1;havoc __utac_acc__Specification3_spec__1_~tmp___1~0#1; {569#false} is VALID [2022-02-20 18:08:51,150 INFO L272 TraceCheckUtils]: 15: Hoare triple {569#false} call __utac_acc__Specification3_spec__1_#t~ret5#1 := isMethaneLevelCritical(); {568#true} is VALID [2022-02-20 18:08:51,150 INFO L290 TraceCheckUtils]: 16: Hoare triple {568#true} havoc ~retValue_acc~6;~retValue_acc~6 := ~methaneLevelCritical~0;#res := ~retValue_acc~6; {568#true} is VALID [2022-02-20 18:08:51,150 INFO L290 TraceCheckUtils]: 17: Hoare triple {568#true} assume true; {568#true} is VALID [2022-02-20 18:08:51,151 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {568#true} {569#false} #216#return; {569#false} is VALID [2022-02-20 18:08:51,151 INFO L290 TraceCheckUtils]: 19: Hoare triple {569#false} assume -2147483648 <= __utac_acc__Specification3_spec__1_#t~ret5#1 && __utac_acc__Specification3_spec__1_#t~ret5#1 <= 2147483647;__utac_acc__Specification3_spec__1_~tmp~0#1 := __utac_acc__Specification3_spec__1_#t~ret5#1;havoc __utac_acc__Specification3_spec__1_#t~ret5#1; {569#false} is VALID [2022-02-20 18:08:51,151 INFO L290 TraceCheckUtils]: 20: Hoare triple {569#false} assume !(0 != __utac_acc__Specification3_spec__1_~tmp~0#1);assume { :begin_inline_getWaterLevel } true;havoc getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~7#1;havoc getWaterLevel_~retValue_acc~7#1;getWaterLevel_~retValue_acc~7#1 := ~waterLevel~0;getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~7#1; {569#false} is VALID [2022-02-20 18:08:51,155 INFO L290 TraceCheckUtils]: 21: Hoare triple {569#false} __utac_acc__Specification3_spec__1_#t~ret6#1 := getWaterLevel_#res#1;assume { :end_inline_getWaterLevel } true;assume -2147483648 <= __utac_acc__Specification3_spec__1_#t~ret6#1 && __utac_acc__Specification3_spec__1_#t~ret6#1 <= 2147483647;__utac_acc__Specification3_spec__1_~tmp___0~0#1 := __utac_acc__Specification3_spec__1_#t~ret6#1;havoc __utac_acc__Specification3_spec__1_#t~ret6#1; {569#false} is VALID [2022-02-20 18:08:51,156 INFO L290 TraceCheckUtils]: 22: Hoare triple {569#false} assume 2 == __utac_acc__Specification3_spec__1_~tmp___0~0#1;assume { :begin_inline_isPumpRunning } true;havoc isPumpRunning_#res#1;havoc isPumpRunning_~retValue_acc~10#1;havoc isPumpRunning_~retValue_acc~10#1;isPumpRunning_~retValue_acc~10#1 := ~pumpRunning~0;isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~10#1; {569#false} is VALID [2022-02-20 18:08:51,156 INFO L290 TraceCheckUtils]: 23: Hoare triple {569#false} __utac_acc__Specification3_spec__1_#t~ret7#1 := isPumpRunning_#res#1;assume { :end_inline_isPumpRunning } true;assume -2147483648 <= __utac_acc__Specification3_spec__1_#t~ret7#1 && __utac_acc__Specification3_spec__1_#t~ret7#1 <= 2147483647;__utac_acc__Specification3_spec__1_~tmp___1~0#1 := __utac_acc__Specification3_spec__1_#t~ret7#1;havoc __utac_acc__Specification3_spec__1_#t~ret7#1; {569#false} is VALID [2022-02-20 18:08:51,156 INFO L290 TraceCheckUtils]: 24: Hoare triple {569#false} assume !(0 != __utac_acc__Specification3_spec__1_~tmp___1~0#1);assume { :begin_inline___automaton_fail } true; {569#false} is VALID [2022-02-20 18:08:51,156 INFO L290 TraceCheckUtils]: 25: Hoare triple {569#false} assume !false; {569#false} is VALID [2022-02-20 18:08:51,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:08:51,157 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:08:51,157 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103010533] [2022-02-20 18:08:51,157 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103010533] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:08:51,157 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:08:51,157 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:08:51,158 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951448526] [2022-02-20 18:08:51,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:08:51,159 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-02-20 18:08:51,159 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:08:51,159 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:08:51,192 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:08:51,193 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:08:51,193 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:08:51,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:08:51,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:08:51,194 INFO L87 Difference]: Start difference. First operand 73 states and 93 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:08:51,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:08:51,279 INFO L93 Difference]: Finished difference Result 108 states and 136 transitions. [2022-02-20 18:08:51,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:08:51,279 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-02-20 18:08:51,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:08:51,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:08:51,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 136 transitions. [2022-02-20 18:08:51,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:08:51,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 136 transitions. [2022-02-20 18:08:51,301 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 136 transitions. [2022-02-20 18:08:51,424 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:08:51,429 INFO L225 Difference]: With dead ends: 108 [2022-02-20 18:08:51,429 INFO L226 Difference]: Without dead ends: 64 [2022-02-20 18:08:51,432 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:08:51,435 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 16 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:08:51,435 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 139 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:08:51,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-02-20 18:08:51,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-02-20 18:08:51,442 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:08:51,443 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 64 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 55 states have internal predecessors, (65), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 18:08:51,443 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 64 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 55 states have internal predecessors, (65), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 18:08:51,443 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 64 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 55 states have internal predecessors, (65), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 18:08:51,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:08:51,448 INFO L93 Difference]: Finished difference Result 64 states and 81 transitions. [2022-02-20 18:08:51,448 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 81 transitions. [2022-02-20 18:08:51,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:08:51,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:08:51,451 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 55 states have internal predecessors, (65), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) Second operand 64 states. [2022-02-20 18:08:51,452 INFO L87 Difference]: Start difference. First operand has 64 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 55 states have internal predecessors, (65), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) Second operand 64 states. [2022-02-20 18:08:51,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:08:51,453 INFO L93 Difference]: Finished difference Result 64 states and 81 transitions. [2022-02-20 18:08:51,454 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 81 transitions. [2022-02-20 18:08:51,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:08:51,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:08:51,454 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:08:51,454 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:08:51,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 55 states have internal predecessors, (65), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 18:08:51,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 81 transitions. [2022-02-20 18:08:51,456 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 81 transitions. Word has length 26 [2022-02-20 18:08:51,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:08:51,457 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 81 transitions. [2022-02-20 18:08:51,457 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:08:51,457 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 81 transitions. [2022-02-20 18:08:51,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 18:08:51,457 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:08:51,458 INFO L514 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] [2022-02-20 18:08:51,458 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:08:51,458 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:08:51,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:08:51,458 INFO L85 PathProgramCache]: Analyzing trace with hash 755375039, now seen corresponding path program 1 times [2022-02-20 18:08:51,459 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:08:51,459 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601717592] [2022-02-20 18:08:51,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:08:51,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:08:51,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:08:51,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-02-20 18:08:51,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:08:51,521 INFO L290 TraceCheckUtils]: 0: Hoare triple {950#true} havoc ~retValue_acc~6;~retValue_acc~6 := ~methaneLevelCritical~0;#res := ~retValue_acc~6; {950#true} is VALID [2022-02-20 18:08:51,522 INFO L290 TraceCheckUtils]: 1: Hoare triple {950#true} assume true; {950#true} is VALID [2022-02-20 18:08:51,522 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {950#true} {951#false} #216#return; {951#false} is VALID [2022-02-20 18:08:51,524 INFO L290 TraceCheckUtils]: 0: Hoare triple {950#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(31, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(30, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(21, 6);call #Ultimate.allocInit(30, 7);call #Ultimate.allocInit(9, 8);call #Ultimate.allocInit(21, 9);call #Ultimate.allocInit(30, 10);call #Ultimate.allocInit(9, 11);call #Ultimate.allocInit(25, 12);call #Ultimate.allocInit(30, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(25, 15);call #Ultimate.allocInit(13, 16);call #Ultimate.allocInit(7, 17);call write~init~int(44, 17, 0, 1);call write~init~int(77, 17, 1, 1);call write~init~int(101, 17, 2, 1);call write~init~int(116, 17, 3, 1);call write~init~int(104, 17, 4, 1);call write~init~int(58, 17, 5, 1);call write~init~int(0, 17, 6, 1);call #Ultimate.allocInit(5, 18);call write~init~int(67, 18, 0, 1);call write~init~int(82, 18, 1, 1);call write~init~int(73, 18, 2, 1);call write~init~int(84, 18, 3, 1);call write~init~int(0, 18, 4, 1);call #Ultimate.allocInit(3, 19);call write~init~int(79, 19, 0, 1);call write~init~int(75, 19, 1, 1);call write~init~int(0, 19, 2, 1);call #Ultimate.allocInit(2, 20);call write~init~int(41, 20, 0, 1);call write~init~int(0, 20, 1, 1);call #Ultimate.allocInit(13, 21);call #Ultimate.allocInit(3, 22);call write~init~int(79, 22, 0, 1);call write~init~int(110, 22, 1, 1);call write~init~int(0, 22, 2, 1);call #Ultimate.allocInit(4, 23);call write~init~int(79, 23, 0, 1);call write~init~int(102, 23, 1, 1);call write~init~int(102, 23, 2, 1);call write~init~int(0, 23, 3, 1);call #Ultimate.allocInit(7, 24);call write~init~int(44, 24, 0, 1);call write~init~int(80, 24, 1, 1);call write~init~int(117, 24, 2, 1);call write~init~int(109, 24, 3, 1);call write~init~int(112, 24, 4, 1);call write~init~int(58, 24, 5, 1);call write~init~int(0, 24, 6, 1);call #Ultimate.allocInit(3, 25);call write~init~int(79, 25, 0, 1);call write~init~int(110, 25, 1, 1);call write~init~int(0, 25, 2, 1);call #Ultimate.allocInit(4, 26);call write~init~int(79, 26, 0, 1);call write~init~int(102, 26, 1, 1);call write~init~int(102, 26, 2, 1);call write~init~int(0, 26, 3, 1);call #Ultimate.allocInit(3, 27);call write~init~int(41, 27, 0, 1);call write~init~int(32, 27, 1, 1);call write~init~int(0, 27, 2, 1);call #Ultimate.allocInit(2, 28);call write~init~int(10, 28, 0, 1);call write~init~int(0, 28, 1, 1);~head~0.base, ~head~0.offset := 0, 0;~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~pumpRunning~0 := 0;~systemActive~0 := 1; {952#(= 1 ~systemActive~0)} is VALID [2022-02-20 18:08:51,524 INFO L290 TraceCheckUtils]: 1: Hoare triple {952#(= 1 ~systemActive~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret31#1, main_~retValue_acc~5#1, main_~tmp~4#1;havoc main_~retValue_acc~5#1;havoc main_~tmp~4#1;assume { :begin_inline_select_helpers } true; {952#(= 1 ~systemActive~0)} is VALID [2022-02-20 18:08:51,525 INFO L290 TraceCheckUtils]: 2: Hoare triple {952#(= 1 ~systemActive~0)} assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; {952#(= 1 ~systemActive~0)} is VALID [2022-02-20 18:08:51,525 INFO L290 TraceCheckUtils]: 3: Hoare triple {952#(= 1 ~systemActive~0)} assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~1#1;havoc valid_product_~retValue_acc~1#1;valid_product_~retValue_acc~1#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~1#1; {953#(= |ULTIMATE.start_valid_product_#res#1| ~systemActive~0)} is VALID [2022-02-20 18:08:51,525 INFO L290 TraceCheckUtils]: 4: Hoare triple {953#(= |ULTIMATE.start_valid_product_#res#1| ~systemActive~0)} main_#t~ret31#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;assume -2147483648 <= main_#t~ret31#1 && main_#t~ret31#1 <= 2147483647;main_~tmp~4#1 := main_#t~ret31#1;havoc main_#t~ret31#1; {954#(= |ULTIMATE.start_main_~tmp~4#1| ~systemActive~0)} is VALID [2022-02-20 18:08:51,526 INFO L290 TraceCheckUtils]: 5: Hoare triple {954#(= |ULTIMATE.start_main_~tmp~4#1| ~systemActive~0)} assume 0 != main_~tmp~4#1;assume { :begin_inline_setup } true; {955#(not (= 0 ~systemActive~0))} is VALID [2022-02-20 18:08:51,526 INFO L290 TraceCheckUtils]: 6: Hoare triple {955#(not (= 0 ~systemActive~0))} assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;havoc test_#t~nondet37#1, test_#t~nondet38#1, test_#t~nondet39#1, test_#t~nondet40#1, test_~splverifierCounter~0#1, test_~tmp~5#1, test_~tmp___0~1#1, test_~tmp___1~1#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~5#1;havoc test_~tmp___0~1#1;havoc test_~tmp___1~1#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0; {955#(not (= 0 ~systemActive~0))} is VALID [2022-02-20 18:08:51,527 INFO L290 TraceCheckUtils]: 7: Hoare triple {955#(not (= 0 ~systemActive~0))} assume !false; {955#(not (= 0 ~systemActive~0))} is VALID [2022-02-20 18:08:51,527 INFO L290 TraceCheckUtils]: 8: Hoare triple {955#(not (= 0 ~systemActive~0))} assume test_~splverifierCounter~0#1 < 4; {955#(not (= 0 ~systemActive~0))} is VALID [2022-02-20 18:08:51,527 INFO L290 TraceCheckUtils]: 9: Hoare triple {955#(not (= 0 ~systemActive~0))} assume -2147483648 <= test_#t~nondet37#1 && test_#t~nondet37#1 <= 2147483647;test_~tmp~5#1 := test_#t~nondet37#1;havoc test_#t~nondet37#1; {955#(not (= 0 ~systemActive~0))} is VALID [2022-02-20 18:08:51,528 INFO L290 TraceCheckUtils]: 10: Hoare triple {955#(not (= 0 ~systemActive~0))} assume !(0 != test_~tmp~5#1); {955#(not (= 0 ~systemActive~0))} is VALID [2022-02-20 18:08:51,528 INFO L290 TraceCheckUtils]: 11: Hoare triple {955#(not (= 0 ~systemActive~0))} assume -2147483648 <= test_#t~nondet38#1 && test_#t~nondet38#1 <= 2147483647;test_~tmp___0~1#1 := test_#t~nondet38#1;havoc test_#t~nondet38#1; {955#(not (= 0 ~systemActive~0))} is VALID [2022-02-20 18:08:51,529 INFO L290 TraceCheckUtils]: 12: Hoare triple {955#(not (= 0 ~systemActive~0))} assume !(0 != test_~tmp___0~1#1); {955#(not (= 0 ~systemActive~0))} is VALID [2022-02-20 18:08:51,529 INFO L290 TraceCheckUtils]: 13: Hoare triple {955#(not (= 0 ~systemActive~0))} assume -2147483648 <= test_#t~nondet39#1 && test_#t~nondet39#1 <= 2147483647;test_~tmp___2~0#1 := test_#t~nondet39#1;havoc test_#t~nondet39#1; {955#(not (= 0 ~systemActive~0))} is VALID [2022-02-20 18:08:51,529 INFO L290 TraceCheckUtils]: 14: Hoare triple {955#(not (= 0 ~systemActive~0))} assume 0 != test_~tmp___2~0#1; {955#(not (= 0 ~systemActive~0))} is VALID [2022-02-20 18:08:51,530 INFO L272 TraceCheckUtils]: 15: Hoare triple {955#(not (= 0 ~systemActive~0))} call timeShift(); {955#(not (= 0 ~systemActive~0))} is VALID [2022-02-20 18:08:51,530 INFO L290 TraceCheckUtils]: 16: Hoare triple {955#(not (= 0 ~systemActive~0))} assume !(0 != ~pumpRunning~0); {955#(not (= 0 ~systemActive~0))} is VALID [2022-02-20 18:08:51,531 INFO L290 TraceCheckUtils]: 17: Hoare triple {955#(not (= 0 ~systemActive~0))} assume !(0 != ~systemActive~0); {951#false} is VALID [2022-02-20 18:08:51,531 INFO L290 TraceCheckUtils]: 18: Hoare triple {951#false} assume { :begin_inline___utac_acc__Specification3_spec__1 } true;havoc __utac_acc__Specification3_spec__1_#t~ret5#1, __utac_acc__Specification3_spec__1_#t~ret6#1, __utac_acc__Specification3_spec__1_#t~ret7#1, __utac_acc__Specification3_spec__1_~tmp~0#1, __utac_acc__Specification3_spec__1_~tmp___0~0#1, __utac_acc__Specification3_spec__1_~tmp___1~0#1;havoc __utac_acc__Specification3_spec__1_~tmp~0#1;havoc __utac_acc__Specification3_spec__1_~tmp___0~0#1;havoc __utac_acc__Specification3_spec__1_~tmp___1~0#1; {951#false} is VALID [2022-02-20 18:08:51,531 INFO L272 TraceCheckUtils]: 19: Hoare triple {951#false} call __utac_acc__Specification3_spec__1_#t~ret5#1 := isMethaneLevelCritical(); {950#true} is VALID [2022-02-20 18:08:51,531 INFO L290 TraceCheckUtils]: 20: Hoare triple {950#true} havoc ~retValue_acc~6;~retValue_acc~6 := ~methaneLevelCritical~0;#res := ~retValue_acc~6; {950#true} is VALID [2022-02-20 18:08:51,531 INFO L290 TraceCheckUtils]: 21: Hoare triple {950#true} assume true; {950#true} is VALID [2022-02-20 18:08:51,532 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {950#true} {951#false} #216#return; {951#false} is VALID [2022-02-20 18:08:51,532 INFO L290 TraceCheckUtils]: 23: Hoare triple {951#false} assume -2147483648 <= __utac_acc__Specification3_spec__1_#t~ret5#1 && __utac_acc__Specification3_spec__1_#t~ret5#1 <= 2147483647;__utac_acc__Specification3_spec__1_~tmp~0#1 := __utac_acc__Specification3_spec__1_#t~ret5#1;havoc __utac_acc__Specification3_spec__1_#t~ret5#1; {951#false} is VALID [2022-02-20 18:08:51,532 INFO L290 TraceCheckUtils]: 24: Hoare triple {951#false} assume !(0 != __utac_acc__Specification3_spec__1_~tmp~0#1);assume { :begin_inline_getWaterLevel } true;havoc getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~7#1;havoc getWaterLevel_~retValue_acc~7#1;getWaterLevel_~retValue_acc~7#1 := ~waterLevel~0;getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~7#1; {951#false} is VALID [2022-02-20 18:08:51,532 INFO L290 TraceCheckUtils]: 25: Hoare triple {951#false} __utac_acc__Specification3_spec__1_#t~ret6#1 := getWaterLevel_#res#1;assume { :end_inline_getWaterLevel } true;assume -2147483648 <= __utac_acc__Specification3_spec__1_#t~ret6#1 && __utac_acc__Specification3_spec__1_#t~ret6#1 <= 2147483647;__utac_acc__Specification3_spec__1_~tmp___0~0#1 := __utac_acc__Specification3_spec__1_#t~ret6#1;havoc __utac_acc__Specification3_spec__1_#t~ret6#1; {951#false} is VALID [2022-02-20 18:08:51,532 INFO L290 TraceCheckUtils]: 26: Hoare triple {951#false} assume 2 == __utac_acc__Specification3_spec__1_~tmp___0~0#1;assume { :begin_inline_isPumpRunning } true;havoc isPumpRunning_#res#1;havoc isPumpRunning_~retValue_acc~10#1;havoc isPumpRunning_~retValue_acc~10#1;isPumpRunning_~retValue_acc~10#1 := ~pumpRunning~0;isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~10#1; {951#false} is VALID [2022-02-20 18:08:51,532 INFO L290 TraceCheckUtils]: 27: Hoare triple {951#false} __utac_acc__Specification3_spec__1_#t~ret7#1 := isPumpRunning_#res#1;assume { :end_inline_isPumpRunning } true;assume -2147483648 <= __utac_acc__Specification3_spec__1_#t~ret7#1 && __utac_acc__Specification3_spec__1_#t~ret7#1 <= 2147483647;__utac_acc__Specification3_spec__1_~tmp___1~0#1 := __utac_acc__Specification3_spec__1_#t~ret7#1;havoc __utac_acc__Specification3_spec__1_#t~ret7#1; {951#false} is VALID [2022-02-20 18:08:51,533 INFO L290 TraceCheckUtils]: 28: Hoare triple {951#false} assume !(0 != __utac_acc__Specification3_spec__1_~tmp___1~0#1);assume { :begin_inline___automaton_fail } true; {951#false} is VALID [2022-02-20 18:08:51,533 INFO L290 TraceCheckUtils]: 29: Hoare triple {951#false} assume !false; {951#false} is VALID [2022-02-20 18:08:51,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:08:51,533 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:08:51,533 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601717592] [2022-02-20 18:08:51,533 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601717592] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:08:51,534 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:08:51,534 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:08:51,534 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873935071] [2022-02-20 18:08:51,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:08:51,534 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-02-20 18:08:51,535 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:08:51,535 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:08:51,554 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:08:51,555 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:08:51,555 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:08:51,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:08:51,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:08:51,556 INFO L87 Difference]: Start difference. First operand 64 states and 81 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:08:51,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:08:51,934 INFO L93 Difference]: Finished difference Result 221 states and 287 transitions. [2022-02-20 18:08:51,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:08:51,935 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-02-20 18:08:51,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:08:51,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:08:51,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 287 transitions. [2022-02-20 18:08:51,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:08:51,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 287 transitions. [2022-02-20 18:08:51,942 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 287 transitions. [2022-02-20 18:08:52,135 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 287 edges. 287 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:08:52,138 INFO L225 Difference]: With dead ends: 221 [2022-02-20 18:08:52,138 INFO L226 Difference]: Without dead ends: 164 [2022-02-20 18:08:52,139 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:08:52,139 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 217 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:08:52,140 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [217 Valid, 398 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:08:52,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-02-20 18:08:52,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 158. [2022-02-20 18:08:52,149 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:08:52,149 INFO L82 GeneralOperation]: Start isEquivalent. First operand 164 states. Second operand has 158 states, 119 states have (on average 1.361344537815126) internal successors, (162), 133 states have internal predecessors, (162), 21 states have call successors, (21), 17 states have call predecessors, (21), 17 states have return successors, (22), 15 states have call predecessors, (22), 21 states have call successors, (22) [2022-02-20 18:08:52,150 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand has 158 states, 119 states have (on average 1.361344537815126) internal successors, (162), 133 states have internal predecessors, (162), 21 states have call successors, (21), 17 states have call predecessors, (21), 17 states have return successors, (22), 15 states have call predecessors, (22), 21 states have call successors, (22) [2022-02-20 18:08:52,150 INFO L87 Difference]: Start difference. First operand 164 states. Second operand has 158 states, 119 states have (on average 1.361344537815126) internal successors, (162), 133 states have internal predecessors, (162), 21 states have call successors, (21), 17 states have call predecessors, (21), 17 states have return successors, (22), 15 states have call predecessors, (22), 21 states have call successors, (22) [2022-02-20 18:08:52,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:08:52,155 INFO L93 Difference]: Finished difference Result 164 states and 209 transitions. [2022-02-20 18:08:52,155 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 209 transitions. [2022-02-20 18:08:52,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:08:52,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:08:52,156 INFO L74 IsIncluded]: Start isIncluded. First operand has 158 states, 119 states have (on average 1.361344537815126) internal successors, (162), 133 states have internal predecessors, (162), 21 states have call successors, (21), 17 states have call predecessors, (21), 17 states have return successors, (22), 15 states have call predecessors, (22), 21 states have call successors, (22) Second operand 164 states. [2022-02-20 18:08:52,157 INFO L87 Difference]: Start difference. First operand has 158 states, 119 states have (on average 1.361344537815126) internal successors, (162), 133 states have internal predecessors, (162), 21 states have call successors, (21), 17 states have call predecessors, (21), 17 states have return successors, (22), 15 states have call predecessors, (22), 21 states have call successors, (22) Second operand 164 states. [2022-02-20 18:08:52,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:08:52,161 INFO L93 Difference]: Finished difference Result 164 states and 209 transitions. [2022-02-20 18:08:52,161 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 209 transitions. [2022-02-20 18:08:52,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:08:52,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:08:52,162 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:08:52,162 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:08:52,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 119 states have (on average 1.361344537815126) internal successors, (162), 133 states have internal predecessors, (162), 21 states have call successors, (21), 17 states have call predecessors, (21), 17 states have return successors, (22), 15 states have call predecessors, (22), 21 states have call successors, (22) [2022-02-20 18:08:52,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 205 transitions. [2022-02-20 18:08:52,167 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 205 transitions. Word has length 30 [2022-02-20 18:08:52,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:08:52,167 INFO L470 AbstractCegarLoop]: Abstraction has 158 states and 205 transitions. [2022-02-20 18:08:52,168 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:08:52,168 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 205 transitions. [2022-02-20 18:08:52,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-02-20 18:08:52,169 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:08:52,169 INFO L514 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, 1] [2022-02-20 18:08:52,169 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:08:52,169 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:08:52,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:08:52,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1326960786, now seen corresponding path program 1 times [2022-02-20 18:08:52,170 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:08:52,170 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051822393] [2022-02-20 18:08:52,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:08:52,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:08:52,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:08:52,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-02-20 18:08:52,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:08:52,227 INFO L290 TraceCheckUtils]: 0: Hoare triple {1823#true} assume true; {1823#true} is VALID [2022-02-20 18:08:52,227 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {1823#true} {1825#(= ~waterLevel~0 1)} #214#return; {1825#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:52,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-02-20 18:08:52,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:08:52,231 INFO L290 TraceCheckUtils]: 0: Hoare triple {1823#true} havoc ~retValue_acc~6;~retValue_acc~6 := ~methaneLevelCritical~0;#res := ~retValue_acc~6; {1823#true} is VALID [2022-02-20 18:08:52,231 INFO L290 TraceCheckUtils]: 1: Hoare triple {1823#true} assume true; {1823#true} is VALID [2022-02-20 18:08:52,232 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1823#true} {1825#(= ~waterLevel~0 1)} #216#return; {1825#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:52,232 INFO L290 TraceCheckUtils]: 0: Hoare triple {1823#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(31, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(30, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(21, 6);call #Ultimate.allocInit(30, 7);call #Ultimate.allocInit(9, 8);call #Ultimate.allocInit(21, 9);call #Ultimate.allocInit(30, 10);call #Ultimate.allocInit(9, 11);call #Ultimate.allocInit(25, 12);call #Ultimate.allocInit(30, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(25, 15);call #Ultimate.allocInit(13, 16);call #Ultimate.allocInit(7, 17);call write~init~int(44, 17, 0, 1);call write~init~int(77, 17, 1, 1);call write~init~int(101, 17, 2, 1);call write~init~int(116, 17, 3, 1);call write~init~int(104, 17, 4, 1);call write~init~int(58, 17, 5, 1);call write~init~int(0, 17, 6, 1);call #Ultimate.allocInit(5, 18);call write~init~int(67, 18, 0, 1);call write~init~int(82, 18, 1, 1);call write~init~int(73, 18, 2, 1);call write~init~int(84, 18, 3, 1);call write~init~int(0, 18, 4, 1);call #Ultimate.allocInit(3, 19);call write~init~int(79, 19, 0, 1);call write~init~int(75, 19, 1, 1);call write~init~int(0, 19, 2, 1);call #Ultimate.allocInit(2, 20);call write~init~int(41, 20, 0, 1);call write~init~int(0, 20, 1, 1);call #Ultimate.allocInit(13, 21);call #Ultimate.allocInit(3, 22);call write~init~int(79, 22, 0, 1);call write~init~int(110, 22, 1, 1);call write~init~int(0, 22, 2, 1);call #Ultimate.allocInit(4, 23);call write~init~int(79, 23, 0, 1);call write~init~int(102, 23, 1, 1);call write~init~int(102, 23, 2, 1);call write~init~int(0, 23, 3, 1);call #Ultimate.allocInit(7, 24);call write~init~int(44, 24, 0, 1);call write~init~int(80, 24, 1, 1);call write~init~int(117, 24, 2, 1);call write~init~int(109, 24, 3, 1);call write~init~int(112, 24, 4, 1);call write~init~int(58, 24, 5, 1);call write~init~int(0, 24, 6, 1);call #Ultimate.allocInit(3, 25);call write~init~int(79, 25, 0, 1);call write~init~int(110, 25, 1, 1);call write~init~int(0, 25, 2, 1);call #Ultimate.allocInit(4, 26);call write~init~int(79, 26, 0, 1);call write~init~int(102, 26, 1, 1);call write~init~int(102, 26, 2, 1);call write~init~int(0, 26, 3, 1);call #Ultimate.allocInit(3, 27);call write~init~int(41, 27, 0, 1);call write~init~int(32, 27, 1, 1);call write~init~int(0, 27, 2, 1);call #Ultimate.allocInit(2, 28);call write~init~int(10, 28, 0, 1);call write~init~int(0, 28, 1, 1);~head~0.base, ~head~0.offset := 0, 0;~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~pumpRunning~0 := 0;~systemActive~0 := 1; {1825#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:52,233 INFO L290 TraceCheckUtils]: 1: Hoare triple {1825#(= ~waterLevel~0 1)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret31#1, main_~retValue_acc~5#1, main_~tmp~4#1;havoc main_~retValue_acc~5#1;havoc main_~tmp~4#1;assume { :begin_inline_select_helpers } true; {1825#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:52,233 INFO L290 TraceCheckUtils]: 2: Hoare triple {1825#(= ~waterLevel~0 1)} assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; {1825#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:52,233 INFO L290 TraceCheckUtils]: 3: Hoare triple {1825#(= ~waterLevel~0 1)} assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~1#1;havoc valid_product_~retValue_acc~1#1;valid_product_~retValue_acc~1#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~1#1; {1825#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:52,234 INFO L290 TraceCheckUtils]: 4: Hoare triple {1825#(= ~waterLevel~0 1)} main_#t~ret31#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;assume -2147483648 <= main_#t~ret31#1 && main_#t~ret31#1 <= 2147483647;main_~tmp~4#1 := main_#t~ret31#1;havoc main_#t~ret31#1; {1825#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:52,234 INFO L290 TraceCheckUtils]: 5: Hoare triple {1825#(= ~waterLevel~0 1)} assume 0 != main_~tmp~4#1;assume { :begin_inline_setup } true; {1825#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:52,234 INFO L290 TraceCheckUtils]: 6: Hoare triple {1825#(= ~waterLevel~0 1)} assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;havoc test_#t~nondet37#1, test_#t~nondet38#1, test_#t~nondet39#1, test_#t~nondet40#1, test_~splverifierCounter~0#1, test_~tmp~5#1, test_~tmp___0~1#1, test_~tmp___1~1#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~5#1;havoc test_~tmp___0~1#1;havoc test_~tmp___1~1#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0; {1825#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:52,235 INFO L290 TraceCheckUtils]: 7: Hoare triple {1825#(= ~waterLevel~0 1)} assume !false; {1825#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:52,235 INFO L290 TraceCheckUtils]: 8: Hoare triple {1825#(= ~waterLevel~0 1)} assume test_~splverifierCounter~0#1 < 4; {1825#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:52,235 INFO L290 TraceCheckUtils]: 9: Hoare triple {1825#(= ~waterLevel~0 1)} assume -2147483648 <= test_#t~nondet37#1 && test_#t~nondet37#1 <= 2147483647;test_~tmp~5#1 := test_#t~nondet37#1;havoc test_#t~nondet37#1; {1825#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:52,236 INFO L290 TraceCheckUtils]: 10: Hoare triple {1825#(= ~waterLevel~0 1)} assume !(0 != test_~tmp~5#1); {1825#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:52,236 INFO L290 TraceCheckUtils]: 11: Hoare triple {1825#(= ~waterLevel~0 1)} assume -2147483648 <= test_#t~nondet38#1 && test_#t~nondet38#1 <= 2147483647;test_~tmp___0~1#1 := test_#t~nondet38#1;havoc test_#t~nondet38#1; {1825#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:52,236 INFO L290 TraceCheckUtils]: 12: Hoare triple {1825#(= ~waterLevel~0 1)} assume !(0 != test_~tmp___0~1#1); {1825#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:52,237 INFO L290 TraceCheckUtils]: 13: Hoare triple {1825#(= ~waterLevel~0 1)} assume -2147483648 <= test_#t~nondet39#1 && test_#t~nondet39#1 <= 2147483647;test_~tmp___2~0#1 := test_#t~nondet39#1;havoc test_#t~nondet39#1; {1825#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:52,237 INFO L290 TraceCheckUtils]: 14: Hoare triple {1825#(= ~waterLevel~0 1)} assume 0 != test_~tmp___2~0#1; {1825#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:52,237 INFO L272 TraceCheckUtils]: 15: Hoare triple {1825#(= ~waterLevel~0 1)} call timeShift(); {1825#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:52,238 INFO L290 TraceCheckUtils]: 16: Hoare triple {1825#(= ~waterLevel~0 1)} assume !(0 != ~pumpRunning~0); {1825#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:52,238 INFO L290 TraceCheckUtils]: 17: Hoare triple {1825#(= ~waterLevel~0 1)} assume 0 != ~systemActive~0;assume { :begin_inline_processEnvironment } true;havoc processEnvironment_#t~ret41#1, processEnvironment_~tmp~6#1;havoc processEnvironment_~tmp~6#1; {1825#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:52,238 INFO L290 TraceCheckUtils]: 18: Hoare triple {1825#(= ~waterLevel~0 1)} assume !(0 != ~pumpRunning~0); {1825#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:52,238 INFO L272 TraceCheckUtils]: 19: Hoare triple {1825#(= ~waterLevel~0 1)} call processEnvironment__wrappee__base(); {1823#true} is VALID [2022-02-20 18:08:52,239 INFO L290 TraceCheckUtils]: 20: Hoare triple {1823#true} assume true; {1823#true} is VALID [2022-02-20 18:08:52,239 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1823#true} {1825#(= ~waterLevel~0 1)} #214#return; {1825#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:52,239 INFO L290 TraceCheckUtils]: 22: Hoare triple {1825#(= ~waterLevel~0 1)} assume { :end_inline_processEnvironment } true; {1825#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:52,240 INFO L290 TraceCheckUtils]: 23: Hoare triple {1825#(= ~waterLevel~0 1)} assume { :begin_inline___utac_acc__Specification3_spec__1 } true;havoc __utac_acc__Specification3_spec__1_#t~ret5#1, __utac_acc__Specification3_spec__1_#t~ret6#1, __utac_acc__Specification3_spec__1_#t~ret7#1, __utac_acc__Specification3_spec__1_~tmp~0#1, __utac_acc__Specification3_spec__1_~tmp___0~0#1, __utac_acc__Specification3_spec__1_~tmp___1~0#1;havoc __utac_acc__Specification3_spec__1_~tmp~0#1;havoc __utac_acc__Specification3_spec__1_~tmp___0~0#1;havoc __utac_acc__Specification3_spec__1_~tmp___1~0#1; {1825#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:52,240 INFO L272 TraceCheckUtils]: 24: Hoare triple {1825#(= ~waterLevel~0 1)} call __utac_acc__Specification3_spec__1_#t~ret5#1 := isMethaneLevelCritical(); {1823#true} is VALID [2022-02-20 18:08:52,240 INFO L290 TraceCheckUtils]: 25: Hoare triple {1823#true} havoc ~retValue_acc~6;~retValue_acc~6 := ~methaneLevelCritical~0;#res := ~retValue_acc~6; {1823#true} is VALID [2022-02-20 18:08:52,240 INFO L290 TraceCheckUtils]: 26: Hoare triple {1823#true} assume true; {1823#true} is VALID [2022-02-20 18:08:52,241 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1823#true} {1825#(= ~waterLevel~0 1)} #216#return; {1825#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:52,241 INFO L290 TraceCheckUtils]: 28: Hoare triple {1825#(= ~waterLevel~0 1)} assume -2147483648 <= __utac_acc__Specification3_spec__1_#t~ret5#1 && __utac_acc__Specification3_spec__1_#t~ret5#1 <= 2147483647;__utac_acc__Specification3_spec__1_~tmp~0#1 := __utac_acc__Specification3_spec__1_#t~ret5#1;havoc __utac_acc__Specification3_spec__1_#t~ret5#1; {1825#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:52,241 INFO L290 TraceCheckUtils]: 29: Hoare triple {1825#(= ~waterLevel~0 1)} assume !(0 != __utac_acc__Specification3_spec__1_~tmp~0#1);assume { :begin_inline_getWaterLevel } true;havoc getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~7#1;havoc getWaterLevel_~retValue_acc~7#1;getWaterLevel_~retValue_acc~7#1 := ~waterLevel~0;getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~7#1; {1831#(= |timeShift_getWaterLevel_#res#1| 1)} is VALID [2022-02-20 18:08:52,242 INFO L290 TraceCheckUtils]: 30: Hoare triple {1831#(= |timeShift_getWaterLevel_#res#1| 1)} __utac_acc__Specification3_spec__1_#t~ret6#1 := getWaterLevel_#res#1;assume { :end_inline_getWaterLevel } true;assume -2147483648 <= __utac_acc__Specification3_spec__1_#t~ret6#1 && __utac_acc__Specification3_spec__1_#t~ret6#1 <= 2147483647;__utac_acc__Specification3_spec__1_~tmp___0~0#1 := __utac_acc__Specification3_spec__1_#t~ret6#1;havoc __utac_acc__Specification3_spec__1_#t~ret6#1; {1832#(= |timeShift___utac_acc__Specification3_spec__1_~tmp___0~0#1| 1)} is VALID [2022-02-20 18:08:52,242 INFO L290 TraceCheckUtils]: 31: Hoare triple {1832#(= |timeShift___utac_acc__Specification3_spec__1_~tmp___0~0#1| 1)} assume 2 == __utac_acc__Specification3_spec__1_~tmp___0~0#1;assume { :begin_inline_isPumpRunning } true;havoc isPumpRunning_#res#1;havoc isPumpRunning_~retValue_acc~10#1;havoc isPumpRunning_~retValue_acc~10#1;isPumpRunning_~retValue_acc~10#1 := ~pumpRunning~0;isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~10#1; {1824#false} is VALID [2022-02-20 18:08:52,242 INFO L290 TraceCheckUtils]: 32: Hoare triple {1824#false} __utac_acc__Specification3_spec__1_#t~ret7#1 := isPumpRunning_#res#1;assume { :end_inline_isPumpRunning } true;assume -2147483648 <= __utac_acc__Specification3_spec__1_#t~ret7#1 && __utac_acc__Specification3_spec__1_#t~ret7#1 <= 2147483647;__utac_acc__Specification3_spec__1_~tmp___1~0#1 := __utac_acc__Specification3_spec__1_#t~ret7#1;havoc __utac_acc__Specification3_spec__1_#t~ret7#1; {1824#false} is VALID [2022-02-20 18:08:52,243 INFO L290 TraceCheckUtils]: 33: Hoare triple {1824#false} assume !(0 != __utac_acc__Specification3_spec__1_~tmp___1~0#1);assume { :begin_inline___automaton_fail } true; {1824#false} is VALID [2022-02-20 18:08:52,243 INFO L290 TraceCheckUtils]: 34: Hoare triple {1824#false} assume !false; {1824#false} is VALID [2022-02-20 18:08:52,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:08:52,243 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:08:52,243 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051822393] [2022-02-20 18:08:52,244 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051822393] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:08:52,244 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:08:52,244 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:08:52,244 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503100841] [2022-02-20 18:08:52,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:08:52,245 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2022-02-20 18:08:52,245 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:08:52,245 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 18:08:52,265 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:08:52,266 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:08:52,266 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:08:52,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:08:52,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:08:52,268 INFO L87 Difference]: Start difference. First operand 158 states and 205 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 18:08:52,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:08:52,443 INFO L93 Difference]: Finished difference Result 452 states and 606 transitions. [2022-02-20 18:08:52,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:08:52,444 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2022-02-20 18:08:52,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:08:52,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 18:08:52,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 229 transitions. [2022-02-20 18:08:52,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 18:08:52,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 229 transitions. [2022-02-20 18:08:52,450 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 229 transitions. [2022-02-20 18:08:52,584 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 229 edges. 229 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:08:52,593 INFO L225 Difference]: With dead ends: 452 [2022-02-20 18:08:52,593 INFO L226 Difference]: Without dead ends: 301 [2022-02-20 18:08:52,596 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:08:52,603 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 52 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:08:52,605 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 323 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:08:52,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2022-02-20 18:08:52,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 292. [2022-02-20 18:08:52,631 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:08:52,632 INFO L82 GeneralOperation]: Start isEquivalent. First operand 301 states. Second operand has 292 states, 218 states have (on average 1.3394495412844036) internal successors, (292), 242 states have internal predecessors, (292), 42 states have call successors, (42), 34 states have call predecessors, (42), 31 states have return successors, (48), 27 states have call predecessors, (48), 42 states have call successors, (48) [2022-02-20 18:08:52,635 INFO L74 IsIncluded]: Start isIncluded. First operand 301 states. Second operand has 292 states, 218 states have (on average 1.3394495412844036) internal successors, (292), 242 states have internal predecessors, (292), 42 states have call successors, (42), 34 states have call predecessors, (42), 31 states have return successors, (48), 27 states have call predecessors, (48), 42 states have call successors, (48) [2022-02-20 18:08:52,636 INFO L87 Difference]: Start difference. First operand 301 states. Second operand has 292 states, 218 states have (on average 1.3394495412844036) internal successors, (292), 242 states have internal predecessors, (292), 42 states have call successors, (42), 34 states have call predecessors, (42), 31 states have return successors, (48), 27 states have call predecessors, (48), 42 states have call successors, (48) [2022-02-20 18:08:52,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:08:52,645 INFO L93 Difference]: Finished difference Result 301 states and 392 transitions. [2022-02-20 18:08:52,645 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 392 transitions. [2022-02-20 18:08:52,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:08:52,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:08:52,649 INFO L74 IsIncluded]: Start isIncluded. First operand has 292 states, 218 states have (on average 1.3394495412844036) internal successors, (292), 242 states have internal predecessors, (292), 42 states have call successors, (42), 34 states have call predecessors, (42), 31 states have return successors, (48), 27 states have call predecessors, (48), 42 states have call successors, (48) Second operand 301 states. [2022-02-20 18:08:52,650 INFO L87 Difference]: Start difference. First operand has 292 states, 218 states have (on average 1.3394495412844036) internal successors, (292), 242 states have internal predecessors, (292), 42 states have call successors, (42), 34 states have call predecessors, (42), 31 states have return successors, (48), 27 states have call predecessors, (48), 42 states have call successors, (48) Second operand 301 states. [2022-02-20 18:08:52,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:08:52,659 INFO L93 Difference]: Finished difference Result 301 states and 392 transitions. [2022-02-20 18:08:52,659 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 392 transitions. [2022-02-20 18:08:52,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:08:52,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:08:52,660 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:08:52,660 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:08:52,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 218 states have (on average 1.3394495412844036) internal successors, (292), 242 states have internal predecessors, (292), 42 states have call successors, (42), 34 states have call predecessors, (42), 31 states have return successors, (48), 27 states have call predecessors, (48), 42 states have call successors, (48) [2022-02-20 18:08:52,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 382 transitions. [2022-02-20 18:08:52,669 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 382 transitions. Word has length 35 [2022-02-20 18:08:52,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:08:52,670 INFO L470 AbstractCegarLoop]: Abstraction has 292 states and 382 transitions. [2022-02-20 18:08:52,670 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 18:08:52,670 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 382 transitions. [2022-02-20 18:08:52,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 18:08:52,674 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:08:52,674 INFO L514 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, 1, 1, 1] [2022-02-20 18:08:52,674 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:08:52,674 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:08:52,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:08:52,674 INFO L85 PathProgramCache]: Analyzing trace with hash 942143177, now seen corresponding path program 1 times [2022-02-20 18:08:52,675 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:08:52,675 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765591689] [2022-02-20 18:08:52,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:08:52,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:08:52,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:08:52,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-20 18:08:52,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:08:52,716 INFO L290 TraceCheckUtils]: 0: Hoare triple {3484#true} assume true; {3484#true} is VALID [2022-02-20 18:08:52,716 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {3484#true} {3485#false} #214#return; {3485#false} is VALID [2022-02-20 18:08:52,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-02-20 18:08:52,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:08:52,719 INFO L290 TraceCheckUtils]: 0: Hoare triple {3484#true} havoc ~retValue_acc~6;~retValue_acc~6 := ~methaneLevelCritical~0;#res := ~retValue_acc~6; {3484#true} is VALID [2022-02-20 18:08:52,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {3484#true} assume true; {3484#true} is VALID [2022-02-20 18:08:52,719 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3484#true} {3485#false} #216#return; {3485#false} is VALID [2022-02-20 18:08:52,719 INFO L290 TraceCheckUtils]: 0: Hoare triple {3484#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(31, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(30, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(21, 6);call #Ultimate.allocInit(30, 7);call #Ultimate.allocInit(9, 8);call #Ultimate.allocInit(21, 9);call #Ultimate.allocInit(30, 10);call #Ultimate.allocInit(9, 11);call #Ultimate.allocInit(25, 12);call #Ultimate.allocInit(30, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(25, 15);call #Ultimate.allocInit(13, 16);call #Ultimate.allocInit(7, 17);call write~init~int(44, 17, 0, 1);call write~init~int(77, 17, 1, 1);call write~init~int(101, 17, 2, 1);call write~init~int(116, 17, 3, 1);call write~init~int(104, 17, 4, 1);call write~init~int(58, 17, 5, 1);call write~init~int(0, 17, 6, 1);call #Ultimate.allocInit(5, 18);call write~init~int(67, 18, 0, 1);call write~init~int(82, 18, 1, 1);call write~init~int(73, 18, 2, 1);call write~init~int(84, 18, 3, 1);call write~init~int(0, 18, 4, 1);call #Ultimate.allocInit(3, 19);call write~init~int(79, 19, 0, 1);call write~init~int(75, 19, 1, 1);call write~init~int(0, 19, 2, 1);call #Ultimate.allocInit(2, 20);call write~init~int(41, 20, 0, 1);call write~init~int(0, 20, 1, 1);call #Ultimate.allocInit(13, 21);call #Ultimate.allocInit(3, 22);call write~init~int(79, 22, 0, 1);call write~init~int(110, 22, 1, 1);call write~init~int(0, 22, 2, 1);call #Ultimate.allocInit(4, 23);call write~init~int(79, 23, 0, 1);call write~init~int(102, 23, 1, 1);call write~init~int(102, 23, 2, 1);call write~init~int(0, 23, 3, 1);call #Ultimate.allocInit(7, 24);call write~init~int(44, 24, 0, 1);call write~init~int(80, 24, 1, 1);call write~init~int(117, 24, 2, 1);call write~init~int(109, 24, 3, 1);call write~init~int(112, 24, 4, 1);call write~init~int(58, 24, 5, 1);call write~init~int(0, 24, 6, 1);call #Ultimate.allocInit(3, 25);call write~init~int(79, 25, 0, 1);call write~init~int(110, 25, 1, 1);call write~init~int(0, 25, 2, 1);call #Ultimate.allocInit(4, 26);call write~init~int(79, 26, 0, 1);call write~init~int(102, 26, 1, 1);call write~init~int(102, 26, 2, 1);call write~init~int(0, 26, 3, 1);call #Ultimate.allocInit(3, 27);call write~init~int(41, 27, 0, 1);call write~init~int(32, 27, 1, 1);call write~init~int(0, 27, 2, 1);call #Ultimate.allocInit(2, 28);call write~init~int(10, 28, 0, 1);call write~init~int(0, 28, 1, 1);~head~0.base, ~head~0.offset := 0, 0;~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~pumpRunning~0 := 0;~systemActive~0 := 1; {3486#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:08:52,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {3486#(= ~pumpRunning~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret31#1, main_~retValue_acc~5#1, main_~tmp~4#1;havoc main_~retValue_acc~5#1;havoc main_~tmp~4#1;assume { :begin_inline_select_helpers } true; {3486#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:08:52,720 INFO L290 TraceCheckUtils]: 2: Hoare triple {3486#(= ~pumpRunning~0 0)} assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; {3486#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:08:52,720 INFO L290 TraceCheckUtils]: 3: Hoare triple {3486#(= ~pumpRunning~0 0)} assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~1#1;havoc valid_product_~retValue_acc~1#1;valid_product_~retValue_acc~1#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~1#1; {3486#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:08:52,721 INFO L290 TraceCheckUtils]: 4: Hoare triple {3486#(= ~pumpRunning~0 0)} main_#t~ret31#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;assume -2147483648 <= main_#t~ret31#1 && main_#t~ret31#1 <= 2147483647;main_~tmp~4#1 := main_#t~ret31#1;havoc main_#t~ret31#1; {3486#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:08:52,721 INFO L290 TraceCheckUtils]: 5: Hoare triple {3486#(= ~pumpRunning~0 0)} assume 0 != main_~tmp~4#1;assume { :begin_inline_setup } true; {3486#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:08:52,721 INFO L290 TraceCheckUtils]: 6: Hoare triple {3486#(= ~pumpRunning~0 0)} assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;havoc test_#t~nondet37#1, test_#t~nondet38#1, test_#t~nondet39#1, test_#t~nondet40#1, test_~splverifierCounter~0#1, test_~tmp~5#1, test_~tmp___0~1#1, test_~tmp___1~1#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~5#1;havoc test_~tmp___0~1#1;havoc test_~tmp___1~1#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0; {3486#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:08:52,721 INFO L290 TraceCheckUtils]: 7: Hoare triple {3486#(= ~pumpRunning~0 0)} assume !false; {3486#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:08:52,722 INFO L290 TraceCheckUtils]: 8: Hoare triple {3486#(= ~pumpRunning~0 0)} assume test_~splverifierCounter~0#1 < 4; {3486#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:08:52,722 INFO L290 TraceCheckUtils]: 9: Hoare triple {3486#(= ~pumpRunning~0 0)} assume -2147483648 <= test_#t~nondet37#1 && test_#t~nondet37#1 <= 2147483647;test_~tmp~5#1 := test_#t~nondet37#1;havoc test_#t~nondet37#1; {3486#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:08:52,722 INFO L290 TraceCheckUtils]: 10: Hoare triple {3486#(= ~pumpRunning~0 0)} assume !(0 != test_~tmp~5#1); {3486#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:08:52,722 INFO L290 TraceCheckUtils]: 11: Hoare triple {3486#(= ~pumpRunning~0 0)} assume -2147483648 <= test_#t~nondet38#1 && test_#t~nondet38#1 <= 2147483647;test_~tmp___0~1#1 := test_#t~nondet38#1;havoc test_#t~nondet38#1; {3486#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:08:52,723 INFO L290 TraceCheckUtils]: 12: Hoare triple {3486#(= ~pumpRunning~0 0)} assume !(0 != test_~tmp___0~1#1); {3486#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:08:52,723 INFO L290 TraceCheckUtils]: 13: Hoare triple {3486#(= ~pumpRunning~0 0)} assume -2147483648 <= test_#t~nondet39#1 && test_#t~nondet39#1 <= 2147483647;test_~tmp___2~0#1 := test_#t~nondet39#1;havoc test_#t~nondet39#1; {3486#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:08:52,723 INFO L290 TraceCheckUtils]: 14: Hoare triple {3486#(= ~pumpRunning~0 0)} assume 0 != test_~tmp___2~0#1; {3486#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:08:52,724 INFO L272 TraceCheckUtils]: 15: Hoare triple {3486#(= ~pumpRunning~0 0)} call timeShift(); {3486#(= ~pumpRunning~0 0)} is VALID [2022-02-20 18:08:52,724 INFO L290 TraceCheckUtils]: 16: Hoare triple {3486#(= ~pumpRunning~0 0)} assume 0 != ~pumpRunning~0;assume { :begin_inline_lowerWaterLevel } true; {3485#false} is VALID [2022-02-20 18:08:52,724 INFO L290 TraceCheckUtils]: 17: Hoare triple {3485#false} assume ~waterLevel~0 > 0;~waterLevel~0 := ~waterLevel~0 - 1; {3485#false} is VALID [2022-02-20 18:08:52,724 INFO L290 TraceCheckUtils]: 18: Hoare triple {3485#false} assume { :end_inline_lowerWaterLevel } true; {3485#false} is VALID [2022-02-20 18:08:52,724 INFO L290 TraceCheckUtils]: 19: Hoare triple {3485#false} assume 0 != ~systemActive~0;assume { :begin_inline_processEnvironment } true;havoc processEnvironment_#t~ret41#1, processEnvironment_~tmp~6#1;havoc processEnvironment_~tmp~6#1; {3485#false} is VALID [2022-02-20 18:08:52,724 INFO L290 TraceCheckUtils]: 20: Hoare triple {3485#false} assume !(0 != ~pumpRunning~0); {3485#false} is VALID [2022-02-20 18:08:52,724 INFO L272 TraceCheckUtils]: 21: Hoare triple {3485#false} call processEnvironment__wrappee__base(); {3484#true} is VALID [2022-02-20 18:08:52,724 INFO L290 TraceCheckUtils]: 22: Hoare triple {3484#true} assume true; {3484#true} is VALID [2022-02-20 18:08:52,724 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3484#true} {3485#false} #214#return; {3485#false} is VALID [2022-02-20 18:08:52,725 INFO L290 TraceCheckUtils]: 24: Hoare triple {3485#false} assume { :end_inline_processEnvironment } true; {3485#false} is VALID [2022-02-20 18:08:52,725 INFO L290 TraceCheckUtils]: 25: Hoare triple {3485#false} assume { :begin_inline___utac_acc__Specification3_spec__1 } true;havoc __utac_acc__Specification3_spec__1_#t~ret5#1, __utac_acc__Specification3_spec__1_#t~ret6#1, __utac_acc__Specification3_spec__1_#t~ret7#1, __utac_acc__Specification3_spec__1_~tmp~0#1, __utac_acc__Specification3_spec__1_~tmp___0~0#1, __utac_acc__Specification3_spec__1_~tmp___1~0#1;havoc __utac_acc__Specification3_spec__1_~tmp~0#1;havoc __utac_acc__Specification3_spec__1_~tmp___0~0#1;havoc __utac_acc__Specification3_spec__1_~tmp___1~0#1; {3485#false} is VALID [2022-02-20 18:08:52,725 INFO L272 TraceCheckUtils]: 26: Hoare triple {3485#false} call __utac_acc__Specification3_spec__1_#t~ret5#1 := isMethaneLevelCritical(); {3484#true} is VALID [2022-02-20 18:08:52,725 INFO L290 TraceCheckUtils]: 27: Hoare triple {3484#true} havoc ~retValue_acc~6;~retValue_acc~6 := ~methaneLevelCritical~0;#res := ~retValue_acc~6; {3484#true} is VALID [2022-02-20 18:08:52,725 INFO L290 TraceCheckUtils]: 28: Hoare triple {3484#true} assume true; {3484#true} is VALID [2022-02-20 18:08:52,725 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {3484#true} {3485#false} #216#return; {3485#false} is VALID [2022-02-20 18:08:52,725 INFO L290 TraceCheckUtils]: 30: Hoare triple {3485#false} assume -2147483648 <= __utac_acc__Specification3_spec__1_#t~ret5#1 && __utac_acc__Specification3_spec__1_#t~ret5#1 <= 2147483647;__utac_acc__Specification3_spec__1_~tmp~0#1 := __utac_acc__Specification3_spec__1_#t~ret5#1;havoc __utac_acc__Specification3_spec__1_#t~ret5#1; {3485#false} is VALID [2022-02-20 18:08:52,725 INFO L290 TraceCheckUtils]: 31: Hoare triple {3485#false} assume !(0 != __utac_acc__Specification3_spec__1_~tmp~0#1);assume { :begin_inline_getWaterLevel } true;havoc getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~7#1;havoc getWaterLevel_~retValue_acc~7#1;getWaterLevel_~retValue_acc~7#1 := ~waterLevel~0;getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~7#1; {3485#false} is VALID [2022-02-20 18:08:52,725 INFO L290 TraceCheckUtils]: 32: Hoare triple {3485#false} __utac_acc__Specification3_spec__1_#t~ret6#1 := getWaterLevel_#res#1;assume { :end_inline_getWaterLevel } true;assume -2147483648 <= __utac_acc__Specification3_spec__1_#t~ret6#1 && __utac_acc__Specification3_spec__1_#t~ret6#1 <= 2147483647;__utac_acc__Specification3_spec__1_~tmp___0~0#1 := __utac_acc__Specification3_spec__1_#t~ret6#1;havoc __utac_acc__Specification3_spec__1_#t~ret6#1; {3485#false} is VALID [2022-02-20 18:08:52,725 INFO L290 TraceCheckUtils]: 33: Hoare triple {3485#false} assume 2 == __utac_acc__Specification3_spec__1_~tmp___0~0#1;assume { :begin_inline_isPumpRunning } true;havoc isPumpRunning_#res#1;havoc isPumpRunning_~retValue_acc~10#1;havoc isPumpRunning_~retValue_acc~10#1;isPumpRunning_~retValue_acc~10#1 := ~pumpRunning~0;isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~10#1; {3485#false} is VALID [2022-02-20 18:08:52,725 INFO L290 TraceCheckUtils]: 34: Hoare triple {3485#false} __utac_acc__Specification3_spec__1_#t~ret7#1 := isPumpRunning_#res#1;assume { :end_inline_isPumpRunning } true;assume -2147483648 <= __utac_acc__Specification3_spec__1_#t~ret7#1 && __utac_acc__Specification3_spec__1_#t~ret7#1 <= 2147483647;__utac_acc__Specification3_spec__1_~tmp___1~0#1 := __utac_acc__Specification3_spec__1_#t~ret7#1;havoc __utac_acc__Specification3_spec__1_#t~ret7#1; {3485#false} is VALID [2022-02-20 18:08:52,725 INFO L290 TraceCheckUtils]: 35: Hoare triple {3485#false} assume !(0 != __utac_acc__Specification3_spec__1_~tmp___1~0#1);assume { :begin_inline___automaton_fail } true; {3485#false} is VALID [2022-02-20 18:08:52,725 INFO L290 TraceCheckUtils]: 36: Hoare triple {3485#false} assume !false; {3485#false} is VALID [2022-02-20 18:08:52,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:08:52,726 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:08:52,726 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765591689] [2022-02-20 18:08:52,726 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765591689] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:08:52,726 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:08:52,726 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:08:52,726 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751788355] [2022-02-20 18:08:52,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:08:52,726 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2022-02-20 18:08:52,727 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:08:52,727 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 18:08:52,746 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:08:52,746 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:08:52,746 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:08:52,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:08:52,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:08:52,747 INFO L87 Difference]: Start difference. First operand 292 states and 382 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 18:08:52,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:08:52,803 INFO L93 Difference]: Finished difference Result 516 states and 684 transitions. [2022-02-20 18:08:52,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:08:52,803 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2022-02-20 18:08:52,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:08:52,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 18:08:52,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2022-02-20 18:08:52,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 18:08:52,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2022-02-20 18:08:52,806 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 138 transitions. [2022-02-20 18:08:52,896 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:08:52,900 INFO L225 Difference]: With dead ends: 516 [2022-02-20 18:08:52,900 INFO L226 Difference]: Without dead ends: 231 [2022-02-20 18:08:52,901 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:08:52,901 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 44 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:08:52,902 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 56 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:08:52,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-02-20 18:08:52,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 227. [2022-02-20 18:08:52,911 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:08:52,912 INFO L82 GeneralOperation]: Start isEquivalent. First operand 231 states. Second operand has 227 states, 173 states have (on average 1.2716763005780347) internal successors, (220), 183 states have internal predecessors, (220), 28 states have call successors, (28), 28 states have call predecessors, (28), 25 states have return successors, (30), 25 states have call predecessors, (30), 28 states have call successors, (30) [2022-02-20 18:08:52,912 INFO L74 IsIncluded]: Start isIncluded. First operand 231 states. Second operand has 227 states, 173 states have (on average 1.2716763005780347) internal successors, (220), 183 states have internal predecessors, (220), 28 states have call successors, (28), 28 states have call predecessors, (28), 25 states have return successors, (30), 25 states have call predecessors, (30), 28 states have call successors, (30) [2022-02-20 18:08:52,913 INFO L87 Difference]: Start difference. First operand 231 states. Second operand has 227 states, 173 states have (on average 1.2716763005780347) internal successors, (220), 183 states have internal predecessors, (220), 28 states have call successors, (28), 28 states have call predecessors, (28), 25 states have return successors, (30), 25 states have call predecessors, (30), 28 states have call successors, (30) [2022-02-20 18:08:52,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:08:52,918 INFO L93 Difference]: Finished difference Result 231 states and 282 transitions. [2022-02-20 18:08:52,918 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 282 transitions. [2022-02-20 18:08:52,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:08:52,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:08:52,919 INFO L74 IsIncluded]: Start isIncluded. First operand has 227 states, 173 states have (on average 1.2716763005780347) internal successors, (220), 183 states have internal predecessors, (220), 28 states have call successors, (28), 28 states have call predecessors, (28), 25 states have return successors, (30), 25 states have call predecessors, (30), 28 states have call successors, (30) Second operand 231 states. [2022-02-20 18:08:52,919 INFO L87 Difference]: Start difference. First operand has 227 states, 173 states have (on average 1.2716763005780347) internal successors, (220), 183 states have internal predecessors, (220), 28 states have call successors, (28), 28 states have call predecessors, (28), 25 states have return successors, (30), 25 states have call predecessors, (30), 28 states have call successors, (30) Second operand 231 states. [2022-02-20 18:08:52,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:08:52,925 INFO L93 Difference]: Finished difference Result 231 states and 282 transitions. [2022-02-20 18:08:52,925 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 282 transitions. [2022-02-20 18:08:52,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:08:52,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:08:52,925 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:08:52,925 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:08:52,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 173 states have (on average 1.2716763005780347) internal successors, (220), 183 states have internal predecessors, (220), 28 states have call successors, (28), 28 states have call predecessors, (28), 25 states have return successors, (30), 25 states have call predecessors, (30), 28 states have call successors, (30) [2022-02-20 18:08:52,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 278 transitions. [2022-02-20 18:08:52,932 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 278 transitions. Word has length 37 [2022-02-20 18:08:52,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:08:52,932 INFO L470 AbstractCegarLoop]: Abstraction has 227 states and 278 transitions. [2022-02-20 18:08:52,932 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 18:08:52,932 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 278 transitions. [2022-02-20 18:08:52,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-02-20 18:08:52,933 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:08:52,933 INFO L514 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, 1, 1, 1, 1, 1] [2022-02-20 18:08:52,933 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:08:52,933 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:08:52,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:08:52,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1101152696, now seen corresponding path program 1 times [2022-02-20 18:08:52,934 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:08:52,934 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704951371] [2022-02-20 18:08:52,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:08:52,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:08:52,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 18:08:52,953 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 18:08:52,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 18:08:53,001 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 18:08:53,001 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 18:08:53,002 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 18:08:53,003 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:08:53,006 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-02-20 18:08:53,008 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 18:08:53,028 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call waterRise(); [2022-02-20 18:08:53,028 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: callstack broken after backtranslation by InlinerBacktranslator at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:216) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:206) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getProgramExecutionAsString(CounterExampleResult.java:155) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getLongDescription(CounterExampleResult.java:134) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportLocationResults(TraceAbstractionStarter.java:607) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-20 18:08:53,034 INFO L158 Benchmark]: Toolchain (without parser) took 3779.48ms. Allocated memory was 98.6MB in the beginning and 136.3MB in the end (delta: 37.7MB). Free memory was 59.9MB in the beginning and 36.8MB in the end (delta: 23.1MB). Peak memory consumption was 61.6MB. Max. memory is 16.1GB. [2022-02-20 18:08:53,034 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 98.6MB. Free memory was 76.8MB in the beginning and 76.7MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 18:08:53,034 INFO L158 Benchmark]: CACSL2BoogieTranslator took 357.73ms. Allocated memory is still 98.6MB. Free memory was 59.7MB in the beginning and 62.9MB in the end (delta: -3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 18:08:53,034 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.62ms. Allocated memory is still 98.6MB. Free memory was 62.9MB in the beginning and 60.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 18:08:53,035 INFO L158 Benchmark]: Boogie Preprocessor took 31.02ms. Allocated memory is still 98.6MB. Free memory was 60.5MB in the beginning and 58.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 18:08:53,035 INFO L158 Benchmark]: RCFGBuilder took 497.23ms. Allocated memory is still 98.6MB. Free memory was 58.8MB in the beginning and 39.5MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-02-20 18:08:53,035 INFO L158 Benchmark]: TraceAbstraction took 2842.97ms. Allocated memory was 98.6MB in the beginning and 136.3MB in the end (delta: 37.7MB). Free memory was 38.7MB in the beginning and 36.8MB in the end (delta: 1.8MB). Peak memory consumption was 42.7MB. Max. memory is 16.1GB. [2022-02-20 18:08:53,036 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 98.6MB. Free memory was 76.8MB in the beginning and 76.7MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 357.73ms. Allocated memory is still 98.6MB. Free memory was 59.7MB in the beginning and 62.9MB in the end (delta: -3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.62ms. Allocated memory is still 98.6MB. Free memory was 62.9MB in the beginning and 60.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.02ms. Allocated memory is still 98.6MB. Free memory was 60.5MB in the beginning and 58.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 497.23ms. Allocated memory is still 98.6MB. Free memory was 58.8MB in the beginning and 39.5MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 2842.97ms. Allocated memory was 98.6MB in the beginning and 136.3MB in the end (delta: 37.7MB). Free memory was 38.7MB in the beginning and 36.8MB in the end (delta: 1.8MB). Peak memory consumption was 42.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: callstack broken after backtranslation by InlinerBacktranslator: de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 18:08:53,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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_spec3_product19.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 310c99156af564276fd2307b8bd19d77055bd9a88be466df2e869c4dbf78e36f --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:08:54,878 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:08:54,880 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:08:54,905 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:08:54,907 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:08:54,910 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:08:54,911 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:08:54,915 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:08:54,917 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:08:54,920 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:08:54,921 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:08:54,923 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:08:54,924 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:08:54,925 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:08:54,926 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:08:54,928 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:08:54,928 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:08:54,929 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:08:54,932 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:08:54,936 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:08:54,936 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:08:54,937 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:08:54,938 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:08:54,939 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:08:54,944 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:08:54,944 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:08:54,944 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:08:54,945 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:08:54,945 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:08:54,946 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:08:54,946 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:08:54,946 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:08:54,948 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:08:54,948 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:08:54,949 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:08:54,949 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:08:54,949 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:08:54,950 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:08:54,950 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:08:54,951 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:08:54,951 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:08:54,955 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-02-20 18:08:54,982 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:08:54,983 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:08:54,984 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:08:54,984 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:08:54,984 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:08:54,985 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:08:54,985 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:08:54,986 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:08:54,986 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:08:54,986 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:08:54,987 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:08:54,987 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:08:54,987 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:08:54,987 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:08:54,987 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:08:54,987 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:08:54,987 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 18:08:54,987 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 18:08:54,988 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 18:08:54,988 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:08:54,988 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:08:54,988 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:08:54,988 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:08:54,988 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:08:54,988 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:08:54,989 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:08:54,993 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:08:54,993 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:08:54,993 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:08:54,994 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:08:54,994 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 18:08:54,994 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 18:08:54,994 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:08:54,994 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:08:54,994 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:08:54,995 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 18:08:54,995 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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(reach_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 -> 310c99156af564276fd2307b8bd19d77055bd9a88be466df2e869c4dbf78e36f [2022-02-20 18:08:55,273 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:08:55,291 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:08:55,293 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:08:55,294 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:08:55,294 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:08:55,296 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec3_product19.cil.c [2022-02-20 18:08:55,358 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43a8070dd/706dffe8e6354a5d871adccae27459c5/FLAG7e4c5b7d7 [2022-02-20 18:08:55,794 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:08:55,795 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec3_product19.cil.c [2022-02-20 18:08:55,802 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43a8070dd/706dffe8e6354a5d871adccae27459c5/FLAG7e4c5b7d7 [2022-02-20 18:08:55,811 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43a8070dd/706dffe8e6354a5d871adccae27459c5 [2022-02-20 18:08:55,813 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:08:55,813 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:08:55,826 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:08:55,827 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:08:55,834 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:08:55,835 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:08:55" (1/1) ... [2022-02-20 18:08:55,836 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67ffbc00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:08:55, skipping insertion in model container [2022-02-20 18:08:55,836 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:08:55" (1/1) ... [2022-02-20 18:08:55,840 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:08:55,869 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:08:55,971 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec3_product19.cil.c[1605,1618] [2022-02-20 18:08:56,113 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:08:56,126 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-02-20 18:08:56,131 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:08:56,134 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec3_product19.cil.c[1605,1618] [2022-02-20 18:08:56,186 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:08:56,189 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:08:56,198 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec3_product19.cil.c[1605,1618] [2022-02-20 18:08:56,247 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:08:56,260 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:08:56,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:08:56 WrapperNode [2022-02-20 18:08:56,261 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:08:56,261 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:08:56,261 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:08:56,261 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:08:56,266 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:08:56" (1/1) ... [2022-02-20 18:08:56,290 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:08:56" (1/1) ... [2022-02-20 18:08:56,325 INFO L137 Inliner]: procedures = 55, calls = 152, calls flagged for inlining = 20, calls inlined = 17, statements flattened = 218 [2022-02-20 18:08:56,326 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:08:56,327 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:08:56,328 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:08:56,328 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:08:56,334 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:08:56" (1/1) ... [2022-02-20 18:08:56,335 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:08:56" (1/1) ... [2022-02-20 18:08:56,349 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:08:56" (1/1) ... [2022-02-20 18:08:56,350 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:08:56" (1/1) ... [2022-02-20 18:08:56,354 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:08:56" (1/1) ... [2022-02-20 18:08:56,367 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:08:56" (1/1) ... [2022-02-20 18:08:56,368 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:08:56" (1/1) ... [2022-02-20 18:08:56,370 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:08:56,371 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:08:56,371 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:08:56,371 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:08:56,375 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:08:56" (1/1) ... [2022-02-20 18:08:56,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:08:56,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:08:56,406 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 18:08:56,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 18:08:56,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:08:56,449 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2022-02-20 18:08:56,449 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2022-02-20 18:08:56,449 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2022-02-20 18:08:56,449 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2022-02-20 18:08:56,450 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2022-02-20 18:08:56,450 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2022-02-20 18:08:56,450 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2022-02-20 18:08:56,450 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2022-02-20 18:08:56,450 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2022-02-20 18:08:56,450 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2022-02-20 18:08:56,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 18:08:56,450 INFO L130 BoogieDeclarations]: Found specification of procedure deactivatePump [2022-02-20 18:08:56,450 INFO L138 BoogieDeclarations]: Found implementation of procedure deactivatePump [2022-02-20 18:08:56,451 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2022-02-20 18:08:56,451 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2022-02-20 18:08:56,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:08:56,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:08:56,535 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:08:56,537 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:08:56,803 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:08:56,808 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:08:56,808 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 18:08:56,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:08:56 BoogieIcfgContainer [2022-02-20 18:08:56,810 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:08:56,811 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:08:56,811 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:08:56,813 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:08:56,813 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:08:55" (1/3) ... [2022-02-20 18:08:56,814 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@130440af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:08:56, skipping insertion in model container [2022-02-20 18:08:56,814 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:08:56" (2/3) ... [2022-02-20 18:08:56,814 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@130440af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:08:56, skipping insertion in model container [2022-02-20 18:08:56,814 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:08:56" (3/3) ... [2022-02-20 18:08:56,815 INFO L111 eAbstractionObserver]: Analyzing ICFG minepump_spec3_product19.cil.c [2022-02-20 18:08:56,819 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:08:56,820 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:08:56,864 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:08:56,870 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 18:08:56,870 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:08:56,889 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 62 states have (on average 1.3870967741935485) internal successors, (86), 69 states have internal predecessors, (86), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 18:08:56,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 18:08:56,896 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:08:56,897 INFO L514 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] [2022-02-20 18:08:56,897 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:08:56,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:08:56,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1452553281, now seen corresponding path program 1 times [2022-02-20 18:08:56,914 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 18:08:56,914 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [835897623] [2022-02-20 18:08:56,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:08:56,916 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 18:08:56,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 18:08:56,918 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 18:08:56,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 18:08:57,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:08:57,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 18:08:57,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:08:57,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:08:57,140 INFO L290 TraceCheckUtils]: 0: Hoare triple {85#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(31bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);call #Ultimate.allocInit(30bv32, 4bv32);call #Ultimate.allocInit(9bv32, 5bv32);call #Ultimate.allocInit(21bv32, 6bv32);call #Ultimate.allocInit(30bv32, 7bv32);call #Ultimate.allocInit(9bv32, 8bv32);call #Ultimate.allocInit(21bv32, 9bv32);call #Ultimate.allocInit(30bv32, 10bv32);call #Ultimate.allocInit(9bv32, 11bv32);call #Ultimate.allocInit(25bv32, 12bv32);call #Ultimate.allocInit(30bv32, 13bv32);call #Ultimate.allocInit(9bv32, 14bv32);call #Ultimate.allocInit(25bv32, 15bv32);call #Ultimate.allocInit(13bv32, 16bv32);call #Ultimate.allocInit(7bv32, 17bv32);call write~init~intINTTYPE1(44bv8, 17bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(77bv8, 17bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(101bv8, 17bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(116bv8, 17bv32, 3bv32, 1bv32);call write~init~intINTTYPE1(104bv8, 17bv32, 4bv32, 1bv32);call write~init~intINTTYPE1(58bv8, 17bv32, 5bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 17bv32, 6bv32, 1bv32);call #Ultimate.allocInit(5bv32, 18bv32);call write~init~intINTTYPE1(67bv8, 18bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(82bv8, 18bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(73bv8, 18bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(84bv8, 18bv32, 3bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 18bv32, 4bv32, 1bv32);call #Ultimate.allocInit(3bv32, 19bv32);call write~init~intINTTYPE1(79bv8, 19bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(75bv8, 19bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 19bv32, 2bv32, 1bv32);call #Ultimate.allocInit(2bv32, 20bv32);call write~init~intINTTYPE1(41bv8, 20bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 20bv32, 1bv32, 1bv32);call #Ultimate.allocInit(13bv32, 21bv32);call #Ultimate.allocInit(3bv32, 22bv32);call write~init~intINTTYPE1(79bv8, 22bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(110bv8, 22bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 22bv32, 2bv32, 1bv32);call #Ultimate.allocInit(4bv32, 23bv32);call write~init~intINTTYPE1(79bv8, 23bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(102bv8, 23bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(102bv8, 23bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 23bv32, 3bv32, 1bv32);call #Ultimate.allocInit(7bv32, 24bv32);call write~init~intINTTYPE1(44bv8, 24bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(80bv8, 24bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(117bv8, 24bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(109bv8, 24bv32, 3bv32, 1bv32);call write~init~intINTTYPE1(112bv8, 24bv32, 4bv32, 1bv32);call write~init~intINTTYPE1(58bv8, 24bv32, 5bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 24bv32, 6bv32, 1bv32);call #Ultimate.allocInit(3bv32, 25bv32);call write~init~intINTTYPE1(79bv8, 25bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(110bv8, 25bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 25bv32, 2bv32, 1bv32);call #Ultimate.allocInit(4bv32, 26bv32);call write~init~intINTTYPE1(79bv8, 26bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(102bv8, 26bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(102bv8, 26bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 26bv32, 3bv32, 1bv32);call #Ultimate.allocInit(3bv32, 27bv32);call write~init~intINTTYPE1(41bv8, 27bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(32bv8, 27bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 27bv32, 2bv32, 1bv32);call #Ultimate.allocInit(2bv32, 28bv32);call write~init~intINTTYPE1(10bv8, 28bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 28bv32, 1bv32, 1bv32);~head~0.base, ~head~0.offset := 0bv32, 0bv32;~cleanupTimeShifts~0 := 4bv32;~waterLevel~0 := 1bv32;~methaneLevelCritical~0 := 0bv32;~pumpRunning~0 := 0bv32;~systemActive~0 := 1bv32; {85#true} is VALID [2022-02-20 18:08:57,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {85#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret31#1, main_~retValue_acc~5#1, main_~tmp~4#1;havoc main_~retValue_acc~5#1;havoc main_~tmp~4#1;assume { :begin_inline_select_helpers } true; {85#true} is VALID [2022-02-20 18:08:57,144 INFO L290 TraceCheckUtils]: 2: Hoare triple {85#true} assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; {85#true} is VALID [2022-02-20 18:08:57,144 INFO L290 TraceCheckUtils]: 3: Hoare triple {85#true} assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~1#1;havoc valid_product_~retValue_acc~1#1;valid_product_~retValue_acc~1#1 := 1bv32;valid_product_#res#1 := valid_product_~retValue_acc~1#1; {85#true} is VALID [2022-02-20 18:08:57,144 INFO L290 TraceCheckUtils]: 4: Hoare triple {85#true} main_#t~ret31#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;main_~tmp~4#1 := main_#t~ret31#1;havoc main_#t~ret31#1; {85#true} is VALID [2022-02-20 18:08:57,145 INFO L290 TraceCheckUtils]: 5: Hoare triple {85#true} assume 0bv32 != main_~tmp~4#1;assume { :begin_inline_setup } true; {85#true} is VALID [2022-02-20 18:08:57,145 INFO L290 TraceCheckUtils]: 6: Hoare triple {85#true} assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;havoc test_#t~nondet37#1, test_#t~nondet38#1, test_#t~nondet39#1, test_#t~nondet40#1, test_~splverifierCounter~0#1, test_~tmp~5#1, test_~tmp___0~1#1, test_~tmp___1~1#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~5#1;havoc test_~tmp___0~1#1;havoc test_~tmp___1~1#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0bv32; {85#true} is VALID [2022-02-20 18:08:57,146 INFO L290 TraceCheckUtils]: 7: Hoare triple {85#true} assume false; {86#false} is VALID [2022-02-20 18:08:57,146 INFO L272 TraceCheckUtils]: 8: Hoare triple {86#false} call cleanup(); {86#false} is VALID [2022-02-20 18:08:57,146 INFO L290 TraceCheckUtils]: 9: Hoare triple {86#false} havoc ~i~0;havoc ~__cil_tmp2~0; {86#false} is VALID [2022-02-20 18:08:57,146 INFO L272 TraceCheckUtils]: 10: Hoare triple {86#false} call timeShift(); {86#false} is VALID [2022-02-20 18:08:57,147 INFO L290 TraceCheckUtils]: 11: Hoare triple {86#false} assume !(0bv32 != ~pumpRunning~0); {86#false} is VALID [2022-02-20 18:08:57,147 INFO L290 TraceCheckUtils]: 12: Hoare triple {86#false} assume !(0bv32 != ~systemActive~0); {86#false} is VALID [2022-02-20 18:08:57,147 INFO L290 TraceCheckUtils]: 13: Hoare triple {86#false} assume { :begin_inline___utac_acc__Specification3_spec__1 } true;havoc __utac_acc__Specification3_spec__1_#t~ret5#1, __utac_acc__Specification3_spec__1_#t~ret6#1, __utac_acc__Specification3_spec__1_#t~ret7#1, __utac_acc__Specification3_spec__1_~tmp~0#1, __utac_acc__Specification3_spec__1_~tmp___0~0#1, __utac_acc__Specification3_spec__1_~tmp___1~0#1;havoc __utac_acc__Specification3_spec__1_~tmp~0#1;havoc __utac_acc__Specification3_spec__1_~tmp___0~0#1;havoc __utac_acc__Specification3_spec__1_~tmp___1~0#1; {86#false} is VALID [2022-02-20 18:08:57,147 INFO L272 TraceCheckUtils]: 14: Hoare triple {86#false} call __utac_acc__Specification3_spec__1_#t~ret5#1 := isMethaneLevelCritical(); {86#false} is VALID [2022-02-20 18:08:57,147 INFO L290 TraceCheckUtils]: 15: Hoare triple {86#false} havoc ~retValue_acc~6;~retValue_acc~6 := ~methaneLevelCritical~0;#res := ~retValue_acc~6; {86#false} is VALID [2022-02-20 18:08:57,148 INFO L290 TraceCheckUtils]: 16: Hoare triple {86#false} assume true; {86#false} is VALID [2022-02-20 18:08:57,148 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {86#false} {86#false} #216#return; {86#false} is VALID [2022-02-20 18:08:57,148 INFO L290 TraceCheckUtils]: 18: Hoare triple {86#false} __utac_acc__Specification3_spec__1_~tmp~0#1 := __utac_acc__Specification3_spec__1_#t~ret5#1;havoc __utac_acc__Specification3_spec__1_#t~ret5#1; {86#false} is VALID [2022-02-20 18:08:57,149 INFO L290 TraceCheckUtils]: 19: Hoare triple {86#false} assume !(0bv32 != __utac_acc__Specification3_spec__1_~tmp~0#1);assume { :begin_inline_getWaterLevel } true;havoc getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~7#1;havoc getWaterLevel_~retValue_acc~7#1;getWaterLevel_~retValue_acc~7#1 := ~waterLevel~0;getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~7#1; {86#false} is VALID [2022-02-20 18:08:57,149 INFO L290 TraceCheckUtils]: 20: Hoare triple {86#false} __utac_acc__Specification3_spec__1_#t~ret6#1 := getWaterLevel_#res#1;assume { :end_inline_getWaterLevel } true;__utac_acc__Specification3_spec__1_~tmp___0~0#1 := __utac_acc__Specification3_spec__1_#t~ret6#1;havoc __utac_acc__Specification3_spec__1_#t~ret6#1; {86#false} is VALID [2022-02-20 18:08:57,149 INFO L290 TraceCheckUtils]: 21: Hoare triple {86#false} assume 2bv32 == __utac_acc__Specification3_spec__1_~tmp___0~0#1;assume { :begin_inline_isPumpRunning } true;havoc isPumpRunning_#res#1;havoc isPumpRunning_~retValue_acc~10#1;havoc isPumpRunning_~retValue_acc~10#1;isPumpRunning_~retValue_acc~10#1 := ~pumpRunning~0;isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~10#1; {86#false} is VALID [2022-02-20 18:08:57,150 INFO L290 TraceCheckUtils]: 22: Hoare triple {86#false} __utac_acc__Specification3_spec__1_#t~ret7#1 := isPumpRunning_#res#1;assume { :end_inline_isPumpRunning } true;__utac_acc__Specification3_spec__1_~tmp___1~0#1 := __utac_acc__Specification3_spec__1_#t~ret7#1;havoc __utac_acc__Specification3_spec__1_#t~ret7#1; {86#false} is VALID [2022-02-20 18:08:57,150 INFO L290 TraceCheckUtils]: 23: Hoare triple {86#false} assume !(0bv32 != __utac_acc__Specification3_spec__1_~tmp___1~0#1);assume { :begin_inline___automaton_fail } true; {86#false} is VALID [2022-02-20 18:08:57,150 INFO L290 TraceCheckUtils]: 24: Hoare triple {86#false} assume !false; {86#false} is VALID [2022-02-20 18:08:57,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:08:57,151 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 18:08:57,152 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 18:08:57,152 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [835897623] [2022-02-20 18:08:57,153 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [835897623] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:08:57,153 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:08:57,153 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 18:08:57,154 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815325250] [2022-02-20 18:08:57,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:08:57,159 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-02-20 18:08:57,160 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:08:57,163 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:08:57,195 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:08:57,196 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 18:08:57,196 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 18:08:57,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 18:08:57,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 18:08:57,221 INFO L87 Difference]: Start difference. First operand has 82 states, 62 states have (on average 1.3870967741935485) internal successors, (86), 69 states have internal predecessors, (86), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:08:57,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:08:57,333 INFO L93 Difference]: Finished difference Result 156 states and 211 transitions. [2022-02-20 18:08:57,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 18:08:57,334 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-02-20 18:08:57,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:08:57,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:08:57,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 211 transitions. [2022-02-20 18:08:57,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:08:57,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 211 transitions. [2022-02-20 18:08:57,353 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 211 transitions. [2022-02-20 18:08:57,510 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 211 edges. 211 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:08:57,517 INFO L225 Difference]: With dead ends: 156 [2022-02-20 18:08:57,517 INFO L226 Difference]: Without dead ends: 73 [2022-02-20 18:08:57,520 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 18:08:57,522 INFO L933 BasicCegarLoop]: 102 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:08:57,523 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:08:57,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-02-20 18:08:57,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-02-20 18:08:57,544 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:08:57,548 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 73 states, 55 states have (on average 1.309090909090909) internal successors, (72), 61 states have internal predecessors, (72), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 18:08:57,549 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 73 states, 55 states have (on average 1.309090909090909) internal successors, (72), 61 states have internal predecessors, (72), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 18:08:57,549 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 73 states, 55 states have (on average 1.309090909090909) internal successors, (72), 61 states have internal predecessors, (72), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 18:08:57,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:08:57,553 INFO L93 Difference]: Finished difference Result 73 states and 93 transitions. [2022-02-20 18:08:57,554 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 93 transitions. [2022-02-20 18:08:57,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:08:57,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:08:57,555 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 55 states have (on average 1.309090909090909) internal successors, (72), 61 states have internal predecessors, (72), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) Second operand 73 states. [2022-02-20 18:08:57,556 INFO L87 Difference]: Start difference. First operand has 73 states, 55 states have (on average 1.309090909090909) internal successors, (72), 61 states have internal predecessors, (72), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) Second operand 73 states. [2022-02-20 18:08:57,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:08:57,559 INFO L93 Difference]: Finished difference Result 73 states and 93 transitions. [2022-02-20 18:08:57,559 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 93 transitions. [2022-02-20 18:08:57,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:08:57,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:08:57,560 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:08:57,560 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:08:57,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 55 states have (on average 1.309090909090909) internal successors, (72), 61 states have internal predecessors, (72), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 18:08:57,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 93 transitions. [2022-02-20 18:08:57,565 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 93 transitions. Word has length 25 [2022-02-20 18:08:57,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:08:57,565 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 93 transitions. [2022-02-20 18:08:57,565 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:08:57,565 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 93 transitions. [2022-02-20 18:08:57,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 18:08:57,567 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:08:57,567 INFO L514 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] [2022-02-20 18:08:57,577 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-02-20 18:08:57,774 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 18:08:57,775 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:08:57,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:08:57,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1317189843, now seen corresponding path program 1 times [2022-02-20 18:08:57,776 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 18:08:57,776 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1836037922] [2022-02-20 18:08:57,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:08:57,777 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 18:08:57,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 18:08:57,778 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 18:08:57,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 18:08:57,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:08:57,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 18:08:57,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:08:57,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:08:57,912 INFO L290 TraceCheckUtils]: 0: Hoare triple {637#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(31bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);call #Ultimate.allocInit(30bv32, 4bv32);call #Ultimate.allocInit(9bv32, 5bv32);call #Ultimate.allocInit(21bv32, 6bv32);call #Ultimate.allocInit(30bv32, 7bv32);call #Ultimate.allocInit(9bv32, 8bv32);call #Ultimate.allocInit(21bv32, 9bv32);call #Ultimate.allocInit(30bv32, 10bv32);call #Ultimate.allocInit(9bv32, 11bv32);call #Ultimate.allocInit(25bv32, 12bv32);call #Ultimate.allocInit(30bv32, 13bv32);call #Ultimate.allocInit(9bv32, 14bv32);call #Ultimate.allocInit(25bv32, 15bv32);call #Ultimate.allocInit(13bv32, 16bv32);call #Ultimate.allocInit(7bv32, 17bv32);call write~init~intINTTYPE1(44bv8, 17bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(77bv8, 17bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(101bv8, 17bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(116bv8, 17bv32, 3bv32, 1bv32);call write~init~intINTTYPE1(104bv8, 17bv32, 4bv32, 1bv32);call write~init~intINTTYPE1(58bv8, 17bv32, 5bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 17bv32, 6bv32, 1bv32);call #Ultimate.allocInit(5bv32, 18bv32);call write~init~intINTTYPE1(67bv8, 18bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(82bv8, 18bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(73bv8, 18bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(84bv8, 18bv32, 3bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 18bv32, 4bv32, 1bv32);call #Ultimate.allocInit(3bv32, 19bv32);call write~init~intINTTYPE1(79bv8, 19bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(75bv8, 19bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 19bv32, 2bv32, 1bv32);call #Ultimate.allocInit(2bv32, 20bv32);call write~init~intINTTYPE1(41bv8, 20bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 20bv32, 1bv32, 1bv32);call #Ultimate.allocInit(13bv32, 21bv32);call #Ultimate.allocInit(3bv32, 22bv32);call write~init~intINTTYPE1(79bv8, 22bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(110bv8, 22bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 22bv32, 2bv32, 1bv32);call #Ultimate.allocInit(4bv32, 23bv32);call write~init~intINTTYPE1(79bv8, 23bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(102bv8, 23bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(102bv8, 23bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 23bv32, 3bv32, 1bv32);call #Ultimate.allocInit(7bv32, 24bv32);call write~init~intINTTYPE1(44bv8, 24bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(80bv8, 24bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(117bv8, 24bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(109bv8, 24bv32, 3bv32, 1bv32);call write~init~intINTTYPE1(112bv8, 24bv32, 4bv32, 1bv32);call write~init~intINTTYPE1(58bv8, 24bv32, 5bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 24bv32, 6bv32, 1bv32);call #Ultimate.allocInit(3bv32, 25bv32);call write~init~intINTTYPE1(79bv8, 25bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(110bv8, 25bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 25bv32, 2bv32, 1bv32);call #Ultimate.allocInit(4bv32, 26bv32);call write~init~intINTTYPE1(79bv8, 26bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(102bv8, 26bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(102bv8, 26bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 26bv32, 3bv32, 1bv32);call #Ultimate.allocInit(3bv32, 27bv32);call write~init~intINTTYPE1(41bv8, 27bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(32bv8, 27bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 27bv32, 2bv32, 1bv32);call #Ultimate.allocInit(2bv32, 28bv32);call write~init~intINTTYPE1(10bv8, 28bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 28bv32, 1bv32, 1bv32);~head~0.base, ~head~0.offset := 0bv32, 0bv32;~cleanupTimeShifts~0 := 4bv32;~waterLevel~0 := 1bv32;~methaneLevelCritical~0 := 0bv32;~pumpRunning~0 := 0bv32;~systemActive~0 := 1bv32; {637#true} is VALID [2022-02-20 18:08:57,912 INFO L290 TraceCheckUtils]: 1: Hoare triple {637#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret31#1, main_~retValue_acc~5#1, main_~tmp~4#1;havoc main_~retValue_acc~5#1;havoc main_~tmp~4#1;assume { :begin_inline_select_helpers } true; {637#true} is VALID [2022-02-20 18:08:57,912 INFO L290 TraceCheckUtils]: 2: Hoare triple {637#true} assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; {637#true} is VALID [2022-02-20 18:08:57,913 INFO L290 TraceCheckUtils]: 3: Hoare triple {637#true} assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~1#1;havoc valid_product_~retValue_acc~1#1;valid_product_~retValue_acc~1#1 := 1bv32;valid_product_#res#1 := valid_product_~retValue_acc~1#1; {637#true} is VALID [2022-02-20 18:08:57,913 INFO L290 TraceCheckUtils]: 4: Hoare triple {637#true} main_#t~ret31#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;main_~tmp~4#1 := main_#t~ret31#1;havoc main_#t~ret31#1; {637#true} is VALID [2022-02-20 18:08:57,913 INFO L290 TraceCheckUtils]: 5: Hoare triple {637#true} assume 0bv32 != main_~tmp~4#1;assume { :begin_inline_setup } true; {637#true} is VALID [2022-02-20 18:08:57,913 INFO L290 TraceCheckUtils]: 6: Hoare triple {637#true} assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;havoc test_#t~nondet37#1, test_#t~nondet38#1, test_#t~nondet39#1, test_#t~nondet40#1, test_~splverifierCounter~0#1, test_~tmp~5#1, test_~tmp___0~1#1, test_~tmp___1~1#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~5#1;havoc test_~tmp___0~1#1;havoc test_~tmp___1~1#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0bv32; {660#(= |ULTIMATE.start_test_~splverifierCounter~0#1| (_ bv0 32))} is VALID [2022-02-20 18:08:57,914 INFO L290 TraceCheckUtils]: 7: Hoare triple {660#(= |ULTIMATE.start_test_~splverifierCounter~0#1| (_ bv0 32))} assume !false; {660#(= |ULTIMATE.start_test_~splverifierCounter~0#1| (_ bv0 32))} is VALID [2022-02-20 18:08:57,914 INFO L290 TraceCheckUtils]: 8: Hoare triple {660#(= |ULTIMATE.start_test_~splverifierCounter~0#1| (_ bv0 32))} assume !~bvslt32(test_~splverifierCounter~0#1, 4bv32); {638#false} is VALID [2022-02-20 18:08:57,914 INFO L272 TraceCheckUtils]: 9: Hoare triple {638#false} call cleanup(); {638#false} is VALID [2022-02-20 18:08:57,915 INFO L290 TraceCheckUtils]: 10: Hoare triple {638#false} havoc ~i~0;havoc ~__cil_tmp2~0; {638#false} is VALID [2022-02-20 18:08:57,915 INFO L272 TraceCheckUtils]: 11: Hoare triple {638#false} call timeShift(); {638#false} is VALID [2022-02-20 18:08:57,915 INFO L290 TraceCheckUtils]: 12: Hoare triple {638#false} assume !(0bv32 != ~pumpRunning~0); {638#false} is VALID [2022-02-20 18:08:57,915 INFO L290 TraceCheckUtils]: 13: Hoare triple {638#false} assume !(0bv32 != ~systemActive~0); {638#false} is VALID [2022-02-20 18:08:57,915 INFO L290 TraceCheckUtils]: 14: Hoare triple {638#false} assume { :begin_inline___utac_acc__Specification3_spec__1 } true;havoc __utac_acc__Specification3_spec__1_#t~ret5#1, __utac_acc__Specification3_spec__1_#t~ret6#1, __utac_acc__Specification3_spec__1_#t~ret7#1, __utac_acc__Specification3_spec__1_~tmp~0#1, __utac_acc__Specification3_spec__1_~tmp___0~0#1, __utac_acc__Specification3_spec__1_~tmp___1~0#1;havoc __utac_acc__Specification3_spec__1_~tmp~0#1;havoc __utac_acc__Specification3_spec__1_~tmp___0~0#1;havoc __utac_acc__Specification3_spec__1_~tmp___1~0#1; {638#false} is VALID [2022-02-20 18:08:57,915 INFO L272 TraceCheckUtils]: 15: Hoare triple {638#false} call __utac_acc__Specification3_spec__1_#t~ret5#1 := isMethaneLevelCritical(); {638#false} is VALID [2022-02-20 18:08:57,916 INFO L290 TraceCheckUtils]: 16: Hoare triple {638#false} havoc ~retValue_acc~6;~retValue_acc~6 := ~methaneLevelCritical~0;#res := ~retValue_acc~6; {638#false} is VALID [2022-02-20 18:08:57,916 INFO L290 TraceCheckUtils]: 17: Hoare triple {638#false} assume true; {638#false} is VALID [2022-02-20 18:08:57,916 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {638#false} {638#false} #216#return; {638#false} is VALID [2022-02-20 18:08:57,916 INFO L290 TraceCheckUtils]: 19: Hoare triple {638#false} __utac_acc__Specification3_spec__1_~tmp~0#1 := __utac_acc__Specification3_spec__1_#t~ret5#1;havoc __utac_acc__Specification3_spec__1_#t~ret5#1; {638#false} is VALID [2022-02-20 18:08:57,916 INFO L290 TraceCheckUtils]: 20: Hoare triple {638#false} assume !(0bv32 != __utac_acc__Specification3_spec__1_~tmp~0#1);assume { :begin_inline_getWaterLevel } true;havoc getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~7#1;havoc getWaterLevel_~retValue_acc~7#1;getWaterLevel_~retValue_acc~7#1 := ~waterLevel~0;getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~7#1; {638#false} is VALID [2022-02-20 18:08:57,917 INFO L290 TraceCheckUtils]: 21: Hoare triple {638#false} __utac_acc__Specification3_spec__1_#t~ret6#1 := getWaterLevel_#res#1;assume { :end_inline_getWaterLevel } true;__utac_acc__Specification3_spec__1_~tmp___0~0#1 := __utac_acc__Specification3_spec__1_#t~ret6#1;havoc __utac_acc__Specification3_spec__1_#t~ret6#1; {638#false} is VALID [2022-02-20 18:08:57,917 INFO L290 TraceCheckUtils]: 22: Hoare triple {638#false} assume 2bv32 == __utac_acc__Specification3_spec__1_~tmp___0~0#1;assume { :begin_inline_isPumpRunning } true;havoc isPumpRunning_#res#1;havoc isPumpRunning_~retValue_acc~10#1;havoc isPumpRunning_~retValue_acc~10#1;isPumpRunning_~retValue_acc~10#1 := ~pumpRunning~0;isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~10#1; {638#false} is VALID [2022-02-20 18:08:57,917 INFO L290 TraceCheckUtils]: 23: Hoare triple {638#false} __utac_acc__Specification3_spec__1_#t~ret7#1 := isPumpRunning_#res#1;assume { :end_inline_isPumpRunning } true;__utac_acc__Specification3_spec__1_~tmp___1~0#1 := __utac_acc__Specification3_spec__1_#t~ret7#1;havoc __utac_acc__Specification3_spec__1_#t~ret7#1; {638#false} is VALID [2022-02-20 18:08:57,917 INFO L290 TraceCheckUtils]: 24: Hoare triple {638#false} assume !(0bv32 != __utac_acc__Specification3_spec__1_~tmp___1~0#1);assume { :begin_inline___automaton_fail } true; {638#false} is VALID [2022-02-20 18:08:57,917 INFO L290 TraceCheckUtils]: 25: Hoare triple {638#false} assume !false; {638#false} is VALID [2022-02-20 18:08:57,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:08:57,918 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 18:08:57,918 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 18:08:57,918 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1836037922] [2022-02-20 18:08:57,918 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1836037922] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:08:57,918 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:08:57,918 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:08:57,919 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118367408] [2022-02-20 18:08:57,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:08:57,920 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-02-20 18:08:57,920 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:08:57,920 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:08:57,944 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:08:57,945 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:08:57,945 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 18:08:57,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:08:57,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:08:57,946 INFO L87 Difference]: Start difference. First operand 73 states and 93 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:08:58,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:08:58,053 INFO L93 Difference]: Finished difference Result 108 states and 136 transitions. [2022-02-20 18:08:58,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:08:58,053 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-02-20 18:08:58,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:08:58,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:08:58,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 136 transitions. [2022-02-20 18:08:58,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:08:58,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 136 transitions. [2022-02-20 18:08:58,058 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 136 transitions. [2022-02-20 18:08:58,182 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:08:58,184 INFO L225 Difference]: With dead ends: 108 [2022-02-20 18:08:58,184 INFO L226 Difference]: Without dead ends: 64 [2022-02-20 18:08:58,185 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:08:58,185 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 16 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:08:58,186 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 139 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:08:58,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-02-20 18:08:58,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-02-20 18:08:58,190 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:08:58,190 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 64 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 55 states have internal predecessors, (65), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 18:08:58,191 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 64 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 55 states have internal predecessors, (65), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 18:08:58,191 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 64 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 55 states have internal predecessors, (65), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 18:08:58,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:08:58,193 INFO L93 Difference]: Finished difference Result 64 states and 81 transitions. [2022-02-20 18:08:58,193 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 81 transitions. [2022-02-20 18:08:58,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:08:58,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:08:58,194 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 55 states have internal predecessors, (65), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) Second operand 64 states. [2022-02-20 18:08:58,195 INFO L87 Difference]: Start difference. First operand has 64 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 55 states have internal predecessors, (65), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) Second operand 64 states. [2022-02-20 18:08:58,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:08:58,196 INFO L93 Difference]: Finished difference Result 64 states and 81 transitions. [2022-02-20 18:08:58,197 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 81 transitions. [2022-02-20 18:08:58,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:08:58,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:08:58,197 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:08:58,197 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:08:58,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 55 states have internal predecessors, (65), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 18:08:58,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 81 transitions. [2022-02-20 18:08:58,199 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 81 transitions. Word has length 26 [2022-02-20 18:08:58,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:08:58,200 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 81 transitions. [2022-02-20 18:08:58,200 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:08:58,200 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 81 transitions. [2022-02-20 18:08:58,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 18:08:58,201 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:08:58,201 INFO L514 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] [2022-02-20 18:08:58,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-02-20 18:08:58,407 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 18:08:58,407 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:08:58,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:08:58,408 INFO L85 PathProgramCache]: Analyzing trace with hash 755375039, now seen corresponding path program 1 times [2022-02-20 18:08:58,408 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 18:08:58,408 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1988986558] [2022-02-20 18:08:58,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:08:58,409 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 18:08:58,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 18:08:58,410 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 18:08:58,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-20 18:08:58,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:08:58,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 18:08:58,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:08:58,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:08:58,605 INFO L290 TraceCheckUtils]: 0: Hoare triple {1091#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(31bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);call #Ultimate.allocInit(30bv32, 4bv32);call #Ultimate.allocInit(9bv32, 5bv32);call #Ultimate.allocInit(21bv32, 6bv32);call #Ultimate.allocInit(30bv32, 7bv32);call #Ultimate.allocInit(9bv32, 8bv32);call #Ultimate.allocInit(21bv32, 9bv32);call #Ultimate.allocInit(30bv32, 10bv32);call #Ultimate.allocInit(9bv32, 11bv32);call #Ultimate.allocInit(25bv32, 12bv32);call #Ultimate.allocInit(30bv32, 13bv32);call #Ultimate.allocInit(9bv32, 14bv32);call #Ultimate.allocInit(25bv32, 15bv32);call #Ultimate.allocInit(13bv32, 16bv32);call #Ultimate.allocInit(7bv32, 17bv32);call write~init~intINTTYPE1(44bv8, 17bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(77bv8, 17bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(101bv8, 17bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(116bv8, 17bv32, 3bv32, 1bv32);call write~init~intINTTYPE1(104bv8, 17bv32, 4bv32, 1bv32);call write~init~intINTTYPE1(58bv8, 17bv32, 5bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 17bv32, 6bv32, 1bv32);call #Ultimate.allocInit(5bv32, 18bv32);call write~init~intINTTYPE1(67bv8, 18bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(82bv8, 18bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(73bv8, 18bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(84bv8, 18bv32, 3bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 18bv32, 4bv32, 1bv32);call #Ultimate.allocInit(3bv32, 19bv32);call write~init~intINTTYPE1(79bv8, 19bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(75bv8, 19bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 19bv32, 2bv32, 1bv32);call #Ultimate.allocInit(2bv32, 20bv32);call write~init~intINTTYPE1(41bv8, 20bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 20bv32, 1bv32, 1bv32);call #Ultimate.allocInit(13bv32, 21bv32);call #Ultimate.allocInit(3bv32, 22bv32);call write~init~intINTTYPE1(79bv8, 22bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(110bv8, 22bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 22bv32, 2bv32, 1bv32);call #Ultimate.allocInit(4bv32, 23bv32);call write~init~intINTTYPE1(79bv8, 23bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(102bv8, 23bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(102bv8, 23bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 23bv32, 3bv32, 1bv32);call #Ultimate.allocInit(7bv32, 24bv32);call write~init~intINTTYPE1(44bv8, 24bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(80bv8, 24bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(117bv8, 24bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(109bv8, 24bv32, 3bv32, 1bv32);call write~init~intINTTYPE1(112bv8, 24bv32, 4bv32, 1bv32);call write~init~intINTTYPE1(58bv8, 24bv32, 5bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 24bv32, 6bv32, 1bv32);call #Ultimate.allocInit(3bv32, 25bv32);call write~init~intINTTYPE1(79bv8, 25bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(110bv8, 25bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 25bv32, 2bv32, 1bv32);call #Ultimate.allocInit(4bv32, 26bv32);call write~init~intINTTYPE1(79bv8, 26bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(102bv8, 26bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(102bv8, 26bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 26bv32, 3bv32, 1bv32);call #Ultimate.allocInit(3bv32, 27bv32);call write~init~intINTTYPE1(41bv8, 27bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(32bv8, 27bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 27bv32, 2bv32, 1bv32);call #Ultimate.allocInit(2bv32, 28bv32);call write~init~intINTTYPE1(10bv8, 28bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 28bv32, 1bv32, 1bv32);~head~0.base, ~head~0.offset := 0bv32, 0bv32;~cleanupTimeShifts~0 := 4bv32;~waterLevel~0 := 1bv32;~methaneLevelCritical~0 := 0bv32;~pumpRunning~0 := 0bv32;~systemActive~0 := 1bv32; {1096#(= ~systemActive~0 (_ bv1 32))} is VALID [2022-02-20 18:08:58,606 INFO L290 TraceCheckUtils]: 1: Hoare triple {1096#(= ~systemActive~0 (_ bv1 32))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret31#1, main_~retValue_acc~5#1, main_~tmp~4#1;havoc main_~retValue_acc~5#1;havoc main_~tmp~4#1;assume { :begin_inline_select_helpers } true; {1096#(= ~systemActive~0 (_ bv1 32))} is VALID [2022-02-20 18:08:58,607 INFO L290 TraceCheckUtils]: 2: Hoare triple {1096#(= ~systemActive~0 (_ bv1 32))} assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; {1096#(= ~systemActive~0 (_ bv1 32))} is VALID [2022-02-20 18:08:58,607 INFO L290 TraceCheckUtils]: 3: Hoare triple {1096#(= ~systemActive~0 (_ bv1 32))} assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~1#1;havoc valid_product_~retValue_acc~1#1;valid_product_~retValue_acc~1#1 := 1bv32;valid_product_#res#1 := valid_product_~retValue_acc~1#1; {1096#(= ~systemActive~0 (_ bv1 32))} is VALID [2022-02-20 18:08:58,608 INFO L290 TraceCheckUtils]: 4: Hoare triple {1096#(= ~systemActive~0 (_ bv1 32))} main_#t~ret31#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;main_~tmp~4#1 := main_#t~ret31#1;havoc main_#t~ret31#1; {1096#(= ~systemActive~0 (_ bv1 32))} is VALID [2022-02-20 18:08:58,608 INFO L290 TraceCheckUtils]: 5: Hoare triple {1096#(= ~systemActive~0 (_ bv1 32))} assume 0bv32 != main_~tmp~4#1;assume { :begin_inline_setup } true; {1096#(= ~systemActive~0 (_ bv1 32))} is VALID [2022-02-20 18:08:58,609 INFO L290 TraceCheckUtils]: 6: Hoare triple {1096#(= ~systemActive~0 (_ bv1 32))} assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;havoc test_#t~nondet37#1, test_#t~nondet38#1, test_#t~nondet39#1, test_#t~nondet40#1, test_~splverifierCounter~0#1, test_~tmp~5#1, test_~tmp___0~1#1, test_~tmp___1~1#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~5#1;havoc test_~tmp___0~1#1;havoc test_~tmp___1~1#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0bv32; {1096#(= ~systemActive~0 (_ bv1 32))} is VALID [2022-02-20 18:08:58,609 INFO L290 TraceCheckUtils]: 7: Hoare triple {1096#(= ~systemActive~0 (_ bv1 32))} assume !false; {1096#(= ~systemActive~0 (_ bv1 32))} is VALID [2022-02-20 18:08:58,609 INFO L290 TraceCheckUtils]: 8: Hoare triple {1096#(= ~systemActive~0 (_ bv1 32))} assume ~bvslt32(test_~splverifierCounter~0#1, 4bv32); {1096#(= ~systemActive~0 (_ bv1 32))} is VALID [2022-02-20 18:08:58,609 INFO L290 TraceCheckUtils]: 9: Hoare triple {1096#(= ~systemActive~0 (_ bv1 32))} test_~tmp~5#1 := test_#t~nondet37#1;havoc test_#t~nondet37#1; {1096#(= ~systemActive~0 (_ bv1 32))} is VALID [2022-02-20 18:08:58,610 INFO L290 TraceCheckUtils]: 10: Hoare triple {1096#(= ~systemActive~0 (_ bv1 32))} assume !(0bv32 != test_~tmp~5#1); {1096#(= ~systemActive~0 (_ bv1 32))} is VALID [2022-02-20 18:08:58,610 INFO L290 TraceCheckUtils]: 11: Hoare triple {1096#(= ~systemActive~0 (_ bv1 32))} test_~tmp___0~1#1 := test_#t~nondet38#1;havoc test_#t~nondet38#1; {1096#(= ~systemActive~0 (_ bv1 32))} is VALID [2022-02-20 18:08:58,610 INFO L290 TraceCheckUtils]: 12: Hoare triple {1096#(= ~systemActive~0 (_ bv1 32))} assume !(0bv32 != test_~tmp___0~1#1); {1096#(= ~systemActive~0 (_ bv1 32))} is VALID [2022-02-20 18:08:58,611 INFO L290 TraceCheckUtils]: 13: Hoare triple {1096#(= ~systemActive~0 (_ bv1 32))} test_~tmp___2~0#1 := test_#t~nondet39#1;havoc test_#t~nondet39#1; {1096#(= ~systemActive~0 (_ bv1 32))} is VALID [2022-02-20 18:08:58,611 INFO L290 TraceCheckUtils]: 14: Hoare triple {1096#(= ~systemActive~0 (_ bv1 32))} assume 0bv32 != test_~tmp___2~0#1; {1096#(= ~systemActive~0 (_ bv1 32))} is VALID [2022-02-20 18:08:58,611 INFO L272 TraceCheckUtils]: 15: Hoare triple {1096#(= ~systemActive~0 (_ bv1 32))} call timeShift(); {1096#(= ~systemActive~0 (_ bv1 32))} is VALID [2022-02-20 18:08:58,612 INFO L290 TraceCheckUtils]: 16: Hoare triple {1096#(= ~systemActive~0 (_ bv1 32))} assume !(0bv32 != ~pumpRunning~0); {1096#(= ~systemActive~0 (_ bv1 32))} is VALID [2022-02-20 18:08:58,612 INFO L290 TraceCheckUtils]: 17: Hoare triple {1096#(= ~systemActive~0 (_ bv1 32))} assume !(0bv32 != ~systemActive~0); {1092#false} is VALID [2022-02-20 18:08:58,612 INFO L290 TraceCheckUtils]: 18: Hoare triple {1092#false} assume { :begin_inline___utac_acc__Specification3_spec__1 } true;havoc __utac_acc__Specification3_spec__1_#t~ret5#1, __utac_acc__Specification3_spec__1_#t~ret6#1, __utac_acc__Specification3_spec__1_#t~ret7#1, __utac_acc__Specification3_spec__1_~tmp~0#1, __utac_acc__Specification3_spec__1_~tmp___0~0#1, __utac_acc__Specification3_spec__1_~tmp___1~0#1;havoc __utac_acc__Specification3_spec__1_~tmp~0#1;havoc __utac_acc__Specification3_spec__1_~tmp___0~0#1;havoc __utac_acc__Specification3_spec__1_~tmp___1~0#1; {1092#false} is VALID [2022-02-20 18:08:58,612 INFO L272 TraceCheckUtils]: 19: Hoare triple {1092#false} call __utac_acc__Specification3_spec__1_#t~ret5#1 := isMethaneLevelCritical(); {1092#false} is VALID [2022-02-20 18:08:58,612 INFO L290 TraceCheckUtils]: 20: Hoare triple {1092#false} havoc ~retValue_acc~6;~retValue_acc~6 := ~methaneLevelCritical~0;#res := ~retValue_acc~6; {1092#false} is VALID [2022-02-20 18:08:58,613 INFO L290 TraceCheckUtils]: 21: Hoare triple {1092#false} assume true; {1092#false} is VALID [2022-02-20 18:08:58,613 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1092#false} {1092#false} #216#return; {1092#false} is VALID [2022-02-20 18:08:58,613 INFO L290 TraceCheckUtils]: 23: Hoare triple {1092#false} __utac_acc__Specification3_spec__1_~tmp~0#1 := __utac_acc__Specification3_spec__1_#t~ret5#1;havoc __utac_acc__Specification3_spec__1_#t~ret5#1; {1092#false} is VALID [2022-02-20 18:08:58,613 INFO L290 TraceCheckUtils]: 24: Hoare triple {1092#false} assume !(0bv32 != __utac_acc__Specification3_spec__1_~tmp~0#1);assume { :begin_inline_getWaterLevel } true;havoc getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~7#1;havoc getWaterLevel_~retValue_acc~7#1;getWaterLevel_~retValue_acc~7#1 := ~waterLevel~0;getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~7#1; {1092#false} is VALID [2022-02-20 18:08:58,613 INFO L290 TraceCheckUtils]: 25: Hoare triple {1092#false} __utac_acc__Specification3_spec__1_#t~ret6#1 := getWaterLevel_#res#1;assume { :end_inline_getWaterLevel } true;__utac_acc__Specification3_spec__1_~tmp___0~0#1 := __utac_acc__Specification3_spec__1_#t~ret6#1;havoc __utac_acc__Specification3_spec__1_#t~ret6#1; {1092#false} is VALID [2022-02-20 18:08:58,613 INFO L290 TraceCheckUtils]: 26: Hoare triple {1092#false} assume 2bv32 == __utac_acc__Specification3_spec__1_~tmp___0~0#1;assume { :begin_inline_isPumpRunning } true;havoc isPumpRunning_#res#1;havoc isPumpRunning_~retValue_acc~10#1;havoc isPumpRunning_~retValue_acc~10#1;isPumpRunning_~retValue_acc~10#1 := ~pumpRunning~0;isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~10#1; {1092#false} is VALID [2022-02-20 18:08:58,613 INFO L290 TraceCheckUtils]: 27: Hoare triple {1092#false} __utac_acc__Specification3_spec__1_#t~ret7#1 := isPumpRunning_#res#1;assume { :end_inline_isPumpRunning } true;__utac_acc__Specification3_spec__1_~tmp___1~0#1 := __utac_acc__Specification3_spec__1_#t~ret7#1;havoc __utac_acc__Specification3_spec__1_#t~ret7#1; {1092#false} is VALID [2022-02-20 18:08:58,613 INFO L290 TraceCheckUtils]: 28: Hoare triple {1092#false} assume !(0bv32 != __utac_acc__Specification3_spec__1_~tmp___1~0#1);assume { :begin_inline___automaton_fail } true; {1092#false} is VALID [2022-02-20 18:08:58,613 INFO L290 TraceCheckUtils]: 29: Hoare triple {1092#false} assume !false; {1092#false} is VALID [2022-02-20 18:08:58,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:08:58,613 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 18:08:58,614 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 18:08:58,614 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1988986558] [2022-02-20 18:08:58,614 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1988986558] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:08:58,614 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:08:58,614 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 18:08:58,614 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188768021] [2022-02-20 18:08:58,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:08:58,615 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-02-20 18:08:58,616 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:08:58,616 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:08:58,641 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:08:58,641 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:08:58,641 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 18:08:58,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:08:58,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:08:58,642 INFO L87 Difference]: Start difference. First operand 64 states and 81 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:08:58,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:08:58,777 INFO L93 Difference]: Finished difference Result 177 states and 229 transitions. [2022-02-20 18:08:58,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:08:58,777 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-02-20 18:08:58,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:08:58,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:08:58,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 229 transitions. [2022-02-20 18:08:58,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:08:58,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 229 transitions. [2022-02-20 18:08:58,782 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 229 transitions. [2022-02-20 18:08:58,944 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 229 edges. 229 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:08:58,946 INFO L225 Difference]: With dead ends: 177 [2022-02-20 18:08:58,946 INFO L226 Difference]: Without dead ends: 120 [2022-02-20 18:08:58,947 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:08:58,948 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 61 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:08:58,948 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 175 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:08:58,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-02-20 18:08:58,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 117. [2022-02-20 18:08:58,954 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:08:58,955 INFO L82 GeneralOperation]: Start isEquivalent. First operand 120 states. Second operand has 117 states, 88 states have (on average 1.3522727272727273) internal successors, (119), 99 states have internal predecessors, (119), 16 states have call successors, (16), 12 states have call predecessors, (16), 12 states have return successors, (16), 11 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 18:08:58,955 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand has 117 states, 88 states have (on average 1.3522727272727273) internal successors, (119), 99 states have internal predecessors, (119), 16 states have call successors, (16), 12 states have call predecessors, (16), 12 states have return successors, (16), 11 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 18:08:58,955 INFO L87 Difference]: Start difference. First operand 120 states. Second operand has 117 states, 88 states have (on average 1.3522727272727273) internal successors, (119), 99 states have internal predecessors, (119), 16 states have call successors, (16), 12 states have call predecessors, (16), 12 states have return successors, (16), 11 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 18:08:58,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:08:58,958 INFO L93 Difference]: Finished difference Result 120 states and 153 transitions. [2022-02-20 18:08:58,958 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 153 transitions. [2022-02-20 18:08:58,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:08:58,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:08:58,959 INFO L74 IsIncluded]: Start isIncluded. First operand has 117 states, 88 states have (on average 1.3522727272727273) internal successors, (119), 99 states have internal predecessors, (119), 16 states have call successors, (16), 12 states have call predecessors, (16), 12 states have return successors, (16), 11 states have call predecessors, (16), 16 states have call successors, (16) Second operand 120 states. [2022-02-20 18:08:58,960 INFO L87 Difference]: Start difference. First operand has 117 states, 88 states have (on average 1.3522727272727273) internal successors, (119), 99 states have internal predecessors, (119), 16 states have call successors, (16), 12 states have call predecessors, (16), 12 states have return successors, (16), 11 states have call predecessors, (16), 16 states have call successors, (16) Second operand 120 states. [2022-02-20 18:08:58,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:08:58,975 INFO L93 Difference]: Finished difference Result 120 states and 153 transitions. [2022-02-20 18:08:58,975 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 153 transitions. [2022-02-20 18:08:58,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:08:58,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:08:58,975 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:08:58,975 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:08:58,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 88 states have (on average 1.3522727272727273) internal successors, (119), 99 states have internal predecessors, (119), 16 states have call successors, (16), 12 states have call predecessors, (16), 12 states have return successors, (16), 11 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 18:08:58,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 151 transitions. [2022-02-20 18:08:58,979 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 151 transitions. Word has length 30 [2022-02-20 18:08:58,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:08:58,979 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 151 transitions. [2022-02-20 18:08:58,979 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:08:58,979 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 151 transitions. [2022-02-20 18:08:58,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-02-20 18:08:58,980 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:08:58,980 INFO L514 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, 1] [2022-02-20 18:08:58,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-02-20 18:08:59,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 18:08:59,187 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:08:59,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:08:59,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1326960786, now seen corresponding path program 1 times [2022-02-20 18:08:59,188 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 18:08:59,188 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1227611965] [2022-02-20 18:08:59,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:08:59,188 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 18:08:59,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 18:08:59,189 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 18:08:59,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-02-20 18:08:59,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:08:59,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 18:08:59,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:08:59,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:08:59,387 INFO L290 TraceCheckUtils]: 0: Hoare triple {1838#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(31bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);call #Ultimate.allocInit(30bv32, 4bv32);call #Ultimate.allocInit(9bv32, 5bv32);call #Ultimate.allocInit(21bv32, 6bv32);call #Ultimate.allocInit(30bv32, 7bv32);call #Ultimate.allocInit(9bv32, 8bv32);call #Ultimate.allocInit(21bv32, 9bv32);call #Ultimate.allocInit(30bv32, 10bv32);call #Ultimate.allocInit(9bv32, 11bv32);call #Ultimate.allocInit(25bv32, 12bv32);call #Ultimate.allocInit(30bv32, 13bv32);call #Ultimate.allocInit(9bv32, 14bv32);call #Ultimate.allocInit(25bv32, 15bv32);call #Ultimate.allocInit(13bv32, 16bv32);call #Ultimate.allocInit(7bv32, 17bv32);call write~init~intINTTYPE1(44bv8, 17bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(77bv8, 17bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(101bv8, 17bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(116bv8, 17bv32, 3bv32, 1bv32);call write~init~intINTTYPE1(104bv8, 17bv32, 4bv32, 1bv32);call write~init~intINTTYPE1(58bv8, 17bv32, 5bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 17bv32, 6bv32, 1bv32);call #Ultimate.allocInit(5bv32, 18bv32);call write~init~intINTTYPE1(67bv8, 18bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(82bv8, 18bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(73bv8, 18bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(84bv8, 18bv32, 3bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 18bv32, 4bv32, 1bv32);call #Ultimate.allocInit(3bv32, 19bv32);call write~init~intINTTYPE1(79bv8, 19bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(75bv8, 19bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 19bv32, 2bv32, 1bv32);call #Ultimate.allocInit(2bv32, 20bv32);call write~init~intINTTYPE1(41bv8, 20bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 20bv32, 1bv32, 1bv32);call #Ultimate.allocInit(13bv32, 21bv32);call #Ultimate.allocInit(3bv32, 22bv32);call write~init~intINTTYPE1(79bv8, 22bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(110bv8, 22bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 22bv32, 2bv32, 1bv32);call #Ultimate.allocInit(4bv32, 23bv32);call write~init~intINTTYPE1(79bv8, 23bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(102bv8, 23bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(102bv8, 23bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 23bv32, 3bv32, 1bv32);call #Ultimate.allocInit(7bv32, 24bv32);call write~init~intINTTYPE1(44bv8, 24bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(80bv8, 24bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(117bv8, 24bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(109bv8, 24bv32, 3bv32, 1bv32);call write~init~intINTTYPE1(112bv8, 24bv32, 4bv32, 1bv32);call write~init~intINTTYPE1(58bv8, 24bv32, 5bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 24bv32, 6bv32, 1bv32);call #Ultimate.allocInit(3bv32, 25bv32);call write~init~intINTTYPE1(79bv8, 25bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(110bv8, 25bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 25bv32, 2bv32, 1bv32);call #Ultimate.allocInit(4bv32, 26bv32);call write~init~intINTTYPE1(79bv8, 26bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(102bv8, 26bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(102bv8, 26bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 26bv32, 3bv32, 1bv32);call #Ultimate.allocInit(3bv32, 27bv32);call write~init~intINTTYPE1(41bv8, 27bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(32bv8, 27bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 27bv32, 2bv32, 1bv32);call #Ultimate.allocInit(2bv32, 28bv32);call write~init~intINTTYPE1(10bv8, 28bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 28bv32, 1bv32, 1bv32);~head~0.base, ~head~0.offset := 0bv32, 0bv32;~cleanupTimeShifts~0 := 4bv32;~waterLevel~0 := 1bv32;~methaneLevelCritical~0 := 0bv32;~pumpRunning~0 := 0bv32;~systemActive~0 := 1bv32; {1843#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:08:59,387 INFO L290 TraceCheckUtils]: 1: Hoare triple {1843#(= ~waterLevel~0 (_ bv1 32))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret31#1, main_~retValue_acc~5#1, main_~tmp~4#1;havoc main_~retValue_acc~5#1;havoc main_~tmp~4#1;assume { :begin_inline_select_helpers } true; {1843#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:08:59,388 INFO L290 TraceCheckUtils]: 2: Hoare triple {1843#(= ~waterLevel~0 (_ bv1 32))} assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; {1843#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:08:59,388 INFO L290 TraceCheckUtils]: 3: Hoare triple {1843#(= ~waterLevel~0 (_ bv1 32))} assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~1#1;havoc valid_product_~retValue_acc~1#1;valid_product_~retValue_acc~1#1 := 1bv32;valid_product_#res#1 := valid_product_~retValue_acc~1#1; {1843#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:08:59,389 INFO L290 TraceCheckUtils]: 4: Hoare triple {1843#(= ~waterLevel~0 (_ bv1 32))} main_#t~ret31#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;main_~tmp~4#1 := main_#t~ret31#1;havoc main_#t~ret31#1; {1843#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:08:59,389 INFO L290 TraceCheckUtils]: 5: Hoare triple {1843#(= ~waterLevel~0 (_ bv1 32))} assume 0bv32 != main_~tmp~4#1;assume { :begin_inline_setup } true; {1843#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:08:59,389 INFO L290 TraceCheckUtils]: 6: Hoare triple {1843#(= ~waterLevel~0 (_ bv1 32))} assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;havoc test_#t~nondet37#1, test_#t~nondet38#1, test_#t~nondet39#1, test_#t~nondet40#1, test_~splverifierCounter~0#1, test_~tmp~5#1, test_~tmp___0~1#1, test_~tmp___1~1#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~5#1;havoc test_~tmp___0~1#1;havoc test_~tmp___1~1#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0bv32; {1843#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:08:59,390 INFO L290 TraceCheckUtils]: 7: Hoare triple {1843#(= ~waterLevel~0 (_ bv1 32))} assume !false; {1843#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:08:59,390 INFO L290 TraceCheckUtils]: 8: Hoare triple {1843#(= ~waterLevel~0 (_ bv1 32))} assume ~bvslt32(test_~splverifierCounter~0#1, 4bv32); {1843#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:08:59,390 INFO L290 TraceCheckUtils]: 9: Hoare triple {1843#(= ~waterLevel~0 (_ bv1 32))} test_~tmp~5#1 := test_#t~nondet37#1;havoc test_#t~nondet37#1; {1843#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:08:59,390 INFO L290 TraceCheckUtils]: 10: Hoare triple {1843#(= ~waterLevel~0 (_ bv1 32))} assume !(0bv32 != test_~tmp~5#1); {1843#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:08:59,391 INFO L290 TraceCheckUtils]: 11: Hoare triple {1843#(= ~waterLevel~0 (_ bv1 32))} test_~tmp___0~1#1 := test_#t~nondet38#1;havoc test_#t~nondet38#1; {1843#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:08:59,391 INFO L290 TraceCheckUtils]: 12: Hoare triple {1843#(= ~waterLevel~0 (_ bv1 32))} assume !(0bv32 != test_~tmp___0~1#1); {1843#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:08:59,391 INFO L290 TraceCheckUtils]: 13: Hoare triple {1843#(= ~waterLevel~0 (_ bv1 32))} test_~tmp___2~0#1 := test_#t~nondet39#1;havoc test_#t~nondet39#1; {1843#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:08:59,392 INFO L290 TraceCheckUtils]: 14: Hoare triple {1843#(= ~waterLevel~0 (_ bv1 32))} assume 0bv32 != test_~tmp___2~0#1; {1843#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:08:59,392 INFO L272 TraceCheckUtils]: 15: Hoare triple {1843#(= ~waterLevel~0 (_ bv1 32))} call timeShift(); {1843#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:08:59,392 INFO L290 TraceCheckUtils]: 16: Hoare triple {1843#(= ~waterLevel~0 (_ bv1 32))} assume !(0bv32 != ~pumpRunning~0); {1843#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:08:59,393 INFO L290 TraceCheckUtils]: 17: Hoare triple {1843#(= ~waterLevel~0 (_ bv1 32))} assume 0bv32 != ~systemActive~0;assume { :begin_inline_processEnvironment } true;havoc processEnvironment_#t~ret41#1, processEnvironment_~tmp~6#1;havoc processEnvironment_~tmp~6#1; {1843#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:08:59,393 INFO L290 TraceCheckUtils]: 18: Hoare triple {1843#(= ~waterLevel~0 (_ bv1 32))} assume !(0bv32 != ~pumpRunning~0); {1843#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:08:59,393 INFO L272 TraceCheckUtils]: 19: Hoare triple {1843#(= ~waterLevel~0 (_ bv1 32))} call processEnvironment__wrappee__base(); {1843#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:08:59,394 INFO L290 TraceCheckUtils]: 20: Hoare triple {1843#(= ~waterLevel~0 (_ bv1 32))} assume true; {1843#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:08:59,394 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1843#(= ~waterLevel~0 (_ bv1 32))} {1843#(= ~waterLevel~0 (_ bv1 32))} #214#return; {1843#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:08:59,395 INFO L290 TraceCheckUtils]: 22: Hoare triple {1843#(= ~waterLevel~0 (_ bv1 32))} assume { :end_inline_processEnvironment } true; {1843#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:08:59,396 INFO L290 TraceCheckUtils]: 23: Hoare triple {1843#(= ~waterLevel~0 (_ bv1 32))} assume { :begin_inline___utac_acc__Specification3_spec__1 } true;havoc __utac_acc__Specification3_spec__1_#t~ret5#1, __utac_acc__Specification3_spec__1_#t~ret6#1, __utac_acc__Specification3_spec__1_#t~ret7#1, __utac_acc__Specification3_spec__1_~tmp~0#1, __utac_acc__Specification3_spec__1_~tmp___0~0#1, __utac_acc__Specification3_spec__1_~tmp___1~0#1;havoc __utac_acc__Specification3_spec__1_~tmp~0#1;havoc __utac_acc__Specification3_spec__1_~tmp___0~0#1;havoc __utac_acc__Specification3_spec__1_~tmp___1~0#1; {1843#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:08:59,397 INFO L272 TraceCheckUtils]: 24: Hoare triple {1843#(= ~waterLevel~0 (_ bv1 32))} call __utac_acc__Specification3_spec__1_#t~ret5#1 := isMethaneLevelCritical(); {1843#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:08:59,397 INFO L290 TraceCheckUtils]: 25: Hoare triple {1843#(= ~waterLevel~0 (_ bv1 32))} havoc ~retValue_acc~6;~retValue_acc~6 := ~methaneLevelCritical~0;#res := ~retValue_acc~6; {1843#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:08:59,398 INFO L290 TraceCheckUtils]: 26: Hoare triple {1843#(= ~waterLevel~0 (_ bv1 32))} assume true; {1843#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:08:59,398 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1843#(= ~waterLevel~0 (_ bv1 32))} {1843#(= ~waterLevel~0 (_ bv1 32))} #216#return; {1843#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:08:59,399 INFO L290 TraceCheckUtils]: 28: Hoare triple {1843#(= ~waterLevel~0 (_ bv1 32))} __utac_acc__Specification3_spec__1_~tmp~0#1 := __utac_acc__Specification3_spec__1_#t~ret5#1;havoc __utac_acc__Specification3_spec__1_#t~ret5#1; {1843#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:08:59,400 INFO L290 TraceCheckUtils]: 29: Hoare triple {1843#(= ~waterLevel~0 (_ bv1 32))} assume !(0bv32 != __utac_acc__Specification3_spec__1_~tmp~0#1);assume { :begin_inline_getWaterLevel } true;havoc getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~7#1;havoc getWaterLevel_~retValue_acc~7#1;getWaterLevel_~retValue_acc~7#1 := ~waterLevel~0;getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~7#1; {1931#(= |timeShift_getWaterLevel_#res#1| (_ bv1 32))} is VALID [2022-02-20 18:08:59,400 INFO L290 TraceCheckUtils]: 30: Hoare triple {1931#(= |timeShift_getWaterLevel_#res#1| (_ bv1 32))} __utac_acc__Specification3_spec__1_#t~ret6#1 := getWaterLevel_#res#1;assume { :end_inline_getWaterLevel } true;__utac_acc__Specification3_spec__1_~tmp___0~0#1 := __utac_acc__Specification3_spec__1_#t~ret6#1;havoc __utac_acc__Specification3_spec__1_#t~ret6#1; {1935#(= |timeShift___utac_acc__Specification3_spec__1_~tmp___0~0#1| (_ bv1 32))} is VALID [2022-02-20 18:08:59,401 INFO L290 TraceCheckUtils]: 31: Hoare triple {1935#(= |timeShift___utac_acc__Specification3_spec__1_~tmp___0~0#1| (_ bv1 32))} assume 2bv32 == __utac_acc__Specification3_spec__1_~tmp___0~0#1;assume { :begin_inline_isPumpRunning } true;havoc isPumpRunning_#res#1;havoc isPumpRunning_~retValue_acc~10#1;havoc isPumpRunning_~retValue_acc~10#1;isPumpRunning_~retValue_acc~10#1 := ~pumpRunning~0;isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~10#1; {1839#false} is VALID [2022-02-20 18:08:59,402 INFO L290 TraceCheckUtils]: 32: Hoare triple {1839#false} __utac_acc__Specification3_spec__1_#t~ret7#1 := isPumpRunning_#res#1;assume { :end_inline_isPumpRunning } true;__utac_acc__Specification3_spec__1_~tmp___1~0#1 := __utac_acc__Specification3_spec__1_#t~ret7#1;havoc __utac_acc__Specification3_spec__1_#t~ret7#1; {1839#false} is VALID [2022-02-20 18:08:59,402 INFO L290 TraceCheckUtils]: 33: Hoare triple {1839#false} assume !(0bv32 != __utac_acc__Specification3_spec__1_~tmp___1~0#1);assume { :begin_inline___automaton_fail } true; {1839#false} is VALID [2022-02-20 18:08:59,409 INFO L290 TraceCheckUtils]: 34: Hoare triple {1839#false} assume !false; {1839#false} is VALID [2022-02-20 18:08:59,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:08:59,409 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 18:08:59,409 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 18:08:59,409 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1227611965] [2022-02-20 18:08:59,412 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1227611965] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:08:59,412 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:08:59,412 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:08:59,412 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794361208] [2022-02-20 18:08:59,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:08:59,413 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2022-02-20 18:08:59,413 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:08:59,413 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 18:08:59,441 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:08:59,441 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:08:59,441 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 18:08:59,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:08:59,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:08:59,443 INFO L87 Difference]: Start difference. First operand 117 states and 151 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 18:08:59,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:08:59,674 INFO L93 Difference]: Finished difference Result 331 states and 440 transitions. [2022-02-20 18:08:59,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:08:59,674 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2022-02-20 18:08:59,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:08:59,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 18:08:59,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 229 transitions. [2022-02-20 18:08:59,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 18:08:59,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 229 transitions. [2022-02-20 18:08:59,689 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 229 transitions. [2022-02-20 18:08:59,838 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 229 edges. 229 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:08:59,843 INFO L225 Difference]: With dead ends: 331 [2022-02-20 18:08:59,843 INFO L226 Difference]: Without dead ends: 221 [2022-02-20 18:08:59,847 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:08:59,850 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 47 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:08:59,851 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 323 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:08:59,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-02-20 18:08:59,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 215. [2022-02-20 18:08:59,873 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:08:59,873 INFO L82 GeneralOperation]: Start isEquivalent. First operand 221 states. Second operand has 215 states, 160 states have (on average 1.3375) internal successors, (214), 179 states have internal predecessors, (214), 32 states have call successors, (32), 24 states have call predecessors, (32), 22 states have return successors, (34), 20 states have call predecessors, (34), 32 states have call successors, (34) [2022-02-20 18:08:59,874 INFO L74 IsIncluded]: Start isIncluded. First operand 221 states. Second operand has 215 states, 160 states have (on average 1.3375) internal successors, (214), 179 states have internal predecessors, (214), 32 states have call successors, (32), 24 states have call predecessors, (32), 22 states have return successors, (34), 20 states have call predecessors, (34), 32 states have call successors, (34) [2022-02-20 18:08:59,874 INFO L87 Difference]: Start difference. First operand 221 states. Second operand has 215 states, 160 states have (on average 1.3375) internal successors, (214), 179 states have internal predecessors, (214), 32 states have call successors, (32), 24 states have call predecessors, (32), 22 states have return successors, (34), 20 states have call predecessors, (34), 32 states have call successors, (34) [2022-02-20 18:08:59,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:08:59,880 INFO L93 Difference]: Finished difference Result 221 states and 286 transitions. [2022-02-20 18:08:59,880 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 286 transitions. [2022-02-20 18:08:59,881 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:08:59,881 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:08:59,881 INFO L74 IsIncluded]: Start isIncluded. First operand has 215 states, 160 states have (on average 1.3375) internal successors, (214), 179 states have internal predecessors, (214), 32 states have call successors, (32), 24 states have call predecessors, (32), 22 states have return successors, (34), 20 states have call predecessors, (34), 32 states have call successors, (34) Second operand 221 states. [2022-02-20 18:08:59,882 INFO L87 Difference]: Start difference. First operand has 215 states, 160 states have (on average 1.3375) internal successors, (214), 179 states have internal predecessors, (214), 32 states have call successors, (32), 24 states have call predecessors, (32), 22 states have return successors, (34), 20 states have call predecessors, (34), 32 states have call successors, (34) Second operand 221 states. [2022-02-20 18:08:59,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:08:59,888 INFO L93 Difference]: Finished difference Result 221 states and 286 transitions. [2022-02-20 18:08:59,888 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 286 transitions. [2022-02-20 18:08:59,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:08:59,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:08:59,888 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:08:59,888 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:08:59,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 160 states have (on average 1.3375) internal successors, (214), 179 states have internal predecessors, (214), 32 states have call successors, (32), 24 states have call predecessors, (32), 22 states have return successors, (34), 20 states have call predecessors, (34), 32 states have call successors, (34) [2022-02-20 18:08:59,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 280 transitions. [2022-02-20 18:08:59,895 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 280 transitions. Word has length 35 [2022-02-20 18:08:59,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:08:59,895 INFO L470 AbstractCegarLoop]: Abstraction has 215 states and 280 transitions. [2022-02-20 18:08:59,895 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 18:08:59,895 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 280 transitions. [2022-02-20 18:08:59,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 18:08:59,898 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:08:59,898 INFO L514 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, 1, 1, 1] [2022-02-20 18:08:59,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-02-20 18:09:00,104 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 18:09:00,105 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:09:00,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:09:00,105 INFO L85 PathProgramCache]: Analyzing trace with hash 942143177, now seen corresponding path program 1 times [2022-02-20 18:09:00,105 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 18:09:00,105 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [698031195] [2022-02-20 18:09:00,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:09:00,106 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 18:09:00,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 18:09:00,107 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 18:09:00,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-02-20 18:09:00,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:09:00,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 18:09:00,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:09:00,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:09:00,237 INFO L290 TraceCheckUtils]: 0: Hoare triple {3166#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(31bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);call #Ultimate.allocInit(30bv32, 4bv32);call #Ultimate.allocInit(9bv32, 5bv32);call #Ultimate.allocInit(21bv32, 6bv32);call #Ultimate.allocInit(30bv32, 7bv32);call #Ultimate.allocInit(9bv32, 8bv32);call #Ultimate.allocInit(21bv32, 9bv32);call #Ultimate.allocInit(30bv32, 10bv32);call #Ultimate.allocInit(9bv32, 11bv32);call #Ultimate.allocInit(25bv32, 12bv32);call #Ultimate.allocInit(30bv32, 13bv32);call #Ultimate.allocInit(9bv32, 14bv32);call #Ultimate.allocInit(25bv32, 15bv32);call #Ultimate.allocInit(13bv32, 16bv32);call #Ultimate.allocInit(7bv32, 17bv32);call write~init~intINTTYPE1(44bv8, 17bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(77bv8, 17bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(101bv8, 17bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(116bv8, 17bv32, 3bv32, 1bv32);call write~init~intINTTYPE1(104bv8, 17bv32, 4bv32, 1bv32);call write~init~intINTTYPE1(58bv8, 17bv32, 5bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 17bv32, 6bv32, 1bv32);call #Ultimate.allocInit(5bv32, 18bv32);call write~init~intINTTYPE1(67bv8, 18bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(82bv8, 18bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(73bv8, 18bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(84bv8, 18bv32, 3bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 18bv32, 4bv32, 1bv32);call #Ultimate.allocInit(3bv32, 19bv32);call write~init~intINTTYPE1(79bv8, 19bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(75bv8, 19bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 19bv32, 2bv32, 1bv32);call #Ultimate.allocInit(2bv32, 20bv32);call write~init~intINTTYPE1(41bv8, 20bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 20bv32, 1bv32, 1bv32);call #Ultimate.allocInit(13bv32, 21bv32);call #Ultimate.allocInit(3bv32, 22bv32);call write~init~intINTTYPE1(79bv8, 22bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(110bv8, 22bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 22bv32, 2bv32, 1bv32);call #Ultimate.allocInit(4bv32, 23bv32);call write~init~intINTTYPE1(79bv8, 23bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(102bv8, 23bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(102bv8, 23bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 23bv32, 3bv32, 1bv32);call #Ultimate.allocInit(7bv32, 24bv32);call write~init~intINTTYPE1(44bv8, 24bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(80bv8, 24bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(117bv8, 24bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(109bv8, 24bv32, 3bv32, 1bv32);call write~init~intINTTYPE1(112bv8, 24bv32, 4bv32, 1bv32);call write~init~intINTTYPE1(58bv8, 24bv32, 5bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 24bv32, 6bv32, 1bv32);call #Ultimate.allocInit(3bv32, 25bv32);call write~init~intINTTYPE1(79bv8, 25bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(110bv8, 25bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 25bv32, 2bv32, 1bv32);call #Ultimate.allocInit(4bv32, 26bv32);call write~init~intINTTYPE1(79bv8, 26bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(102bv8, 26bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(102bv8, 26bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 26bv32, 3bv32, 1bv32);call #Ultimate.allocInit(3bv32, 27bv32);call write~init~intINTTYPE1(41bv8, 27bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(32bv8, 27bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 27bv32, 2bv32, 1bv32);call #Ultimate.allocInit(2bv32, 28bv32);call write~init~intINTTYPE1(10bv8, 28bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 28bv32, 1bv32, 1bv32);~head~0.base, ~head~0.offset := 0bv32, 0bv32;~cleanupTimeShifts~0 := 4bv32;~waterLevel~0 := 1bv32;~methaneLevelCritical~0 := 0bv32;~pumpRunning~0 := 0bv32;~systemActive~0 := 1bv32; {3171#(= (_ bv0 32) ~pumpRunning~0)} is VALID [2022-02-20 18:09:00,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {3171#(= (_ bv0 32) ~pumpRunning~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret31#1, main_~retValue_acc~5#1, main_~tmp~4#1;havoc main_~retValue_acc~5#1;havoc main_~tmp~4#1;assume { :begin_inline_select_helpers } true; {3171#(= (_ bv0 32) ~pumpRunning~0)} is VALID [2022-02-20 18:09:00,240 INFO L290 TraceCheckUtils]: 2: Hoare triple {3171#(= (_ bv0 32) ~pumpRunning~0)} assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; {3171#(= (_ bv0 32) ~pumpRunning~0)} is VALID [2022-02-20 18:09:00,240 INFO L290 TraceCheckUtils]: 3: Hoare triple {3171#(= (_ bv0 32) ~pumpRunning~0)} assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~1#1;havoc valid_product_~retValue_acc~1#1;valid_product_~retValue_acc~1#1 := 1bv32;valid_product_#res#1 := valid_product_~retValue_acc~1#1; {3171#(= (_ bv0 32) ~pumpRunning~0)} is VALID [2022-02-20 18:09:00,240 INFO L290 TraceCheckUtils]: 4: Hoare triple {3171#(= (_ bv0 32) ~pumpRunning~0)} main_#t~ret31#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;main_~tmp~4#1 := main_#t~ret31#1;havoc main_#t~ret31#1; {3171#(= (_ bv0 32) ~pumpRunning~0)} is VALID [2022-02-20 18:09:00,241 INFO L290 TraceCheckUtils]: 5: Hoare triple {3171#(= (_ bv0 32) ~pumpRunning~0)} assume 0bv32 != main_~tmp~4#1;assume { :begin_inline_setup } true; {3171#(= (_ bv0 32) ~pumpRunning~0)} is VALID [2022-02-20 18:09:00,241 INFO L290 TraceCheckUtils]: 6: Hoare triple {3171#(= (_ bv0 32) ~pumpRunning~0)} assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;havoc test_#t~nondet37#1, test_#t~nondet38#1, test_#t~nondet39#1, test_#t~nondet40#1, test_~splverifierCounter~0#1, test_~tmp~5#1, test_~tmp___0~1#1, test_~tmp___1~1#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~5#1;havoc test_~tmp___0~1#1;havoc test_~tmp___1~1#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0bv32; {3171#(= (_ bv0 32) ~pumpRunning~0)} is VALID [2022-02-20 18:09:00,241 INFO L290 TraceCheckUtils]: 7: Hoare triple {3171#(= (_ bv0 32) ~pumpRunning~0)} assume !false; {3171#(= (_ bv0 32) ~pumpRunning~0)} is VALID [2022-02-20 18:09:00,242 INFO L290 TraceCheckUtils]: 8: Hoare triple {3171#(= (_ bv0 32) ~pumpRunning~0)} assume ~bvslt32(test_~splverifierCounter~0#1, 4bv32); {3171#(= (_ bv0 32) ~pumpRunning~0)} is VALID [2022-02-20 18:09:00,243 INFO L290 TraceCheckUtils]: 9: Hoare triple {3171#(= (_ bv0 32) ~pumpRunning~0)} test_~tmp~5#1 := test_#t~nondet37#1;havoc test_#t~nondet37#1; {3171#(= (_ bv0 32) ~pumpRunning~0)} is VALID [2022-02-20 18:09:00,243 INFO L290 TraceCheckUtils]: 10: Hoare triple {3171#(= (_ bv0 32) ~pumpRunning~0)} assume !(0bv32 != test_~tmp~5#1); {3171#(= (_ bv0 32) ~pumpRunning~0)} is VALID [2022-02-20 18:09:00,243 INFO L290 TraceCheckUtils]: 11: Hoare triple {3171#(= (_ bv0 32) ~pumpRunning~0)} test_~tmp___0~1#1 := test_#t~nondet38#1;havoc test_#t~nondet38#1; {3171#(= (_ bv0 32) ~pumpRunning~0)} is VALID [2022-02-20 18:09:00,243 INFO L290 TraceCheckUtils]: 12: Hoare triple {3171#(= (_ bv0 32) ~pumpRunning~0)} assume !(0bv32 != test_~tmp___0~1#1); {3171#(= (_ bv0 32) ~pumpRunning~0)} is VALID [2022-02-20 18:09:00,244 INFO L290 TraceCheckUtils]: 13: Hoare triple {3171#(= (_ bv0 32) ~pumpRunning~0)} test_~tmp___2~0#1 := test_#t~nondet39#1;havoc test_#t~nondet39#1; {3171#(= (_ bv0 32) ~pumpRunning~0)} is VALID [2022-02-20 18:09:00,244 INFO L290 TraceCheckUtils]: 14: Hoare triple {3171#(= (_ bv0 32) ~pumpRunning~0)} assume 0bv32 != test_~tmp___2~0#1; {3171#(= (_ bv0 32) ~pumpRunning~0)} is VALID [2022-02-20 18:09:00,244 INFO L272 TraceCheckUtils]: 15: Hoare triple {3171#(= (_ bv0 32) ~pumpRunning~0)} call timeShift(); {3171#(= (_ bv0 32) ~pumpRunning~0)} is VALID [2022-02-20 18:09:00,245 INFO L290 TraceCheckUtils]: 16: Hoare triple {3171#(= (_ bv0 32) ~pumpRunning~0)} assume 0bv32 != ~pumpRunning~0;assume { :begin_inline_lowerWaterLevel } true; {3167#false} is VALID [2022-02-20 18:09:00,245 INFO L290 TraceCheckUtils]: 17: Hoare triple {3167#false} assume ~bvsgt32(~waterLevel~0, 0bv32);~waterLevel~0 := ~bvsub32(~waterLevel~0, 1bv32); {3167#false} is VALID [2022-02-20 18:09:00,245 INFO L290 TraceCheckUtils]: 18: Hoare triple {3167#false} assume { :end_inline_lowerWaterLevel } true; {3167#false} is VALID [2022-02-20 18:09:00,245 INFO L290 TraceCheckUtils]: 19: Hoare triple {3167#false} assume 0bv32 != ~systemActive~0;assume { :begin_inline_processEnvironment } true;havoc processEnvironment_#t~ret41#1, processEnvironment_~tmp~6#1;havoc processEnvironment_~tmp~6#1; {3167#false} is VALID [2022-02-20 18:09:00,245 INFO L290 TraceCheckUtils]: 20: Hoare triple {3167#false} assume !(0bv32 != ~pumpRunning~0); {3167#false} is VALID [2022-02-20 18:09:00,245 INFO L272 TraceCheckUtils]: 21: Hoare triple {3167#false} call processEnvironment__wrappee__base(); {3167#false} is VALID [2022-02-20 18:09:00,246 INFO L290 TraceCheckUtils]: 22: Hoare triple {3167#false} assume true; {3167#false} is VALID [2022-02-20 18:09:00,246 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3167#false} {3167#false} #214#return; {3167#false} is VALID [2022-02-20 18:09:00,246 INFO L290 TraceCheckUtils]: 24: Hoare triple {3167#false} assume { :end_inline_processEnvironment } true; {3167#false} is VALID [2022-02-20 18:09:00,246 INFO L290 TraceCheckUtils]: 25: Hoare triple {3167#false} assume { :begin_inline___utac_acc__Specification3_spec__1 } true;havoc __utac_acc__Specification3_spec__1_#t~ret5#1, __utac_acc__Specification3_spec__1_#t~ret6#1, __utac_acc__Specification3_spec__1_#t~ret7#1, __utac_acc__Specification3_spec__1_~tmp~0#1, __utac_acc__Specification3_spec__1_~tmp___0~0#1, __utac_acc__Specification3_spec__1_~tmp___1~0#1;havoc __utac_acc__Specification3_spec__1_~tmp~0#1;havoc __utac_acc__Specification3_spec__1_~tmp___0~0#1;havoc __utac_acc__Specification3_spec__1_~tmp___1~0#1; {3167#false} is VALID [2022-02-20 18:09:00,246 INFO L272 TraceCheckUtils]: 26: Hoare triple {3167#false} call __utac_acc__Specification3_spec__1_#t~ret5#1 := isMethaneLevelCritical(); {3167#false} is VALID [2022-02-20 18:09:00,246 INFO L290 TraceCheckUtils]: 27: Hoare triple {3167#false} havoc ~retValue_acc~6;~retValue_acc~6 := ~methaneLevelCritical~0;#res := ~retValue_acc~6; {3167#false} is VALID [2022-02-20 18:09:00,246 INFO L290 TraceCheckUtils]: 28: Hoare triple {3167#false} assume true; {3167#false} is VALID [2022-02-20 18:09:00,246 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {3167#false} {3167#false} #216#return; {3167#false} is VALID [2022-02-20 18:09:00,247 INFO L290 TraceCheckUtils]: 30: Hoare triple {3167#false} __utac_acc__Specification3_spec__1_~tmp~0#1 := __utac_acc__Specification3_spec__1_#t~ret5#1;havoc __utac_acc__Specification3_spec__1_#t~ret5#1; {3167#false} is VALID [2022-02-20 18:09:00,247 INFO L290 TraceCheckUtils]: 31: Hoare triple {3167#false} assume !(0bv32 != __utac_acc__Specification3_spec__1_~tmp~0#1);assume { :begin_inline_getWaterLevel } true;havoc getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~7#1;havoc getWaterLevel_~retValue_acc~7#1;getWaterLevel_~retValue_acc~7#1 := ~waterLevel~0;getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~7#1; {3167#false} is VALID [2022-02-20 18:09:00,247 INFO L290 TraceCheckUtils]: 32: Hoare triple {3167#false} __utac_acc__Specification3_spec__1_#t~ret6#1 := getWaterLevel_#res#1;assume { :end_inline_getWaterLevel } true;__utac_acc__Specification3_spec__1_~tmp___0~0#1 := __utac_acc__Specification3_spec__1_#t~ret6#1;havoc __utac_acc__Specification3_spec__1_#t~ret6#1; {3167#false} is VALID [2022-02-20 18:09:00,247 INFO L290 TraceCheckUtils]: 33: Hoare triple {3167#false} assume 2bv32 == __utac_acc__Specification3_spec__1_~tmp___0~0#1;assume { :begin_inline_isPumpRunning } true;havoc isPumpRunning_#res#1;havoc isPumpRunning_~retValue_acc~10#1;havoc isPumpRunning_~retValue_acc~10#1;isPumpRunning_~retValue_acc~10#1 := ~pumpRunning~0;isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~10#1; {3167#false} is VALID [2022-02-20 18:09:00,247 INFO L290 TraceCheckUtils]: 34: Hoare triple {3167#false} __utac_acc__Specification3_spec__1_#t~ret7#1 := isPumpRunning_#res#1;assume { :end_inline_isPumpRunning } true;__utac_acc__Specification3_spec__1_~tmp___1~0#1 := __utac_acc__Specification3_spec__1_#t~ret7#1;havoc __utac_acc__Specification3_spec__1_#t~ret7#1; {3167#false} is VALID [2022-02-20 18:09:00,247 INFO L290 TraceCheckUtils]: 35: Hoare triple {3167#false} assume !(0bv32 != __utac_acc__Specification3_spec__1_~tmp___1~0#1);assume { :begin_inline___automaton_fail } true; {3167#false} is VALID [2022-02-20 18:09:00,247 INFO L290 TraceCheckUtils]: 36: Hoare triple {3167#false} assume !false; {3167#false} is VALID [2022-02-20 18:09:00,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:09:00,248 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 18:09:00,248 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 18:09:00,250 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [698031195] [2022-02-20 18:09:00,250 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [698031195] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:09:00,250 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:09:00,250 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 18:09:00,250 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113943508] [2022-02-20 18:09:00,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:09:00,251 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2022-02-20 18:09:00,251 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:09:00,251 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 18:09:00,275 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:09:00,275 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:09:00,275 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 18:09:00,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:09:00,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:09:00,276 INFO L87 Difference]: Start difference. First operand 215 states and 280 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 18:09:00,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:09:00,336 INFO L93 Difference]: Finished difference Result 373 states and 489 transitions. [2022-02-20 18:09:00,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:09:00,337 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2022-02-20 18:09:00,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:09:00,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 18:09:00,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2022-02-20 18:09:00,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 18:09:00,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2022-02-20 18:09:00,341 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 138 transitions. [2022-02-20 18:09:00,447 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:09:00,449 INFO L225 Difference]: With dead ends: 373 [2022-02-20 18:09:00,450 INFO L226 Difference]: Without dead ends: 165 [2022-02-20 18:09:00,450 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:09:00,451 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 44 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:09:00,451 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 56 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:09:00,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-02-20 18:09:00,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 163. [2022-02-20 18:09:00,458 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:09:00,459 INFO L82 GeneralOperation]: Start isEquivalent. First operand 165 states. Second operand has 163 states, 124 states have (on average 1.2580645161290323) internal successors, (156), 131 states have internal predecessors, (156), 20 states have call successors, (20), 20 states have call predecessors, (20), 18 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-20 18:09:00,459 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand has 163 states, 124 states have (on average 1.2580645161290323) internal successors, (156), 131 states have internal predecessors, (156), 20 states have call successors, (20), 20 states have call predecessors, (20), 18 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-20 18:09:00,460 INFO L87 Difference]: Start difference. First operand 165 states. Second operand has 163 states, 124 states have (on average 1.2580645161290323) internal successors, (156), 131 states have internal predecessors, (156), 20 states have call successors, (20), 20 states have call predecessors, (20), 18 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-20 18:09:00,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:09:00,463 INFO L93 Difference]: Finished difference Result 165 states and 198 transitions. [2022-02-20 18:09:00,464 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 198 transitions. [2022-02-20 18:09:00,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:09:00,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:09:00,465 INFO L74 IsIncluded]: Start isIncluded. First operand has 163 states, 124 states have (on average 1.2580645161290323) internal successors, (156), 131 states have internal predecessors, (156), 20 states have call successors, (20), 20 states have call predecessors, (20), 18 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) Second operand 165 states. [2022-02-20 18:09:00,465 INFO L87 Difference]: Start difference. First operand has 163 states, 124 states have (on average 1.2580645161290323) internal successors, (156), 131 states have internal predecessors, (156), 20 states have call successors, (20), 20 states have call predecessors, (20), 18 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) Second operand 165 states. [2022-02-20 18:09:00,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:09:00,468 INFO L93 Difference]: Finished difference Result 165 states and 198 transitions. [2022-02-20 18:09:00,469 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 198 transitions. [2022-02-20 18:09:00,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:09:00,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:09:00,469 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:09:00,469 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:09:00,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 124 states have (on average 1.2580645161290323) internal successors, (156), 131 states have internal predecessors, (156), 20 states have call successors, (20), 20 states have call predecessors, (20), 18 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-20 18:09:00,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 196 transitions. [2022-02-20 18:09:00,473 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 196 transitions. Word has length 37 [2022-02-20 18:09:00,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:09:00,473 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 196 transitions. [2022-02-20 18:09:00,474 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 18:09:00,474 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 196 transitions. [2022-02-20 18:09:00,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-02-20 18:09:00,474 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:09:00,474 INFO L514 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, 1, 1, 1, 1, 1] [2022-02-20 18:09:00,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-02-20 18:09:00,683 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 18:09:00,683 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:09:00,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:09:00,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1101152696, now seen corresponding path program 1 times [2022-02-20 18:09:00,684 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 18:09:00,684 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1939960980] [2022-02-20 18:09:00,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:09:00,684 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 18:09:00,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 18:09:00,685 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 18:09:00,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-02-20 18:09:00,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 18:09:00,734 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 18:09:00,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 18:09:00,781 INFO L138 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-02-20 18:09:00,781 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 18:09:00,781 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 18:09:00,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-02-20 18:09:00,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 18:09:00,986 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-02-20 18:09:00,988 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 18:09:01,005 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call waterRise(); [2022-02-20 18:09:01,006 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: callstack broken after backtranslation by InlinerBacktranslator at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:216) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:206) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getProgramExecutionAsString(CounterExampleResult.java:155) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getLongDescription(CounterExampleResult.java:134) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportLocationResults(TraceAbstractionStarter.java:607) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-20 18:09:01,008 INFO L158 Benchmark]: Toolchain (without parser) took 5194.13ms. Allocated memory was 48.2MB in the beginning and 86.0MB in the end (delta: 37.7MB). Free memory was 22.4MB in the beginning and 40.4MB in the end (delta: -17.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-02-20 18:09:01,008 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 48.2MB. Free memory was 30.1MB in the beginning and 30.1MB in the end (delta: 31.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 18:09:01,008 INFO L158 Benchmark]: CACSL2BoogieTranslator took 434.41ms. Allocated memory was 48.2MB in the beginning and 58.7MB in the end (delta: 10.5MB). Free memory was 22.2MB in the beginning and 36.7MB in the end (delta: -14.5MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. [2022-02-20 18:09:01,008 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.30ms. Allocated memory is still 58.7MB. Free memory was 36.7MB in the beginning and 33.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 18:09:01,008 INFO L158 Benchmark]: Boogie Preprocessor took 42.73ms. Allocated memory is still 58.7MB. Free memory was 33.9MB in the beginning and 32.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 18:09:01,009 INFO L158 Benchmark]: RCFGBuilder took 439.46ms. Allocated memory is still 58.7MB. Free memory was 32.2MB in the beginning and 33.0MB in the end (delta: -775.8kB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 18:09:01,009 INFO L158 Benchmark]: TraceAbstraction took 4195.76ms. Allocated memory was 58.7MB in the beginning and 86.0MB in the end (delta: 27.3MB). Free memory was 32.2MB in the beginning and 40.4MB in the end (delta: -8.1MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. [2022-02-20 18:09:01,010 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 48.2MB. Free memory was 30.1MB in the beginning and 30.1MB in the end (delta: 31.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 434.41ms. Allocated memory was 48.2MB in the beginning and 58.7MB in the end (delta: 10.5MB). Free memory was 22.2MB in the beginning and 36.7MB in the end (delta: -14.5MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.30ms. Allocated memory is still 58.7MB. Free memory was 36.7MB in the beginning and 33.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.73ms. Allocated memory is still 58.7MB. Free memory was 33.9MB in the beginning and 32.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 439.46ms. Allocated memory is still 58.7MB. Free memory was 32.2MB in the beginning and 33.0MB in the end (delta: -775.8kB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 4195.76ms. Allocated memory was 58.7MB in the beginning and 86.0MB in the end (delta: 27.3MB). Free memory was 32.2MB in the beginning and 40.4MB in the end (delta: -8.1MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: callstack broken after backtranslation by InlinerBacktranslator: de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 18:09:01,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator