./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec3_product25.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_product25.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 5af7a19aabc47c6ad0d023db96d81a1e5e3db737faffc67c3935346aa9890fbf --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:08:54,616 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:08:54,617 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:08:54,664 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:08:54,664 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:08:54,665 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:08:54,666 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:08:54,668 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:08:54,669 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:08:54,670 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:08:54,671 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:08:54,672 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:08:54,672 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:08:54,673 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:08:54,674 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:08:54,675 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:08:54,676 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:08:54,676 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:08:54,678 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:08:54,680 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:08:54,681 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:08:54,682 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:08:54,686 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:08:54,688 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:08:54,694 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:08:54,699 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:08:54,700 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:08:54,701 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:08:54,702 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:08:54,703 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:08:54,704 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:08:54,704 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:08:54,705 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:08:54,706 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:08:54,707 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:08:54,708 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:08:54,709 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:08:54,710 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:08:54,710 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:08:54,712 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:08:54,712 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:08:54,713 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:54,730 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:08:54,730 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:08:54,731 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:08:54,731 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:08:54,731 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:08:54,731 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:08:54,732 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:08:54,732 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:08:54,732 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:08:54,732 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:08:54,732 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:08:54,732 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:08:54,733 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:08:54,733 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:08:54,733 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:08:54,733 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:08:54,733 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:08:54,733 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:08:54,733 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:08:54,733 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:08:54,733 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:08:54,733 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:08:54,734 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:08:54,734 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:08:54,734 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:08:54,734 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:08:54,734 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:08:54,734 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:08:54,734 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:08:54,734 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:08:54,734 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:08:54,735 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:08:54,735 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:08:54,735 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 -> 5af7a19aabc47c6ad0d023db96d81a1e5e3db737faffc67c3935346aa9890fbf [2022-02-20 18:08:54,938 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:08:54,966 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:08:54,968 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:08:54,969 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:08:54,970 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:08:54,971 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec3_product25.cil.c [2022-02-20 18:08:55,052 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/193877afa/ef4194a641624d128c169034e3c8e48f/FLAGcd3eee7a6 [2022-02-20 18:08:55,465 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:08:55,466 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec3_product25.cil.c [2022-02-20 18:08:55,475 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/193877afa/ef4194a641624d128c169034e3c8e48f/FLAGcd3eee7a6 [2022-02-20 18:08:55,836 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/193877afa/ef4194a641624d128c169034e3c8e48f [2022-02-20 18:08:55,838 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:08:55,839 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:08:55,853 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:08:55,854 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:08:55,857 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:08:55,858 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,860 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7733f88 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,860 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,866 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:08:55,907 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:08:56,071 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_product25.cil.c[2191,2204] [2022-02-20 18:08:56,156 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:08:56,164 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:08:56,177 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_product25.cil.c[2191,2204] [2022-02-20 18:08:56,224 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:08:56,240 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:08:56,240 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,240 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:08:56,242 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:08:56,242 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:08:56,242 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:08:56,248 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,271 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,319 INFO L137 Inliner]: procedures = 53, calls = 152, calls flagged for inlining = 22, calls inlined = 17, statements flattened = 225 [2022-02-20 18:08:56,319 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:08:56,320 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:08:56,321 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:08:56,321 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:08:56,328 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,328 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,343 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,346 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,352 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,368 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,369 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,371 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:08:56,386 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:08:56,387 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:08:56,387 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:08:56,388 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,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:08:56,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:08:56,418 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,423 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,456 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:08:56,456 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2022-02-20 18:08:56,457 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2022-02-20 18:08:56,457 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2022-02-20 18:08:56,458 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2022-02-20 18:08:56,458 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2022-02-20 18:08:56,458 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2022-02-20 18:08:56,458 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2022-02-20 18:08:56,460 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2022-02-20 18:08:56,460 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2022-02-20 18:08:56,460 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2022-02-20 18:08:56,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:08:56,460 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2022-02-20 18:08:56,461 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2022-02-20 18:08:56,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:08:56,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:08:56,536 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:08:56,553 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:08:56,830 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:08:56,837 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:08:56,837 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 18:08:56,839 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,839 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:08:56,840 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:08:56,841 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:08:56,845 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:08:56,846 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,848 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fc1fc82 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,848 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,849 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fc1fc82 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,849 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,851 INFO L111 eAbstractionObserver]: Analyzing ICFG minepump_spec3_product25.cil.c [2022-02-20 18:08:56,855 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:08:56,856 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:08:56,895 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:08:56,900 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,900 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:08:56,942 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 58 states have (on average 1.396551724137931) internal successors, (81), 64 states have internal predecessors, (81), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 18:08:56,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 18:08:56,948 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:08:56,949 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,949 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:08:56,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:08:56,959 INFO L85 PathProgramCache]: Analyzing trace with hash 234388957, now seen corresponding path program 1 times [2022-02-20 18:08:56,970 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:08:56,970 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43142367] [2022-02-20 18:08:56,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:08:56,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:08:57,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:08:57,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-20 18:08:57,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:08:57,244 INFO L290 TraceCheckUtils]: 0: Hoare triple {78#true} havoc ~retValue_acc~3;~retValue_acc~3 := ~methaneLevelCritical~0;#res := ~retValue_acc~3; {78#true} is VALID [2022-02-20 18:08:57,244 INFO L290 TraceCheckUtils]: 1: Hoare triple {78#true} assume true; {78#true} is VALID [2022-02-20 18:08:57,245 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {78#true} {79#false} #203#return; {79#false} is VALID [2022-02-20 18:08:57,250 INFO L290 TraceCheckUtils]: 0: Hoare triple {78#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;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1; {78#true} is VALID [2022-02-20 18:08:57,251 INFO L290 TraceCheckUtils]: 1: Hoare triple {78#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret36#1, main_~retValue_acc~8#1, main_~tmp~4#1;havoc main_~retValue_acc~8#1;havoc main_~tmp~4#1;assume { :begin_inline_select_helpers } true; {78#true} is VALID [2022-02-20 18:08:57,252 INFO L290 TraceCheckUtils]: 2: Hoare triple {78#true} assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; {78#true} is VALID [2022-02-20 18:08:57,252 INFO L290 TraceCheckUtils]: 3: Hoare triple {78#true} assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~7#1;havoc valid_product_~retValue_acc~7#1;valid_product_~retValue_acc~7#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~7#1; {78#true} is VALID [2022-02-20 18:08:57,253 INFO L290 TraceCheckUtils]: 4: Hoare triple {78#true} main_#t~ret36#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;assume -2147483648 <= main_#t~ret36#1 && main_#t~ret36#1 <= 2147483647;main_~tmp~4#1 := main_#t~ret36#1;havoc main_#t~ret36#1; {78#true} is VALID [2022-02-20 18:08:57,253 INFO L290 TraceCheckUtils]: 5: Hoare triple {78#true} assume 0 != main_~tmp~4#1;assume { :begin_inline_setup } true; {78#true} is VALID [2022-02-20 18:08:57,253 INFO L290 TraceCheckUtils]: 6: Hoare triple {78#true} assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;havoc test_#t~nondet49#1, test_#t~nondet50#1, test_#t~nondet51#1, test_#t~nondet52#1, test_~splverifierCounter~0#1, test_~tmp~8#1, test_~tmp___0~2#1, test_~tmp___1~1#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~8#1;havoc test_~tmp___0~2#1;havoc test_~tmp___1~1#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0; {78#true} is VALID [2022-02-20 18:08:57,254 INFO L290 TraceCheckUtils]: 7: Hoare triple {78#true} assume !true; {79#false} is VALID [2022-02-20 18:08:57,255 INFO L272 TraceCheckUtils]: 8: Hoare triple {79#false} call cleanup(); {79#false} is VALID [2022-02-20 18:08:57,255 INFO L290 TraceCheckUtils]: 9: Hoare triple {79#false} havoc ~i~0;havoc ~__cil_tmp2~0; {79#false} is VALID [2022-02-20 18:08:57,255 INFO L272 TraceCheckUtils]: 10: Hoare triple {79#false} call timeShift(); {79#false} is VALID [2022-02-20 18:08:57,256 INFO L290 TraceCheckUtils]: 11: Hoare triple {79#false} assume !(0 != ~pumpRunning~0); {79#false} is VALID [2022-02-20 18:08:57,256 INFO L290 TraceCheckUtils]: 12: Hoare triple {79#false} assume !(0 != ~systemActive~0); {79#false} is VALID [2022-02-20 18:08:57,256 INFO L290 TraceCheckUtils]: 13: Hoare triple {79#false} assume { :begin_inline___utac_acc__Specification3_spec__1 } true;havoc __utac_acc__Specification3_spec__1_#t~ret4#1, __utac_acc__Specification3_spec__1_#t~ret5#1, __utac_acc__Specification3_spec__1_#t~ret6#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; {79#false} is VALID [2022-02-20 18:08:57,256 INFO L272 TraceCheckUtils]: 14: Hoare triple {79#false} call __utac_acc__Specification3_spec__1_#t~ret4#1 := isMethaneLevelCritical(); {78#true} is VALID [2022-02-20 18:08:57,256 INFO L290 TraceCheckUtils]: 15: Hoare triple {78#true} havoc ~retValue_acc~3;~retValue_acc~3 := ~methaneLevelCritical~0;#res := ~retValue_acc~3; {78#true} is VALID [2022-02-20 18:08:57,257 INFO L290 TraceCheckUtils]: 16: Hoare triple {78#true} assume true; {78#true} is VALID [2022-02-20 18:08:57,258 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {78#true} {79#false} #203#return; {79#false} is VALID [2022-02-20 18:08:57,258 INFO L290 TraceCheckUtils]: 18: Hoare triple {79#false} assume -2147483648 <= __utac_acc__Specification3_spec__1_#t~ret4#1 && __utac_acc__Specification3_spec__1_#t~ret4#1 <= 2147483647;__utac_acc__Specification3_spec__1_~tmp~0#1 := __utac_acc__Specification3_spec__1_#t~ret4#1;havoc __utac_acc__Specification3_spec__1_#t~ret4#1; {79#false} is VALID [2022-02-20 18:08:57,258 INFO L290 TraceCheckUtils]: 19: Hoare triple {79#false} assume !(0 != __utac_acc__Specification3_spec__1_~tmp~0#1);assume { :begin_inline_getWaterLevel } true;havoc getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~4#1;havoc getWaterLevel_~retValue_acc~4#1;getWaterLevel_~retValue_acc~4#1 := ~waterLevel~0;getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~4#1; {79#false} is VALID [2022-02-20 18:08:57,258 INFO L290 TraceCheckUtils]: 20: Hoare triple {79#false} __utac_acc__Specification3_spec__1_#t~ret5#1 := getWaterLevel_#res#1;assume { :end_inline_getWaterLevel } true;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~0#1 := __utac_acc__Specification3_spec__1_#t~ret5#1;havoc __utac_acc__Specification3_spec__1_#t~ret5#1; {79#false} is VALID [2022-02-20 18:08:57,259 INFO L290 TraceCheckUtils]: 21: Hoare triple {79#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; {79#false} is VALID [2022-02-20 18:08:57,259 INFO L290 TraceCheckUtils]: 22: Hoare triple {79#false} __utac_acc__Specification3_spec__1_#t~ret6#1 := isPumpRunning_#res#1;assume { :end_inline_isPumpRunning } 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___1~0#1 := __utac_acc__Specification3_spec__1_#t~ret6#1;havoc __utac_acc__Specification3_spec__1_#t~ret6#1; {79#false} is VALID [2022-02-20 18:08:57,259 INFO L290 TraceCheckUtils]: 23: Hoare triple {79#false} assume !(0 != __utac_acc__Specification3_spec__1_~tmp___1~0#1);assume { :begin_inline___automaton_fail } true; {79#false} is VALID [2022-02-20 18:08:57,260 INFO L290 TraceCheckUtils]: 24: Hoare triple {79#false} assume !false; {79#false} is VALID [2022-02-20 18:08:57,261 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,261 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:08:57,262 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43142367] [2022-02-20 18:08:57,263 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43142367] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:08:57,263 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:08:57,263 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 18:08:57,265 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443108405] [2022-02-20 18:08:57,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:08:57,274 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:57,276 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:08:57,279 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:57,325 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,326 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 18:08:57,326 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:08:57,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 18:08:57,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 18:08:57,348 INFO L87 Difference]: Start difference. First operand has 75 states, 58 states have (on average 1.396551724137931) internal successors, (81), 64 states have internal predecessors, (81), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) 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:57,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:08:57,482 INFO L93 Difference]: Finished difference Result 142 states and 193 transitions. [2022-02-20 18:08:57,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 18:08:57,482 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:57,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:08:57,484 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:57,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 193 transitions. [2022-02-20 18:08:57,495 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:57,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 193 transitions. [2022-02-20 18:08:57,505 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 193 transitions. [2022-02-20 18:08:57,664 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 193 edges. 193 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:08:57,678 INFO L225 Difference]: With dead ends: 142 [2022-02-20 18:08:57,679 INFO L226 Difference]: Without dead ends: 66 [2022-02-20 18:08:57,682 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:57,688 INFO L933 BasicCegarLoop]: 93 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, 93 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,690 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 93 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,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-02-20 18:08:57,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-02-20 18:08:57,730 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:08:57,732 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 66 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 56 states have internal predecessors, (67), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 18:08:57,732 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 66 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 56 states have internal predecessors, (67), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 18:08:57,733 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 66 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 56 states have internal predecessors, (67), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 18:08:57,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:08:57,747 INFO L93 Difference]: Finished difference Result 66 states and 84 transitions. [2022-02-20 18:08:57,747 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2022-02-20 18:08:57,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:08:57,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:08:57,749 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 56 states have internal predecessors, (67), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 66 states. [2022-02-20 18:08:57,750 INFO L87 Difference]: Start difference. First operand has 66 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 56 states have internal predecessors, (67), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 66 states. [2022-02-20 18:08:57,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:08:57,754 INFO L93 Difference]: Finished difference Result 66 states and 84 transitions. [2022-02-20 18:08:57,754 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2022-02-20 18:08:57,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:08:57,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:08:57,756 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:08:57,756 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:08:57,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 56 states have internal predecessors, (67), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 18:08:57,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 84 transitions. [2022-02-20 18:08:57,764 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 84 transitions. Word has length 25 [2022-02-20 18:08:57,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:08:57,768 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 84 transitions. [2022-02-20 18:08:57,768 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:57,768 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2022-02-20 18:08:57,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 18:08:57,769 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:08:57,770 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,770 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:08:57,770 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:08:57,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:08:57,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1566921044, now seen corresponding path program 1 times [2022-02-20 18:08:57,771 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:08:57,771 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136534474] [2022-02-20 18:08:57,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:08:57,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:08:57,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:08:57,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-20 18:08:57,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:08:57,881 INFO L290 TraceCheckUtils]: 0: Hoare triple {517#true} havoc ~retValue_acc~3;~retValue_acc~3 := ~methaneLevelCritical~0;#res := ~retValue_acc~3; {517#true} is VALID [2022-02-20 18:08:57,882 INFO L290 TraceCheckUtils]: 1: Hoare triple {517#true} assume true; {517#true} is VALID [2022-02-20 18:08:57,882 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {517#true} {518#false} #203#return; {518#false} is VALID [2022-02-20 18:08:57,882 INFO L290 TraceCheckUtils]: 0: Hoare triple {517#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;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1; {517#true} is VALID [2022-02-20 18:08:57,882 INFO L290 TraceCheckUtils]: 1: Hoare triple {517#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret36#1, main_~retValue_acc~8#1, main_~tmp~4#1;havoc main_~retValue_acc~8#1;havoc main_~tmp~4#1;assume { :begin_inline_select_helpers } true; {517#true} is VALID [2022-02-20 18:08:57,883 INFO L290 TraceCheckUtils]: 2: Hoare triple {517#true} assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; {517#true} is VALID [2022-02-20 18:08:57,883 INFO L290 TraceCheckUtils]: 3: Hoare triple {517#true} assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~7#1;havoc valid_product_~retValue_acc~7#1;valid_product_~retValue_acc~7#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~7#1; {517#true} is VALID [2022-02-20 18:08:57,883 INFO L290 TraceCheckUtils]: 4: Hoare triple {517#true} main_#t~ret36#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;assume -2147483648 <= main_#t~ret36#1 && main_#t~ret36#1 <= 2147483647;main_~tmp~4#1 := main_#t~ret36#1;havoc main_#t~ret36#1; {517#true} is VALID [2022-02-20 18:08:57,883 INFO L290 TraceCheckUtils]: 5: Hoare triple {517#true} assume 0 != main_~tmp~4#1;assume { :begin_inline_setup } true; {517#true} is VALID [2022-02-20 18:08:57,884 INFO L290 TraceCheckUtils]: 6: Hoare triple {517#true} assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;havoc test_#t~nondet49#1, test_#t~nondet50#1, test_#t~nondet51#1, test_#t~nondet52#1, test_~splverifierCounter~0#1, test_~tmp~8#1, test_~tmp___0~2#1, test_~tmp___1~1#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~8#1;havoc test_~tmp___0~2#1;havoc test_~tmp___1~1#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0; {519#(= |ULTIMATE.start_test_~splverifierCounter~0#1| 0)} is VALID [2022-02-20 18:08:57,885 INFO L290 TraceCheckUtils]: 7: Hoare triple {519#(= |ULTIMATE.start_test_~splverifierCounter~0#1| 0)} assume !false; {519#(= |ULTIMATE.start_test_~splverifierCounter~0#1| 0)} is VALID [2022-02-20 18:08:57,885 INFO L290 TraceCheckUtils]: 8: Hoare triple {519#(= |ULTIMATE.start_test_~splverifierCounter~0#1| 0)} assume !(test_~splverifierCounter~0#1 < 4); {518#false} is VALID [2022-02-20 18:08:57,885 INFO L272 TraceCheckUtils]: 9: Hoare triple {518#false} call cleanup(); {518#false} is VALID [2022-02-20 18:08:57,885 INFO L290 TraceCheckUtils]: 10: Hoare triple {518#false} havoc ~i~0;havoc ~__cil_tmp2~0; {518#false} is VALID [2022-02-20 18:08:57,886 INFO L272 TraceCheckUtils]: 11: Hoare triple {518#false} call timeShift(); {518#false} is VALID [2022-02-20 18:08:57,886 INFO L290 TraceCheckUtils]: 12: Hoare triple {518#false} assume !(0 != ~pumpRunning~0); {518#false} is VALID [2022-02-20 18:08:57,886 INFO L290 TraceCheckUtils]: 13: Hoare triple {518#false} assume !(0 != ~systemActive~0); {518#false} is VALID [2022-02-20 18:08:57,886 INFO L290 TraceCheckUtils]: 14: Hoare triple {518#false} assume { :begin_inline___utac_acc__Specification3_spec__1 } true;havoc __utac_acc__Specification3_spec__1_#t~ret4#1, __utac_acc__Specification3_spec__1_#t~ret5#1, __utac_acc__Specification3_spec__1_#t~ret6#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; {518#false} is VALID [2022-02-20 18:08:57,886 INFO L272 TraceCheckUtils]: 15: Hoare triple {518#false} call __utac_acc__Specification3_spec__1_#t~ret4#1 := isMethaneLevelCritical(); {517#true} is VALID [2022-02-20 18:08:57,887 INFO L290 TraceCheckUtils]: 16: Hoare triple {517#true} havoc ~retValue_acc~3;~retValue_acc~3 := ~methaneLevelCritical~0;#res := ~retValue_acc~3; {517#true} is VALID [2022-02-20 18:08:57,887 INFO L290 TraceCheckUtils]: 17: Hoare triple {517#true} assume true; {517#true} is VALID [2022-02-20 18:08:57,887 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {517#true} {518#false} #203#return; {518#false} is VALID [2022-02-20 18:08:57,887 INFO L290 TraceCheckUtils]: 19: Hoare triple {518#false} assume -2147483648 <= __utac_acc__Specification3_spec__1_#t~ret4#1 && __utac_acc__Specification3_spec__1_#t~ret4#1 <= 2147483647;__utac_acc__Specification3_spec__1_~tmp~0#1 := __utac_acc__Specification3_spec__1_#t~ret4#1;havoc __utac_acc__Specification3_spec__1_#t~ret4#1; {518#false} is VALID [2022-02-20 18:08:57,887 INFO L290 TraceCheckUtils]: 20: Hoare triple {518#false} assume !(0 != __utac_acc__Specification3_spec__1_~tmp~0#1);assume { :begin_inline_getWaterLevel } true;havoc getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~4#1;havoc getWaterLevel_~retValue_acc~4#1;getWaterLevel_~retValue_acc~4#1 := ~waterLevel~0;getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~4#1; {518#false} is VALID [2022-02-20 18:08:57,888 INFO L290 TraceCheckUtils]: 21: Hoare triple {518#false} __utac_acc__Specification3_spec__1_#t~ret5#1 := getWaterLevel_#res#1;assume { :end_inline_getWaterLevel } true;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~0#1 := __utac_acc__Specification3_spec__1_#t~ret5#1;havoc __utac_acc__Specification3_spec__1_#t~ret5#1; {518#false} is VALID [2022-02-20 18:08:57,888 INFO L290 TraceCheckUtils]: 22: Hoare triple {518#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; {518#false} is VALID [2022-02-20 18:08:57,888 INFO L290 TraceCheckUtils]: 23: Hoare triple {518#false} __utac_acc__Specification3_spec__1_#t~ret6#1 := isPumpRunning_#res#1;assume { :end_inline_isPumpRunning } 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___1~0#1 := __utac_acc__Specification3_spec__1_#t~ret6#1;havoc __utac_acc__Specification3_spec__1_#t~ret6#1; {518#false} is VALID [2022-02-20 18:08:57,888 INFO L290 TraceCheckUtils]: 24: Hoare triple {518#false} assume !(0 != __utac_acc__Specification3_spec__1_~tmp___1~0#1);assume { :begin_inline___automaton_fail } true; {518#false} is VALID [2022-02-20 18:08:57,888 INFO L290 TraceCheckUtils]: 25: Hoare triple {518#false} assume !false; {518#false} is VALID [2022-02-20 18:08:57,889 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,889 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:08:57,889 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136534474] [2022-02-20 18:08:57,889 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136534474] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:08:57,889 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:08:57,889 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:08:57,890 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307937625] [2022-02-20 18:08:57,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:08:57,892 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:57,892 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:08:57,892 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:57,926 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,927 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:08:57,927 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:08:57,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:08:57,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:08:57,928 INFO L87 Difference]: Start difference. First operand 66 states and 84 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:58,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:08:58,006 INFO L93 Difference]: Finished difference Result 98 states and 124 transitions. [2022-02-20 18:08:58,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:08:58,006 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:58,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:08:58,007 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:58,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 124 transitions. [2022-02-20 18:08:58,010 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:58,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 124 transitions. [2022-02-20 18:08:58,013 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 124 transitions. [2022-02-20 18:08:58,105 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:08:58,107 INFO L225 Difference]: With dead ends: 98 [2022-02-20 18:08:58,107 INFO L226 Difference]: Without dead ends: 57 [2022-02-20 18:08:58,108 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:58,109 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 12 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 126 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,110 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 126 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,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-02-20 18:08:58,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-02-20 18:08:58,115 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:08:58,116 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 57 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 50 states have internal predecessors, (60), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 18:08:58,116 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 57 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 50 states have internal predecessors, (60), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 18:08:58,117 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 57 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 50 states have internal predecessors, (60), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 18:08:58,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:08:58,119 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2022-02-20 18:08:58,119 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 72 transitions. [2022-02-20 18:08:58,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:08:58,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:08:58,120 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 50 states have internal predecessors, (60), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 57 states. [2022-02-20 18:08:58,121 INFO L87 Difference]: Start difference. First operand has 57 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 50 states have internal predecessors, (60), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 57 states. [2022-02-20 18:08:58,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:08:58,123 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2022-02-20 18:08:58,123 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 72 transitions. [2022-02-20 18:08:58,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:08:58,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:08:58,124 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:08:58,124 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:08:58,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 50 states have internal predecessors, (60), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 18:08:58,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 72 transitions. [2022-02-20 18:08:58,127 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 72 transitions. Word has length 26 [2022-02-20 18:08:58,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:08:58,128 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 72 transitions. [2022-02-20 18:08:58,128 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:58,128 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 72 transitions. [2022-02-20 18:08:58,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 18:08:58,129 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:08:58,129 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,129 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:08:58,130 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:08:58,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:08:58,130 INFO L85 PathProgramCache]: Analyzing trace with hash 979553586, now seen corresponding path program 1 times [2022-02-20 18:08:58,131 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:08:58,131 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553514334] [2022-02-20 18:08:58,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:08:58,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:08:58,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:08:58,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-02-20 18:08:58,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:08:58,210 INFO L290 TraceCheckUtils]: 0: Hoare triple {861#true} havoc ~retValue_acc~3;~retValue_acc~3 := ~methaneLevelCritical~0;#res := ~retValue_acc~3; {861#true} is VALID [2022-02-20 18:08:58,210 INFO L290 TraceCheckUtils]: 1: Hoare triple {861#true} assume true; {861#true} is VALID [2022-02-20 18:08:58,211 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {861#true} {862#false} #203#return; {862#false} is VALID [2022-02-20 18:08:58,213 INFO L290 TraceCheckUtils]: 0: Hoare triple {861#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;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1; {863#(= 1 ~systemActive~0)} is VALID [2022-02-20 18:08:58,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {863#(= 1 ~systemActive~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret36#1, main_~retValue_acc~8#1, main_~tmp~4#1;havoc main_~retValue_acc~8#1;havoc main_~tmp~4#1;assume { :begin_inline_select_helpers } true; {863#(= 1 ~systemActive~0)} is VALID [2022-02-20 18:08:58,215 INFO L290 TraceCheckUtils]: 2: Hoare triple {863#(= 1 ~systemActive~0)} assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; {863#(= 1 ~systemActive~0)} is VALID [2022-02-20 18:08:58,215 INFO L290 TraceCheckUtils]: 3: Hoare triple {863#(= 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~7#1;havoc valid_product_~retValue_acc~7#1;valid_product_~retValue_acc~7#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~7#1; {864#(= |ULTIMATE.start_valid_product_#res#1| ~systemActive~0)} is VALID [2022-02-20 18:08:58,216 INFO L290 TraceCheckUtils]: 4: Hoare triple {864#(= |ULTIMATE.start_valid_product_#res#1| ~systemActive~0)} main_#t~ret36#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;assume -2147483648 <= main_#t~ret36#1 && main_#t~ret36#1 <= 2147483647;main_~tmp~4#1 := main_#t~ret36#1;havoc main_#t~ret36#1; {865#(= |ULTIMATE.start_main_~tmp~4#1| ~systemActive~0)} is VALID [2022-02-20 18:08:58,216 INFO L290 TraceCheckUtils]: 5: Hoare triple {865#(= |ULTIMATE.start_main_~tmp~4#1| ~systemActive~0)} assume 0 != main_~tmp~4#1;assume { :begin_inline_setup } true; {866#(not (= 0 ~systemActive~0))} is VALID [2022-02-20 18:08:58,217 INFO L290 TraceCheckUtils]: 6: Hoare triple {866#(not (= 0 ~systemActive~0))} assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;havoc test_#t~nondet49#1, test_#t~nondet50#1, test_#t~nondet51#1, test_#t~nondet52#1, test_~splverifierCounter~0#1, test_~tmp~8#1, test_~tmp___0~2#1, test_~tmp___1~1#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~8#1;havoc test_~tmp___0~2#1;havoc test_~tmp___1~1#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0; {866#(not (= 0 ~systemActive~0))} is VALID [2022-02-20 18:08:58,217 INFO L290 TraceCheckUtils]: 7: Hoare triple {866#(not (= 0 ~systemActive~0))} assume !false; {866#(not (= 0 ~systemActive~0))} is VALID [2022-02-20 18:08:58,218 INFO L290 TraceCheckUtils]: 8: Hoare triple {866#(not (= 0 ~systemActive~0))} assume test_~splverifierCounter~0#1 < 4; {866#(not (= 0 ~systemActive~0))} is VALID [2022-02-20 18:08:58,218 INFO L290 TraceCheckUtils]: 9: Hoare triple {866#(not (= 0 ~systemActive~0))} assume -2147483648 <= test_#t~nondet49#1 && test_#t~nondet49#1 <= 2147483647;test_~tmp~8#1 := test_#t~nondet49#1;havoc test_#t~nondet49#1; {866#(not (= 0 ~systemActive~0))} is VALID [2022-02-20 18:08:58,219 INFO L290 TraceCheckUtils]: 10: Hoare triple {866#(not (= 0 ~systemActive~0))} assume !(0 != test_~tmp~8#1); {866#(not (= 0 ~systemActive~0))} is VALID [2022-02-20 18:08:58,219 INFO L290 TraceCheckUtils]: 11: Hoare triple {866#(not (= 0 ~systemActive~0))} assume -2147483648 <= test_#t~nondet50#1 && test_#t~nondet50#1 <= 2147483647;test_~tmp___0~2#1 := test_#t~nondet50#1;havoc test_#t~nondet50#1; {866#(not (= 0 ~systemActive~0))} is VALID [2022-02-20 18:08:58,220 INFO L290 TraceCheckUtils]: 12: Hoare triple {866#(not (= 0 ~systemActive~0))} assume !(0 != test_~tmp___0~2#1); {866#(not (= 0 ~systemActive~0))} is VALID [2022-02-20 18:08:58,220 INFO L290 TraceCheckUtils]: 13: Hoare triple {866#(not (= 0 ~systemActive~0))} assume -2147483648 <= test_#t~nondet51#1 && test_#t~nondet51#1 <= 2147483647;test_~tmp___2~0#1 := test_#t~nondet51#1;havoc test_#t~nondet51#1; {866#(not (= 0 ~systemActive~0))} is VALID [2022-02-20 18:08:58,220 INFO L290 TraceCheckUtils]: 14: Hoare triple {866#(not (= 0 ~systemActive~0))} assume 0 != test_~tmp___2~0#1; {866#(not (= 0 ~systemActive~0))} is VALID [2022-02-20 18:08:58,221 INFO L272 TraceCheckUtils]: 15: Hoare triple {866#(not (= 0 ~systemActive~0))} call timeShift(); {866#(not (= 0 ~systemActive~0))} is VALID [2022-02-20 18:08:58,221 INFO L290 TraceCheckUtils]: 16: Hoare triple {866#(not (= 0 ~systemActive~0))} assume !(0 != ~pumpRunning~0); {866#(not (= 0 ~systemActive~0))} is VALID [2022-02-20 18:08:58,222 INFO L290 TraceCheckUtils]: 17: Hoare triple {866#(not (= 0 ~systemActive~0))} assume !(0 != ~systemActive~0); {862#false} is VALID [2022-02-20 18:08:58,222 INFO L290 TraceCheckUtils]: 18: Hoare triple {862#false} assume { :begin_inline___utac_acc__Specification3_spec__1 } true;havoc __utac_acc__Specification3_spec__1_#t~ret4#1, __utac_acc__Specification3_spec__1_#t~ret5#1, __utac_acc__Specification3_spec__1_#t~ret6#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; {862#false} is VALID [2022-02-20 18:08:58,222 INFO L272 TraceCheckUtils]: 19: Hoare triple {862#false} call __utac_acc__Specification3_spec__1_#t~ret4#1 := isMethaneLevelCritical(); {861#true} is VALID [2022-02-20 18:08:58,223 INFO L290 TraceCheckUtils]: 20: Hoare triple {861#true} havoc ~retValue_acc~3;~retValue_acc~3 := ~methaneLevelCritical~0;#res := ~retValue_acc~3; {861#true} is VALID [2022-02-20 18:08:58,223 INFO L290 TraceCheckUtils]: 21: Hoare triple {861#true} assume true; {861#true} is VALID [2022-02-20 18:08:58,223 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {861#true} {862#false} #203#return; {862#false} is VALID [2022-02-20 18:08:58,223 INFO L290 TraceCheckUtils]: 23: Hoare triple {862#false} assume -2147483648 <= __utac_acc__Specification3_spec__1_#t~ret4#1 && __utac_acc__Specification3_spec__1_#t~ret4#1 <= 2147483647;__utac_acc__Specification3_spec__1_~tmp~0#1 := __utac_acc__Specification3_spec__1_#t~ret4#1;havoc __utac_acc__Specification3_spec__1_#t~ret4#1; {862#false} is VALID [2022-02-20 18:08:58,223 INFO L290 TraceCheckUtils]: 24: Hoare triple {862#false} assume !(0 != __utac_acc__Specification3_spec__1_~tmp~0#1);assume { :begin_inline_getWaterLevel } true;havoc getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~4#1;havoc getWaterLevel_~retValue_acc~4#1;getWaterLevel_~retValue_acc~4#1 := ~waterLevel~0;getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~4#1; {862#false} is VALID [2022-02-20 18:08:58,224 INFO L290 TraceCheckUtils]: 25: Hoare triple {862#false} __utac_acc__Specification3_spec__1_#t~ret5#1 := getWaterLevel_#res#1;assume { :end_inline_getWaterLevel } true;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~0#1 := __utac_acc__Specification3_spec__1_#t~ret5#1;havoc __utac_acc__Specification3_spec__1_#t~ret5#1; {862#false} is VALID [2022-02-20 18:08:58,224 INFO L290 TraceCheckUtils]: 26: Hoare triple {862#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; {862#false} is VALID [2022-02-20 18:08:58,224 INFO L290 TraceCheckUtils]: 27: Hoare triple {862#false} __utac_acc__Specification3_spec__1_#t~ret6#1 := isPumpRunning_#res#1;assume { :end_inline_isPumpRunning } 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___1~0#1 := __utac_acc__Specification3_spec__1_#t~ret6#1;havoc __utac_acc__Specification3_spec__1_#t~ret6#1; {862#false} is VALID [2022-02-20 18:08:58,224 INFO L290 TraceCheckUtils]: 28: Hoare triple {862#false} assume !(0 != __utac_acc__Specification3_spec__1_~tmp___1~0#1);assume { :begin_inline___automaton_fail } true; {862#false} is VALID [2022-02-20 18:08:58,224 INFO L290 TraceCheckUtils]: 29: Hoare triple {862#false} assume !false; {862#false} is VALID [2022-02-20 18:08:58,225 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,225 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:08:58,225 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553514334] [2022-02-20 18:08:58,225 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553514334] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:08:58,226 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:08:58,226 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:08:58,226 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846882562] [2022-02-20 18:08:58,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:08:58,227 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:58,227 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:08:58,227 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:58,275 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,275 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:08:58,276 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:08:58,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:08:58,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:08:58,277 INFO L87 Difference]: Start difference. First operand 57 states and 72 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:58,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:08:58,511 INFO L93 Difference]: Finished difference Result 107 states and 138 transitions. [2022-02-20 18:08:58,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:08:58,512 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:58,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:08:58,512 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:58,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 138 transitions. [2022-02-20 18:08:58,517 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:58,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 138 transitions. [2022-02-20 18:08:58,521 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 138 transitions. [2022-02-20 18:08:58,640 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:58,642 INFO L225 Difference]: With dead ends: 107 [2022-02-20 18:08:58,642 INFO L226 Difference]: Without dead ends: 57 [2022-02-20 18:08:58,642 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:58,644 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 98 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:08:58,644 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 145 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:08:58,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-02-20 18:08:58,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-02-20 18:08:58,649 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:08:58,650 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 57 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 50 states have internal predecessors, (59), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 18:08:58,650 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 57 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 50 states have internal predecessors, (59), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 18:08:58,650 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 57 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 50 states have internal predecessors, (59), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 18:08:58,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:08:58,653 INFO L93 Difference]: Finished difference Result 57 states and 71 transitions. [2022-02-20 18:08:58,653 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 71 transitions. [2022-02-20 18:08:58,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:08:58,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:08:58,654 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 50 states have internal predecessors, (59), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 57 states. [2022-02-20 18:08:58,654 INFO L87 Difference]: Start difference. First operand has 57 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 50 states have internal predecessors, (59), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 57 states. [2022-02-20 18:08:58,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:08:58,656 INFO L93 Difference]: Finished difference Result 57 states and 71 transitions. [2022-02-20 18:08:58,656 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 71 transitions. [2022-02-20 18:08:58,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:08:58,657 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:08:58,657 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:08:58,657 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:08:58,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 50 states have internal predecessors, (59), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 18:08:58,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 71 transitions. [2022-02-20 18:08:58,660 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 71 transitions. Word has length 30 [2022-02-20 18:08:58,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:08:58,660 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 71 transitions. [2022-02-20 18:08:58,661 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:58,661 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 71 transitions. [2022-02-20 18:08:58,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-02-20 18:08:58,662 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:08:58,662 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,662 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:08:58,662 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:08:58,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:08:58,663 INFO L85 PathProgramCache]: Analyzing trace with hash 185331922, now seen corresponding path program 1 times [2022-02-20 18:08:58,663 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:08:58,663 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512908062] [2022-02-20 18:08:58,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:08:58,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:08:58,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:08:58,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-02-20 18:08:58,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:08:58,728 INFO L290 TraceCheckUtils]: 0: Hoare triple {1222#true} assume true; {1222#true} is VALID [2022-02-20 18:08:58,729 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {1222#true} {1224#(= ~waterLevel~0 1)} #201#return; {1224#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:58,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-02-20 18:08:58,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:08:58,734 INFO L290 TraceCheckUtils]: 0: Hoare triple {1222#true} havoc ~retValue_acc~3;~retValue_acc~3 := ~methaneLevelCritical~0;#res := ~retValue_acc~3; {1222#true} is VALID [2022-02-20 18:08:58,734 INFO L290 TraceCheckUtils]: 1: Hoare triple {1222#true} assume true; {1222#true} is VALID [2022-02-20 18:08:58,735 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1222#true} {1224#(= ~waterLevel~0 1)} #203#return; {1224#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:58,735 INFO L290 TraceCheckUtils]: 0: Hoare triple {1222#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;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~cleanupTimeShifts~0 := 4;~pumpRunning~0 := 0;~systemActive~0 := 1; {1224#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:58,736 INFO L290 TraceCheckUtils]: 1: Hoare triple {1224#(= ~waterLevel~0 1)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret36#1, main_~retValue_acc~8#1, main_~tmp~4#1;havoc main_~retValue_acc~8#1;havoc main_~tmp~4#1;assume { :begin_inline_select_helpers } true; {1224#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:58,736 INFO L290 TraceCheckUtils]: 2: Hoare triple {1224#(= ~waterLevel~0 1)} assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; {1224#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:58,737 INFO L290 TraceCheckUtils]: 3: Hoare triple {1224#(= ~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~7#1;havoc valid_product_~retValue_acc~7#1;valid_product_~retValue_acc~7#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~7#1; {1224#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:58,737 INFO L290 TraceCheckUtils]: 4: Hoare triple {1224#(= ~waterLevel~0 1)} main_#t~ret36#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;assume -2147483648 <= main_#t~ret36#1 && main_#t~ret36#1 <= 2147483647;main_~tmp~4#1 := main_#t~ret36#1;havoc main_#t~ret36#1; {1224#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:58,737 INFO L290 TraceCheckUtils]: 5: Hoare triple {1224#(= ~waterLevel~0 1)} assume 0 != main_~tmp~4#1;assume { :begin_inline_setup } true; {1224#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:58,738 INFO L290 TraceCheckUtils]: 6: Hoare triple {1224#(= ~waterLevel~0 1)} assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;havoc test_#t~nondet49#1, test_#t~nondet50#1, test_#t~nondet51#1, test_#t~nondet52#1, test_~splverifierCounter~0#1, test_~tmp~8#1, test_~tmp___0~2#1, test_~tmp___1~1#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~8#1;havoc test_~tmp___0~2#1;havoc test_~tmp___1~1#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0; {1224#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:58,738 INFO L290 TraceCheckUtils]: 7: Hoare triple {1224#(= ~waterLevel~0 1)} assume !false; {1224#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:58,739 INFO L290 TraceCheckUtils]: 8: Hoare triple {1224#(= ~waterLevel~0 1)} assume test_~splverifierCounter~0#1 < 4; {1224#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:58,739 INFO L290 TraceCheckUtils]: 9: Hoare triple {1224#(= ~waterLevel~0 1)} assume -2147483648 <= test_#t~nondet49#1 && test_#t~nondet49#1 <= 2147483647;test_~tmp~8#1 := test_#t~nondet49#1;havoc test_#t~nondet49#1; {1224#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:58,740 INFO L290 TraceCheckUtils]: 10: Hoare triple {1224#(= ~waterLevel~0 1)} assume !(0 != test_~tmp~8#1); {1224#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:58,740 INFO L290 TraceCheckUtils]: 11: Hoare triple {1224#(= ~waterLevel~0 1)} assume -2147483648 <= test_#t~nondet50#1 && test_#t~nondet50#1 <= 2147483647;test_~tmp___0~2#1 := test_#t~nondet50#1;havoc test_#t~nondet50#1; {1224#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:58,741 INFO L290 TraceCheckUtils]: 12: Hoare triple {1224#(= ~waterLevel~0 1)} assume !(0 != test_~tmp___0~2#1); {1224#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:58,741 INFO L290 TraceCheckUtils]: 13: Hoare triple {1224#(= ~waterLevel~0 1)} assume -2147483648 <= test_#t~nondet51#1 && test_#t~nondet51#1 <= 2147483647;test_~tmp___2~0#1 := test_#t~nondet51#1;havoc test_#t~nondet51#1; {1224#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:58,741 INFO L290 TraceCheckUtils]: 14: Hoare triple {1224#(= ~waterLevel~0 1)} assume 0 != test_~tmp___2~0#1; {1224#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:58,742 INFO L272 TraceCheckUtils]: 15: Hoare triple {1224#(= ~waterLevel~0 1)} call timeShift(); {1224#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:58,742 INFO L290 TraceCheckUtils]: 16: Hoare triple {1224#(= ~waterLevel~0 1)} assume !(0 != ~pumpRunning~0); {1224#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:58,743 INFO L290 TraceCheckUtils]: 17: Hoare triple {1224#(= ~waterLevel~0 1)} assume 0 != ~systemActive~0;assume { :begin_inline_processEnvironment } true;havoc processEnvironment_#t~ret37#1, processEnvironment_~tmp~5#1;havoc processEnvironment_~tmp~5#1; {1224#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:58,743 INFO L290 TraceCheckUtils]: 18: Hoare triple {1224#(= ~waterLevel~0 1)} assume !(0 != ~pumpRunning~0); {1224#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:58,744 INFO L272 TraceCheckUtils]: 19: Hoare triple {1224#(= ~waterLevel~0 1)} call processEnvironment__wrappee__base(); {1222#true} is VALID [2022-02-20 18:08:58,744 INFO L290 TraceCheckUtils]: 20: Hoare triple {1222#true} assume true; {1222#true} is VALID [2022-02-20 18:08:58,744 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1222#true} {1224#(= ~waterLevel~0 1)} #201#return; {1224#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:58,745 INFO L290 TraceCheckUtils]: 22: Hoare triple {1224#(= ~waterLevel~0 1)} assume { :end_inline_processEnvironment } true; {1224#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:58,745 INFO L290 TraceCheckUtils]: 23: Hoare triple {1224#(= ~waterLevel~0 1)} assume { :begin_inline___utac_acc__Specification3_spec__1 } true;havoc __utac_acc__Specification3_spec__1_#t~ret4#1, __utac_acc__Specification3_spec__1_#t~ret5#1, __utac_acc__Specification3_spec__1_#t~ret6#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; {1224#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:58,745 INFO L272 TraceCheckUtils]: 24: Hoare triple {1224#(= ~waterLevel~0 1)} call __utac_acc__Specification3_spec__1_#t~ret4#1 := isMethaneLevelCritical(); {1222#true} is VALID [2022-02-20 18:08:58,746 INFO L290 TraceCheckUtils]: 25: Hoare triple {1222#true} havoc ~retValue_acc~3;~retValue_acc~3 := ~methaneLevelCritical~0;#res := ~retValue_acc~3; {1222#true} is VALID [2022-02-20 18:08:58,746 INFO L290 TraceCheckUtils]: 26: Hoare triple {1222#true} assume true; {1222#true} is VALID [2022-02-20 18:08:58,747 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1222#true} {1224#(= ~waterLevel~0 1)} #203#return; {1224#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:58,747 INFO L290 TraceCheckUtils]: 28: Hoare triple {1224#(= ~waterLevel~0 1)} assume -2147483648 <= __utac_acc__Specification3_spec__1_#t~ret4#1 && __utac_acc__Specification3_spec__1_#t~ret4#1 <= 2147483647;__utac_acc__Specification3_spec__1_~tmp~0#1 := __utac_acc__Specification3_spec__1_#t~ret4#1;havoc __utac_acc__Specification3_spec__1_#t~ret4#1; {1224#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:08:58,748 INFO L290 TraceCheckUtils]: 29: Hoare triple {1224#(= ~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~4#1;havoc getWaterLevel_~retValue_acc~4#1;getWaterLevel_~retValue_acc~4#1 := ~waterLevel~0;getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~4#1; {1230#(= |timeShift_getWaterLevel_#res#1| 1)} is VALID [2022-02-20 18:08:58,748 INFO L290 TraceCheckUtils]: 30: Hoare triple {1230#(= |timeShift_getWaterLevel_#res#1| 1)} __utac_acc__Specification3_spec__1_#t~ret5#1 := getWaterLevel_#res#1;assume { :end_inline_getWaterLevel } true;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~0#1 := __utac_acc__Specification3_spec__1_#t~ret5#1;havoc __utac_acc__Specification3_spec__1_#t~ret5#1; {1231#(= |timeShift___utac_acc__Specification3_spec__1_~tmp___0~0#1| 1)} is VALID [2022-02-20 18:08:58,749 INFO L290 TraceCheckUtils]: 31: Hoare triple {1231#(= |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; {1223#false} is VALID [2022-02-20 18:08:58,749 INFO L290 TraceCheckUtils]: 32: Hoare triple {1223#false} __utac_acc__Specification3_spec__1_#t~ret6#1 := isPumpRunning_#res#1;assume { :end_inline_isPumpRunning } 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___1~0#1 := __utac_acc__Specification3_spec__1_#t~ret6#1;havoc __utac_acc__Specification3_spec__1_#t~ret6#1; {1223#false} is VALID [2022-02-20 18:08:58,749 INFO L290 TraceCheckUtils]: 33: Hoare triple {1223#false} assume !(0 != __utac_acc__Specification3_spec__1_~tmp___1~0#1);assume { :begin_inline___automaton_fail } true; {1223#false} is VALID [2022-02-20 18:08:58,749 INFO L290 TraceCheckUtils]: 34: Hoare triple {1223#false} assume !false; {1223#false} is VALID [2022-02-20 18:08:58,750 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,750 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:08:58,750 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512908062] [2022-02-20 18:08:58,750 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512908062] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:08:58,751 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:08:58,751 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:08:58,751 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266527064] [2022-02-20 18:08:58,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:08:58,752 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:58,752 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:08:58,752 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:58,779 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:58,779 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:08:58,779 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:08:58,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:08:58,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:08:58,781 INFO L87 Difference]: Start difference. First operand 57 states and 71 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:58,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:08:58,985 INFO L93 Difference]: Finished difference Result 153 states and 199 transitions. [2022-02-20 18:08:58,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:08:58,986 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:58,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:08:58,986 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:58,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 199 transitions. [2022-02-20 18:08:58,990 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:58,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 199 transitions. [2022-02-20 18:08:58,993 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 199 transitions. [2022-02-20 18:08:59,165 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 199 edges. 199 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:08:59,172 INFO L225 Difference]: With dead ends: 153 [2022-02-20 18:08:59,174 INFO L226 Difference]: Without dead ends: 103 [2022-02-20 18:08:59,176 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:59,185 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 42 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 277 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,187 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 277 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,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-02-20 18:08:59,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 100. [2022-02-20 18:08:59,202 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:08:59,203 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand has 100 states, 78 states have (on average 1.3076923076923077) internal successors, (102), 86 states have internal predecessors, (102), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (13), 9 states have call predecessors, (13), 12 states have call successors, (13) [2022-02-20 18:08:59,204 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand has 100 states, 78 states have (on average 1.3076923076923077) internal successors, (102), 86 states have internal predecessors, (102), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (13), 9 states have call predecessors, (13), 12 states have call successors, (13) [2022-02-20 18:08:59,205 INFO L87 Difference]: Start difference. First operand 103 states. Second operand has 100 states, 78 states have (on average 1.3076923076923077) internal successors, (102), 86 states have internal predecessors, (102), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (13), 9 states have call predecessors, (13), 12 states have call successors, (13) [2022-02-20 18:08:59,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:08:59,209 INFO L93 Difference]: Finished difference Result 103 states and 130 transitions. [2022-02-20 18:08:59,209 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 130 transitions. [2022-02-20 18:08:59,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:08:59,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:08:59,212 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 78 states have (on average 1.3076923076923077) internal successors, (102), 86 states have internal predecessors, (102), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (13), 9 states have call predecessors, (13), 12 states have call successors, (13) Second operand 103 states. [2022-02-20 18:08:59,212 INFO L87 Difference]: Start difference. First operand has 100 states, 78 states have (on average 1.3076923076923077) internal successors, (102), 86 states have internal predecessors, (102), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (13), 9 states have call predecessors, (13), 12 states have call successors, (13) Second operand 103 states. [2022-02-20 18:08:59,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:08:59,218 INFO L93 Difference]: Finished difference Result 103 states and 130 transitions. [2022-02-20 18:08:59,219 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 130 transitions. [2022-02-20 18:08:59,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:08:59,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:08:59,219 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:08:59,219 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:08:59,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 78 states have (on average 1.3076923076923077) internal successors, (102), 86 states have internal predecessors, (102), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (13), 9 states have call predecessors, (13), 12 states have call successors, (13) [2022-02-20 18:08:59,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 127 transitions. [2022-02-20 18:08:59,224 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 127 transitions. Word has length 35 [2022-02-20 18:08:59,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:08:59,225 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 127 transitions. [2022-02-20 18:08:59,225 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:59,225 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 127 transitions. [2022-02-20 18:08:59,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-02-20 18:08:59,228 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:08:59,228 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:59,228 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:08:59,228 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:08:59,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:08:59,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1701903188, now seen corresponding path program 1 times [2022-02-20 18:08:59,229 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:08:59,229 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592643266] [2022-02-20 18:08:59,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:08:59,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:08:59,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 18:08:59,270 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 18:08:59,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 18:08:59,306 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 18:08:59,307 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 18:08:59,307 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 18:08:59,309 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:08:59,312 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-02-20 18:08:59,315 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 18:08:59,334 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call waterRise(); [2022-02-20 18:08:59,335 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:59,338 INFO L158 Benchmark]: Toolchain (without parser) took 3499.00ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 60.8MB in the beginning and 48.9MB in the end (delta: 11.9MB). Peak memory consumption was 32.5MB. Max. memory is 16.1GB. [2022-02-20 18:08:59,338 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 96.5MB. Free memory was 71.0MB in the beginning and 71.0MB in the end (delta: 30.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 18:08:59,339 INFO L158 Benchmark]: CACSL2BoogieTranslator took 387.44ms. Allocated memory is still 96.5MB. Free memory was 60.5MB in the beginning and 62.4MB in the end (delta: -2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 18:08:59,339 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.75ms. Allocated memory is still 96.5MB. Free memory was 62.4MB in the beginning and 59.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 18:08:59,339 INFO L158 Benchmark]: Boogie Preprocessor took 65.35ms. Allocated memory is still 96.5MB. Free memory was 59.9MB in the beginning and 58.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 18:08:59,340 INFO L158 Benchmark]: RCFGBuilder took 452.80ms. Allocated memory is still 96.5MB. Free memory was 58.3MB in the beginning and 39.0MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-02-20 18:08:59,340 INFO L158 Benchmark]: TraceAbstraction took 2496.69ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 38.5MB in the beginning and 48.9MB in the end (delta: -10.4MB). Peak memory consumption was 12.2MB. Max. memory is 16.1GB. [2022-02-20 18:08:59,341 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.22ms. Allocated memory is still 96.5MB. Free memory was 71.0MB in the beginning and 71.0MB in the end (delta: 30.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 387.44ms. Allocated memory is still 96.5MB. Free memory was 60.5MB in the beginning and 62.4MB in the end (delta: -2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.75ms. Allocated memory is still 96.5MB. Free memory was 62.4MB in the beginning and 59.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.35ms. Allocated memory is still 96.5MB. Free memory was 59.9MB in the beginning and 58.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 452.80ms. Allocated memory is still 96.5MB. Free memory was 58.3MB in the beginning and 39.0MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 2496.69ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 38.5MB in the beginning and 48.9MB in the end (delta: -10.4MB). Peak memory consumption was 12.2MB. 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:59,424 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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_product25.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 5af7a19aabc47c6ad0d023db96d81a1e5e3db737faffc67c3935346aa9890fbf --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:09:01,510 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:09:01,514 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:09:01,559 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:09:01,560 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:09:01,563 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:09:01,565 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:09:01,570 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:09:01,573 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:09:01,578 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:09:01,588 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:09:01,592 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:09:01,593 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:09:01,596 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:09:01,597 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:09:01,600 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:09:01,601 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:09:01,602 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:09:01,605 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:09:01,613 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:09:01,616 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:09:01,618 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:09:01,619 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:09:01,621 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:09:01,627 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:09:01,627 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:09:01,627 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:09:01,629 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:09:01,630 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:09:01,630 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:09:01,631 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:09:01,631 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:09:01,633 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:09:01,634 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:09:01,635 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:09:01,635 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:09:01,636 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:09:01,636 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:09:01,636 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:09:01,638 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:09:01,639 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:09:01,639 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:09:01,679 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:09:01,680 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:09:01,681 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:09:01,681 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:09:01,682 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:09:01,683 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:09:01,684 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:09:01,684 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:09:01,685 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:09:01,685 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:09:01,686 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:09:01,686 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:09:01,686 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:09:01,686 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:09:01,687 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:09:01,687 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:09:01,687 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 18:09:01,687 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 18:09:01,687 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 18:09:01,688 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:09:01,688 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:09:01,688 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:09:01,688 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:09:01,689 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:09:01,689 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:09:01,689 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:09:01,689 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:09:01,690 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:09:01,690 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:09:01,690 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:09:01,690 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 18:09:01,690 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 18:09:01,691 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:09:01,691 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:09:01,691 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:09:01,692 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 18:09:01,692 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 -> 5af7a19aabc47c6ad0d023db96d81a1e5e3db737faffc67c3935346aa9890fbf [2022-02-20 18:09:02,046 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:09:02,082 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:09:02,084 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:09:02,086 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:09:02,086 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:09:02,088 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec3_product25.cil.c [2022-02-20 18:09:02,164 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcd05e82d/9e7423b2338945ca9dab4a36117d1749/FLAGa37274db5 [2022-02-20 18:09:02,674 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:09:02,677 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec3_product25.cil.c [2022-02-20 18:09:02,695 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcd05e82d/9e7423b2338945ca9dab4a36117d1749/FLAGa37274db5 [2022-02-20 18:09:03,046 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcd05e82d/9e7423b2338945ca9dab4a36117d1749 [2022-02-20 18:09:03,049 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:09:03,050 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:09:03,053 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:09:03,054 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:09:03,057 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:09:03,058 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:09:03" (1/1) ... [2022-02-20 18:09:03,059 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35b6fd24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:09:03, skipping insertion in model container [2022-02-20 18:09:03,060 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:09:03" (1/1) ... [2022-02-20 18:09:03,068 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:09:03,117 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:09:03,324 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_product25.cil.c[2191,2204] [2022-02-20 18:09:03,444 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:09:03,454 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-02-20 18:09:03,461 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:09:03,466 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_product25.cil.c[2191,2204] [2022-02-20 18:09:03,511 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:09:03,526 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:09:03,540 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_product25.cil.c[2191,2204] [2022-02-20 18:09:03,618 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:09:03,643 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:09:03,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:09:03 WrapperNode [2022-02-20 18:09:03,644 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:09:03,645 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:09:03,645 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:09:03,646 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:09:03,652 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:09:03" (1/1) ... [2022-02-20 18:09:03,676 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:09:03" (1/1) ... [2022-02-20 18:09:03,707 INFO L137 Inliner]: procedures = 55, calls = 152, calls flagged for inlining = 22, calls inlined = 17, statements flattened = 215 [2022-02-20 18:09:03,708 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:09:03,709 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:09:03,709 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:09:03,709 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:09:03,717 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:09:03" (1/1) ... [2022-02-20 18:09:03,717 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:09:03" (1/1) ... [2022-02-20 18:09:03,720 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:09:03" (1/1) ... [2022-02-20 18:09:03,720 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:09:03" (1/1) ... [2022-02-20 18:09:03,730 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:09:03" (1/1) ... [2022-02-20 18:09:03,734 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:09:03" (1/1) ... [2022-02-20 18:09:03,736 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:09:03" (1/1) ... [2022-02-20 18:09:03,739 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:09:03,740 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:09:03,740 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:09:03,740 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:09:03,741 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:09:03" (1/1) ... [2022-02-20 18:09:03,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:09:03,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:09:03,768 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:09:03,799 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:09:03,830 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:09:03,830 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2022-02-20 18:09:03,831 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2022-02-20 18:09:03,831 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2022-02-20 18:09:03,831 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2022-02-20 18:09:03,832 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2022-02-20 18:09:03,832 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2022-02-20 18:09:03,832 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2022-02-20 18:09:03,832 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2022-02-20 18:09:03,832 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2022-02-20 18:09:03,832 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2022-02-20 18:09:03,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 18:09:03,833 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2022-02-20 18:09:03,833 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2022-02-20 18:09:03,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:09:03,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:09:03,918 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:09:03,920 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:09:04,197 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:09:04,210 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:09:04,214 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 18:09:04,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:09:04 BoogieIcfgContainer [2022-02-20 18:09:04,217 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:09:04,225 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:09:04,225 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:09:04,228 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:09:04,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:09:03" (1/3) ... [2022-02-20 18:09:04,229 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70ef43aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:09:04, skipping insertion in model container [2022-02-20 18:09:04,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:09:03" (2/3) ... [2022-02-20 18:09:04,229 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70ef43aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:09:04, skipping insertion in model container [2022-02-20 18:09:04,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:09:04" (3/3) ... [2022-02-20 18:09:04,231 INFO L111 eAbstractionObserver]: Analyzing ICFG minepump_spec3_product25.cil.c [2022-02-20 18:09:04,236 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:09:04,237 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:09:04,282 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:09:04,288 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:09:04,288 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:09:04,305 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 58 states have (on average 1.396551724137931) internal successors, (81), 64 states have internal predecessors, (81), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 18:09:04,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 18:09:04,311 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:09:04,312 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:09:04,313 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:09:04,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:09:04,317 INFO L85 PathProgramCache]: Analyzing trace with hash 234388957, now seen corresponding path program 1 times [2022-02-20 18:09:04,328 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 18:09:04,329 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1910818882] [2022-02-20 18:09:04,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:09:04,329 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 18:09:04,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 18:09:04,332 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:09:04,344 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:09:04,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:09:04,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 18:09:04,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:09:04,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:09:04,622 INFO L290 TraceCheckUtils]: 0: Hoare triple {78#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;~waterLevel~0 := 1bv32;~methaneLevelCritical~0 := 0bv32;~cleanupTimeShifts~0 := 4bv32;~pumpRunning~0 := 0bv32;~systemActive~0 := 1bv32; {78#true} is VALID [2022-02-20 18:09:04,629 INFO L290 TraceCheckUtils]: 1: Hoare triple {78#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret36#1, main_~retValue_acc~8#1, main_~tmp~4#1;havoc main_~retValue_acc~8#1;havoc main_~tmp~4#1;assume { :begin_inline_select_helpers } true; {78#true} is VALID [2022-02-20 18:09:04,630 INFO L290 TraceCheckUtils]: 2: Hoare triple {78#true} assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; {78#true} is VALID [2022-02-20 18:09:04,630 INFO L290 TraceCheckUtils]: 3: Hoare triple {78#true} assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~7#1;havoc valid_product_~retValue_acc~7#1;valid_product_~retValue_acc~7#1 := 1bv32;valid_product_#res#1 := valid_product_~retValue_acc~7#1; {78#true} is VALID [2022-02-20 18:09:04,630 INFO L290 TraceCheckUtils]: 4: Hoare triple {78#true} main_#t~ret36#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;main_~tmp~4#1 := main_#t~ret36#1;havoc main_#t~ret36#1; {78#true} is VALID [2022-02-20 18:09:04,630 INFO L290 TraceCheckUtils]: 5: Hoare triple {78#true} assume 0bv32 != main_~tmp~4#1;assume { :begin_inline_setup } true; {78#true} is VALID [2022-02-20 18:09:04,630 INFO L290 TraceCheckUtils]: 6: Hoare triple {78#true} assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;havoc test_#t~nondet49#1, test_#t~nondet50#1, test_#t~nondet51#1, test_#t~nondet52#1, test_~splverifierCounter~0#1, test_~tmp~8#1, test_~tmp___0~2#1, test_~tmp___1~1#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~8#1;havoc test_~tmp___0~2#1;havoc test_~tmp___1~1#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0bv32; {78#true} is VALID [2022-02-20 18:09:04,631 INFO L290 TraceCheckUtils]: 7: Hoare triple {78#true} assume !true; {79#false} is VALID [2022-02-20 18:09:04,632 INFO L272 TraceCheckUtils]: 8: Hoare triple {79#false} call cleanup(); {79#false} is VALID [2022-02-20 18:09:04,632 INFO L290 TraceCheckUtils]: 9: Hoare triple {79#false} havoc ~i~0;havoc ~__cil_tmp2~0; {79#false} is VALID [2022-02-20 18:09:04,632 INFO L272 TraceCheckUtils]: 10: Hoare triple {79#false} call timeShift(); {79#false} is VALID [2022-02-20 18:09:04,632 INFO L290 TraceCheckUtils]: 11: Hoare triple {79#false} assume !(0bv32 != ~pumpRunning~0); {79#false} is VALID [2022-02-20 18:09:04,632 INFO L290 TraceCheckUtils]: 12: Hoare triple {79#false} assume !(0bv32 != ~systemActive~0); {79#false} is VALID [2022-02-20 18:09:04,633 INFO L290 TraceCheckUtils]: 13: Hoare triple {79#false} assume { :begin_inline___utac_acc__Specification3_spec__1 } true;havoc __utac_acc__Specification3_spec__1_#t~ret4#1, __utac_acc__Specification3_spec__1_#t~ret5#1, __utac_acc__Specification3_spec__1_#t~ret6#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; {79#false} is VALID [2022-02-20 18:09:04,633 INFO L272 TraceCheckUtils]: 14: Hoare triple {79#false} call __utac_acc__Specification3_spec__1_#t~ret4#1 := isMethaneLevelCritical(); {79#false} is VALID [2022-02-20 18:09:04,633 INFO L290 TraceCheckUtils]: 15: Hoare triple {79#false} havoc ~retValue_acc~3;~retValue_acc~3 := ~methaneLevelCritical~0;#res := ~retValue_acc~3; {79#false} is VALID [2022-02-20 18:09:04,633 INFO L290 TraceCheckUtils]: 16: Hoare triple {79#false} assume true; {79#false} is VALID [2022-02-20 18:09:04,633 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {79#false} {79#false} #203#return; {79#false} is VALID [2022-02-20 18:09:04,634 INFO L290 TraceCheckUtils]: 18: Hoare triple {79#false} __utac_acc__Specification3_spec__1_~tmp~0#1 := __utac_acc__Specification3_spec__1_#t~ret4#1;havoc __utac_acc__Specification3_spec__1_#t~ret4#1; {79#false} is VALID [2022-02-20 18:09:04,634 INFO L290 TraceCheckUtils]: 19: Hoare triple {79#false} assume !(0bv32 != __utac_acc__Specification3_spec__1_~tmp~0#1);assume { :begin_inline_getWaterLevel } true;havoc getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~4#1;havoc getWaterLevel_~retValue_acc~4#1;getWaterLevel_~retValue_acc~4#1 := ~waterLevel~0;getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~4#1; {79#false} is VALID [2022-02-20 18:09:04,634 INFO L290 TraceCheckUtils]: 20: Hoare triple {79#false} __utac_acc__Specification3_spec__1_#t~ret5#1 := getWaterLevel_#res#1;assume { :end_inline_getWaterLevel } true;__utac_acc__Specification3_spec__1_~tmp___0~0#1 := __utac_acc__Specification3_spec__1_#t~ret5#1;havoc __utac_acc__Specification3_spec__1_#t~ret5#1; {79#false} is VALID [2022-02-20 18:09:04,634 INFO L290 TraceCheckUtils]: 21: Hoare triple {79#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; {79#false} is VALID [2022-02-20 18:09:04,634 INFO L290 TraceCheckUtils]: 22: Hoare triple {79#false} __utac_acc__Specification3_spec__1_#t~ret6#1 := isPumpRunning_#res#1;assume { :end_inline_isPumpRunning } true;__utac_acc__Specification3_spec__1_~tmp___1~0#1 := __utac_acc__Specification3_spec__1_#t~ret6#1;havoc __utac_acc__Specification3_spec__1_#t~ret6#1; {79#false} is VALID [2022-02-20 18:09:04,635 INFO L290 TraceCheckUtils]: 23: Hoare triple {79#false} assume !(0bv32 != __utac_acc__Specification3_spec__1_~tmp___1~0#1);assume { :begin_inline___automaton_fail } true; {79#false} is VALID [2022-02-20 18:09:04,635 INFO L290 TraceCheckUtils]: 24: Hoare triple {79#false} assume !false; {79#false} is VALID [2022-02-20 18:09:04,636 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:04,636 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 18:09:04,637 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 18:09:04,637 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1910818882] [2022-02-20 18:09:04,637 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1910818882] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:09:04,637 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:09:04,638 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 18:09:04,639 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18850144] [2022-02-20 18:09:04,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:09:04,644 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:09:04,645 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:09:04,648 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:09:04,687 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:09:04,688 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 18:09:04,688 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 18:09:04,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 18:09:04,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 18:09:04,707 INFO L87 Difference]: Start difference. First operand has 75 states, 58 states have (on average 1.396551724137931) internal successors, (81), 64 states have internal predecessors, (81), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) 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:09:04,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:09:04,805 INFO L93 Difference]: Finished difference Result 142 states and 193 transitions. [2022-02-20 18:09:04,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 18:09:04,806 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:09:04,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:09:04,807 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:09:04,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 193 transitions. [2022-02-20 18:09:04,818 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:09:04,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 193 transitions. [2022-02-20 18:09:04,830 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 193 transitions. [2022-02-20 18:09:04,984 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 193 edges. 193 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:09:05,000 INFO L225 Difference]: With dead ends: 142 [2022-02-20 18:09:05,001 INFO L226 Difference]: Without dead ends: 66 [2022-02-20 18:09:05,004 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:09:05,007 INFO L933 BasicCegarLoop]: 93 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, 93 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:09:05,011 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:09:05,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-02-20 18:09:05,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-02-20 18:09:05,040 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:09:05,041 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 66 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 56 states have internal predecessors, (67), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 18:09:05,042 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 66 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 56 states have internal predecessors, (67), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 18:09:05,043 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 66 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 56 states have internal predecessors, (67), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 18:09:05,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:09:05,048 INFO L93 Difference]: Finished difference Result 66 states and 84 transitions. [2022-02-20 18:09:05,048 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2022-02-20 18:09:05,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:09:05,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:09:05,050 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 56 states have internal predecessors, (67), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 66 states. [2022-02-20 18:09:05,051 INFO L87 Difference]: Start difference. First operand has 66 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 56 states have internal predecessors, (67), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 66 states. [2022-02-20 18:09:05,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:09:05,056 INFO L93 Difference]: Finished difference Result 66 states and 84 transitions. [2022-02-20 18:09:05,056 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2022-02-20 18:09:05,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:09:05,057 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:09:05,057 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:09:05,057 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:09:05,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 56 states have internal predecessors, (67), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 18:09:05,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 84 transitions. [2022-02-20 18:09:05,063 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 84 transitions. Word has length 25 [2022-02-20 18:09:05,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:09:05,063 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 84 transitions. [2022-02-20 18:09:05,064 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:09:05,064 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2022-02-20 18:09:05,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 18:09:05,065 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:09:05,066 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:09:05,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-02-20 18:09:05,275 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:09:05,277 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:09:05,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:09:05,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1566921044, now seen corresponding path program 1 times [2022-02-20 18:09:05,279 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 18:09:05,280 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [820174612] [2022-02-20 18:09:05,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:09:05,280 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 18:09:05,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 18:09:05,282 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:09:05,284 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:09:05,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:09:05,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 18:09:05,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:09:05,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:09:05,496 INFO L290 TraceCheckUtils]: 0: Hoare triple {586#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;~waterLevel~0 := 1bv32;~methaneLevelCritical~0 := 0bv32;~cleanupTimeShifts~0 := 4bv32;~pumpRunning~0 := 0bv32;~systemActive~0 := 1bv32; {586#true} is VALID [2022-02-20 18:09:05,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {586#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret36#1, main_~retValue_acc~8#1, main_~tmp~4#1;havoc main_~retValue_acc~8#1;havoc main_~tmp~4#1;assume { :begin_inline_select_helpers } true; {586#true} is VALID [2022-02-20 18:09:05,496 INFO L290 TraceCheckUtils]: 2: Hoare triple {586#true} assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; {586#true} is VALID [2022-02-20 18:09:05,497 INFO L290 TraceCheckUtils]: 3: Hoare triple {586#true} assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~7#1;havoc valid_product_~retValue_acc~7#1;valid_product_~retValue_acc~7#1 := 1bv32;valid_product_#res#1 := valid_product_~retValue_acc~7#1; {586#true} is VALID [2022-02-20 18:09:05,497 INFO L290 TraceCheckUtils]: 4: Hoare triple {586#true} main_#t~ret36#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;main_~tmp~4#1 := main_#t~ret36#1;havoc main_#t~ret36#1; {586#true} is VALID [2022-02-20 18:09:05,497 INFO L290 TraceCheckUtils]: 5: Hoare triple {586#true} assume 0bv32 != main_~tmp~4#1;assume { :begin_inline_setup } true; {586#true} is VALID [2022-02-20 18:09:05,498 INFO L290 TraceCheckUtils]: 6: Hoare triple {586#true} assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;havoc test_#t~nondet49#1, test_#t~nondet50#1, test_#t~nondet51#1, test_#t~nondet52#1, test_~splverifierCounter~0#1, test_~tmp~8#1, test_~tmp___0~2#1, test_~tmp___1~1#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~8#1;havoc test_~tmp___0~2#1;havoc test_~tmp___1~1#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0bv32; {609#(= |ULTIMATE.start_test_~splverifierCounter~0#1| (_ bv0 32))} is VALID [2022-02-20 18:09:05,498 INFO L290 TraceCheckUtils]: 7: Hoare triple {609#(= |ULTIMATE.start_test_~splverifierCounter~0#1| (_ bv0 32))} assume !false; {609#(= |ULTIMATE.start_test_~splverifierCounter~0#1| (_ bv0 32))} is VALID [2022-02-20 18:09:05,499 INFO L290 TraceCheckUtils]: 8: Hoare triple {609#(= |ULTIMATE.start_test_~splverifierCounter~0#1| (_ bv0 32))} assume !~bvslt32(test_~splverifierCounter~0#1, 4bv32); {587#false} is VALID [2022-02-20 18:09:05,499 INFO L272 TraceCheckUtils]: 9: Hoare triple {587#false} call cleanup(); {587#false} is VALID [2022-02-20 18:09:05,499 INFO L290 TraceCheckUtils]: 10: Hoare triple {587#false} havoc ~i~0;havoc ~__cil_tmp2~0; {587#false} is VALID [2022-02-20 18:09:05,500 INFO L272 TraceCheckUtils]: 11: Hoare triple {587#false} call timeShift(); {587#false} is VALID [2022-02-20 18:09:05,500 INFO L290 TraceCheckUtils]: 12: Hoare triple {587#false} assume !(0bv32 != ~pumpRunning~0); {587#false} is VALID [2022-02-20 18:09:05,500 INFO L290 TraceCheckUtils]: 13: Hoare triple {587#false} assume !(0bv32 != ~systemActive~0); {587#false} is VALID [2022-02-20 18:09:05,501 INFO L290 TraceCheckUtils]: 14: Hoare triple {587#false} assume { :begin_inline___utac_acc__Specification3_spec__1 } true;havoc __utac_acc__Specification3_spec__1_#t~ret4#1, __utac_acc__Specification3_spec__1_#t~ret5#1, __utac_acc__Specification3_spec__1_#t~ret6#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; {587#false} is VALID [2022-02-20 18:09:05,501 INFO L272 TraceCheckUtils]: 15: Hoare triple {587#false} call __utac_acc__Specification3_spec__1_#t~ret4#1 := isMethaneLevelCritical(); {587#false} is VALID [2022-02-20 18:09:05,501 INFO L290 TraceCheckUtils]: 16: Hoare triple {587#false} havoc ~retValue_acc~3;~retValue_acc~3 := ~methaneLevelCritical~0;#res := ~retValue_acc~3; {587#false} is VALID [2022-02-20 18:09:05,501 INFO L290 TraceCheckUtils]: 17: Hoare triple {587#false} assume true; {587#false} is VALID [2022-02-20 18:09:05,502 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {587#false} {587#false} #203#return; {587#false} is VALID [2022-02-20 18:09:05,502 INFO L290 TraceCheckUtils]: 19: Hoare triple {587#false} __utac_acc__Specification3_spec__1_~tmp~0#1 := __utac_acc__Specification3_spec__1_#t~ret4#1;havoc __utac_acc__Specification3_spec__1_#t~ret4#1; {587#false} is VALID [2022-02-20 18:09:05,503 INFO L290 TraceCheckUtils]: 20: Hoare triple {587#false} assume !(0bv32 != __utac_acc__Specification3_spec__1_~tmp~0#1);assume { :begin_inline_getWaterLevel } true;havoc getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~4#1;havoc getWaterLevel_~retValue_acc~4#1;getWaterLevel_~retValue_acc~4#1 := ~waterLevel~0;getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~4#1; {587#false} is VALID [2022-02-20 18:09:05,503 INFO L290 TraceCheckUtils]: 21: Hoare triple {587#false} __utac_acc__Specification3_spec__1_#t~ret5#1 := getWaterLevel_#res#1;assume { :end_inline_getWaterLevel } true;__utac_acc__Specification3_spec__1_~tmp___0~0#1 := __utac_acc__Specification3_spec__1_#t~ret5#1;havoc __utac_acc__Specification3_spec__1_#t~ret5#1; {587#false} is VALID [2022-02-20 18:09:05,503 INFO L290 TraceCheckUtils]: 22: Hoare triple {587#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; {587#false} is VALID [2022-02-20 18:09:05,504 INFO L290 TraceCheckUtils]: 23: Hoare triple {587#false} __utac_acc__Specification3_spec__1_#t~ret6#1 := isPumpRunning_#res#1;assume { :end_inline_isPumpRunning } true;__utac_acc__Specification3_spec__1_~tmp___1~0#1 := __utac_acc__Specification3_spec__1_#t~ret6#1;havoc __utac_acc__Specification3_spec__1_#t~ret6#1; {587#false} is VALID [2022-02-20 18:09:05,507 INFO L290 TraceCheckUtils]: 24: Hoare triple {587#false} assume !(0bv32 != __utac_acc__Specification3_spec__1_~tmp___1~0#1);assume { :begin_inline___automaton_fail } true; {587#false} is VALID [2022-02-20 18:09:05,508 INFO L290 TraceCheckUtils]: 25: Hoare triple {587#false} assume !false; {587#false} is VALID [2022-02-20 18:09:05,508 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:05,508 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 18:09:05,509 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 18:09:05,509 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [820174612] [2022-02-20 18:09:05,509 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [820174612] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:09:05,509 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:09:05,510 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:09:05,513 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651156157] [2022-02-20 18:09:05,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:09:05,515 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:09:05,517 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:09:05,517 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:09:05,542 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:09:05,543 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:09:05,543 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 18:09:05,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:09:05,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:09:05,544 INFO L87 Difference]: Start difference. First operand 66 states and 84 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:09:05,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:09:05,655 INFO L93 Difference]: Finished difference Result 98 states and 124 transitions. [2022-02-20 18:09:05,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:09:05,656 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:09:05,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:09:05,656 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:09:05,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 124 transitions. [2022-02-20 18:09:05,660 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:09:05,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 124 transitions. [2022-02-20 18:09:05,663 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 124 transitions. [2022-02-20 18:09:05,778 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:09:05,781 INFO L225 Difference]: With dead ends: 98 [2022-02-20 18:09:05,781 INFO L226 Difference]: Without dead ends: 57 [2022-02-20 18:09:05,781 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:09:05,783 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 12 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 126 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:09:05,784 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 126 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:09:05,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-02-20 18:09:05,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-02-20 18:09:05,790 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:09:05,790 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 57 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 50 states have internal predecessors, (60), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 18:09:05,791 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 57 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 50 states have internal predecessors, (60), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 18:09:05,791 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 57 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 50 states have internal predecessors, (60), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 18:09:05,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:09:05,794 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2022-02-20 18:09:05,794 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 72 transitions. [2022-02-20 18:09:05,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:09:05,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:09:05,795 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 50 states have internal predecessors, (60), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 57 states. [2022-02-20 18:09:05,796 INFO L87 Difference]: Start difference. First operand has 57 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 50 states have internal predecessors, (60), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 57 states. [2022-02-20 18:09:05,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:09:05,798 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2022-02-20 18:09:05,798 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 72 transitions. [2022-02-20 18:09:05,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:09:05,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:09:05,799 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:09:05,799 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:09:05,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 50 states have internal predecessors, (60), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 18:09:05,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 72 transitions. [2022-02-20 18:09:05,802 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 72 transitions. Word has length 26 [2022-02-20 18:09:05,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:09:05,802 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 72 transitions. [2022-02-20 18:09:05,803 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:09:05,803 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 72 transitions. [2022-02-20 18:09:05,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 18:09:05,804 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:09:05,804 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:09:05,818 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:09:06,014 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:09:06,015 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:09:06,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:09:06,016 INFO L85 PathProgramCache]: Analyzing trace with hash 979553586, now seen corresponding path program 1 times [2022-02-20 18:09:06,016 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 18:09:06,016 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1980936795] [2022-02-20 18:09:06,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:09:06,016 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 18:09:06,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 18:09:06,018 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:09:06,020 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:09:06,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:09:06,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 18:09:06,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:09:06,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:09:06,176 INFO L290 TraceCheckUtils]: 0: Hoare triple {1002#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;~waterLevel~0 := 1bv32;~methaneLevelCritical~0 := 0bv32;~cleanupTimeShifts~0 := 4bv32;~pumpRunning~0 := 0bv32;~systemActive~0 := 1bv32; {1007#(= ~systemActive~0 (_ bv1 32))} is VALID [2022-02-20 18:09:06,178 INFO L290 TraceCheckUtils]: 1: Hoare triple {1007#(= ~systemActive~0 (_ bv1 32))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret36#1, main_~retValue_acc~8#1, main_~tmp~4#1;havoc main_~retValue_acc~8#1;havoc main_~tmp~4#1;assume { :begin_inline_select_helpers } true; {1007#(= ~systemActive~0 (_ bv1 32))} is VALID [2022-02-20 18:09:06,178 INFO L290 TraceCheckUtils]: 2: Hoare triple {1007#(= ~systemActive~0 (_ bv1 32))} assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; {1007#(= ~systemActive~0 (_ bv1 32))} is VALID [2022-02-20 18:09:06,179 INFO L290 TraceCheckUtils]: 3: Hoare triple {1007#(= ~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~7#1;havoc valid_product_~retValue_acc~7#1;valid_product_~retValue_acc~7#1 := 1bv32;valid_product_#res#1 := valid_product_~retValue_acc~7#1; {1007#(= ~systemActive~0 (_ bv1 32))} is VALID [2022-02-20 18:09:06,180 INFO L290 TraceCheckUtils]: 4: Hoare triple {1007#(= ~systemActive~0 (_ bv1 32))} main_#t~ret36#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;main_~tmp~4#1 := main_#t~ret36#1;havoc main_#t~ret36#1; {1007#(= ~systemActive~0 (_ bv1 32))} is VALID [2022-02-20 18:09:06,180 INFO L290 TraceCheckUtils]: 5: Hoare triple {1007#(= ~systemActive~0 (_ bv1 32))} assume 0bv32 != main_~tmp~4#1;assume { :begin_inline_setup } true; {1007#(= ~systemActive~0 (_ bv1 32))} is VALID [2022-02-20 18:09:06,181 INFO L290 TraceCheckUtils]: 6: Hoare triple {1007#(= ~systemActive~0 (_ bv1 32))} assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;havoc test_#t~nondet49#1, test_#t~nondet50#1, test_#t~nondet51#1, test_#t~nondet52#1, test_~splverifierCounter~0#1, test_~tmp~8#1, test_~tmp___0~2#1, test_~tmp___1~1#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~8#1;havoc test_~tmp___0~2#1;havoc test_~tmp___1~1#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0bv32; {1007#(= ~systemActive~0 (_ bv1 32))} is VALID [2022-02-20 18:09:06,181 INFO L290 TraceCheckUtils]: 7: Hoare triple {1007#(= ~systemActive~0 (_ bv1 32))} assume !false; {1007#(= ~systemActive~0 (_ bv1 32))} is VALID [2022-02-20 18:09:06,182 INFO L290 TraceCheckUtils]: 8: Hoare triple {1007#(= ~systemActive~0 (_ bv1 32))} assume ~bvslt32(test_~splverifierCounter~0#1, 4bv32); {1007#(= ~systemActive~0 (_ bv1 32))} is VALID [2022-02-20 18:09:06,182 INFO L290 TraceCheckUtils]: 9: Hoare triple {1007#(= ~systemActive~0 (_ bv1 32))} test_~tmp~8#1 := test_#t~nondet49#1;havoc test_#t~nondet49#1; {1007#(= ~systemActive~0 (_ bv1 32))} is VALID [2022-02-20 18:09:06,183 INFO L290 TraceCheckUtils]: 10: Hoare triple {1007#(= ~systemActive~0 (_ bv1 32))} assume !(0bv32 != test_~tmp~8#1); {1007#(= ~systemActive~0 (_ bv1 32))} is VALID [2022-02-20 18:09:06,183 INFO L290 TraceCheckUtils]: 11: Hoare triple {1007#(= ~systemActive~0 (_ bv1 32))} test_~tmp___0~2#1 := test_#t~nondet50#1;havoc test_#t~nondet50#1; {1007#(= ~systemActive~0 (_ bv1 32))} is VALID [2022-02-20 18:09:06,184 INFO L290 TraceCheckUtils]: 12: Hoare triple {1007#(= ~systemActive~0 (_ bv1 32))} assume !(0bv32 != test_~tmp___0~2#1); {1007#(= ~systemActive~0 (_ bv1 32))} is VALID [2022-02-20 18:09:06,184 INFO L290 TraceCheckUtils]: 13: Hoare triple {1007#(= ~systemActive~0 (_ bv1 32))} test_~tmp___2~0#1 := test_#t~nondet51#1;havoc test_#t~nondet51#1; {1007#(= ~systemActive~0 (_ bv1 32))} is VALID [2022-02-20 18:09:06,185 INFO L290 TraceCheckUtils]: 14: Hoare triple {1007#(= ~systemActive~0 (_ bv1 32))} assume 0bv32 != test_~tmp___2~0#1; {1007#(= ~systemActive~0 (_ bv1 32))} is VALID [2022-02-20 18:09:06,185 INFO L272 TraceCheckUtils]: 15: Hoare triple {1007#(= ~systemActive~0 (_ bv1 32))} call timeShift(); {1007#(= ~systemActive~0 (_ bv1 32))} is VALID [2022-02-20 18:09:06,186 INFO L290 TraceCheckUtils]: 16: Hoare triple {1007#(= ~systemActive~0 (_ bv1 32))} assume !(0bv32 != ~pumpRunning~0); {1007#(= ~systemActive~0 (_ bv1 32))} is VALID [2022-02-20 18:09:06,186 INFO L290 TraceCheckUtils]: 17: Hoare triple {1007#(= ~systemActive~0 (_ bv1 32))} assume !(0bv32 != ~systemActive~0); {1003#false} is VALID [2022-02-20 18:09:06,187 INFO L290 TraceCheckUtils]: 18: Hoare triple {1003#false} assume { :begin_inline___utac_acc__Specification3_spec__1 } true;havoc __utac_acc__Specification3_spec__1_#t~ret4#1, __utac_acc__Specification3_spec__1_#t~ret5#1, __utac_acc__Specification3_spec__1_#t~ret6#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; {1003#false} is VALID [2022-02-20 18:09:06,187 INFO L272 TraceCheckUtils]: 19: Hoare triple {1003#false} call __utac_acc__Specification3_spec__1_#t~ret4#1 := isMethaneLevelCritical(); {1003#false} is VALID [2022-02-20 18:09:06,187 INFO L290 TraceCheckUtils]: 20: Hoare triple {1003#false} havoc ~retValue_acc~3;~retValue_acc~3 := ~methaneLevelCritical~0;#res := ~retValue_acc~3; {1003#false} is VALID [2022-02-20 18:09:06,187 INFO L290 TraceCheckUtils]: 21: Hoare triple {1003#false} assume true; {1003#false} is VALID [2022-02-20 18:09:06,188 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1003#false} {1003#false} #203#return; {1003#false} is VALID [2022-02-20 18:09:06,188 INFO L290 TraceCheckUtils]: 23: Hoare triple {1003#false} __utac_acc__Specification3_spec__1_~tmp~0#1 := __utac_acc__Specification3_spec__1_#t~ret4#1;havoc __utac_acc__Specification3_spec__1_#t~ret4#1; {1003#false} is VALID [2022-02-20 18:09:06,188 INFO L290 TraceCheckUtils]: 24: Hoare triple {1003#false} assume !(0bv32 != __utac_acc__Specification3_spec__1_~tmp~0#1);assume { :begin_inline_getWaterLevel } true;havoc getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~4#1;havoc getWaterLevel_~retValue_acc~4#1;getWaterLevel_~retValue_acc~4#1 := ~waterLevel~0;getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~4#1; {1003#false} is VALID [2022-02-20 18:09:06,189 INFO L290 TraceCheckUtils]: 25: Hoare triple {1003#false} __utac_acc__Specification3_spec__1_#t~ret5#1 := getWaterLevel_#res#1;assume { :end_inline_getWaterLevel } true;__utac_acc__Specification3_spec__1_~tmp___0~0#1 := __utac_acc__Specification3_spec__1_#t~ret5#1;havoc __utac_acc__Specification3_spec__1_#t~ret5#1; {1003#false} is VALID [2022-02-20 18:09:06,189 INFO L290 TraceCheckUtils]: 26: Hoare triple {1003#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; {1003#false} is VALID [2022-02-20 18:09:06,189 INFO L290 TraceCheckUtils]: 27: Hoare triple {1003#false} __utac_acc__Specification3_spec__1_#t~ret6#1 := isPumpRunning_#res#1;assume { :end_inline_isPumpRunning } true;__utac_acc__Specification3_spec__1_~tmp___1~0#1 := __utac_acc__Specification3_spec__1_#t~ret6#1;havoc __utac_acc__Specification3_spec__1_#t~ret6#1; {1003#false} is VALID [2022-02-20 18:09:06,190 INFO L290 TraceCheckUtils]: 28: Hoare triple {1003#false} assume !(0bv32 != __utac_acc__Specification3_spec__1_~tmp___1~0#1);assume { :begin_inline___automaton_fail } true; {1003#false} is VALID [2022-02-20 18:09:06,190 INFO L290 TraceCheckUtils]: 29: Hoare triple {1003#false} assume !false; {1003#false} is VALID [2022-02-20 18:09:06,190 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:06,191 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 18:09:06,191 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 18:09:06,191 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1980936795] [2022-02-20 18:09:06,191 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1980936795] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:09:06,192 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:09:06,192 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 18:09:06,192 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102204306] [2022-02-20 18:09:06,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:09:06,193 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:09:06,193 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:09:06,194 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:09:06,230 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:09:06,230 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:09:06,231 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 18:09:06,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:09:06,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:09:06,232 INFO L87 Difference]: Start difference. First operand 57 states and 72 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:09:06,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:09:06,319 INFO L93 Difference]: Finished difference Result 107 states and 138 transitions. [2022-02-20 18:09:06,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:09:06,319 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:09:06,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:09:06,320 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:09:06,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2022-02-20 18:09:06,324 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:09:06,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2022-02-20 18:09:06,327 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 138 transitions. [2022-02-20 18:09:06,439 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:06,443 INFO L225 Difference]: With dead ends: 107 [2022-02-20 18:09:06,443 INFO L226 Difference]: Without dead ends: 57 [2022-02-20 18:09:06,445 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:09:06,448 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 54 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 70 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:09:06,449 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 70 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:09:06,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-02-20 18:09:06,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-02-20 18:09:06,457 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:09:06,458 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 57 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 50 states have internal predecessors, (59), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 18:09:06,458 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 57 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 50 states have internal predecessors, (59), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 18:09:06,459 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 57 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 50 states have internal predecessors, (59), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 18:09:06,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:09:06,461 INFO L93 Difference]: Finished difference Result 57 states and 71 transitions. [2022-02-20 18:09:06,462 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 71 transitions. [2022-02-20 18:09:06,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:09:06,465 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:09:06,466 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 50 states have internal predecessors, (59), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 57 states. [2022-02-20 18:09:06,466 INFO L87 Difference]: Start difference. First operand has 57 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 50 states have internal predecessors, (59), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 57 states. [2022-02-20 18:09:06,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:09:06,470 INFO L93 Difference]: Finished difference Result 57 states and 71 transitions. [2022-02-20 18:09:06,471 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 71 transitions. [2022-02-20 18:09:06,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:09:06,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:09:06,471 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:09:06,471 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:09:06,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 50 states have internal predecessors, (59), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 18:09:06,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 71 transitions. [2022-02-20 18:09:06,475 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 71 transitions. Word has length 30 [2022-02-20 18:09:06,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:09:06,475 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 71 transitions. [2022-02-20 18:09:06,476 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:09:06,476 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 71 transitions. [2022-02-20 18:09:06,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-02-20 18:09:06,477 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:09:06,477 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:09:06,486 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-02-20 18:09:06,686 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:09:06,686 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:09:06,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:09:06,687 INFO L85 PathProgramCache]: Analyzing trace with hash 185331922, now seen corresponding path program 1 times [2022-02-20 18:09:06,688 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 18:09:06,689 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1913960316] [2022-02-20 18:09:06,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:09:06,690 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 18:09:06,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 18:09:06,691 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:09:06,693 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:09:06,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:09:06,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 18:09:06,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:09:06,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:09:06,904 INFO L290 TraceCheckUtils]: 0: Hoare triple {1440#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;~waterLevel~0 := 1bv32;~methaneLevelCritical~0 := 0bv32;~cleanupTimeShifts~0 := 4bv32;~pumpRunning~0 := 0bv32;~systemActive~0 := 1bv32; {1445#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:09:06,904 INFO L290 TraceCheckUtils]: 1: Hoare triple {1445#(= ~waterLevel~0 (_ bv1 32))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret36#1, main_~retValue_acc~8#1, main_~tmp~4#1;havoc main_~retValue_acc~8#1;havoc main_~tmp~4#1;assume { :begin_inline_select_helpers } true; {1445#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:09:06,905 INFO L290 TraceCheckUtils]: 2: Hoare triple {1445#(= ~waterLevel~0 (_ bv1 32))} assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; {1445#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:09:06,905 INFO L290 TraceCheckUtils]: 3: Hoare triple {1445#(= ~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~7#1;havoc valid_product_~retValue_acc~7#1;valid_product_~retValue_acc~7#1 := 1bv32;valid_product_#res#1 := valid_product_~retValue_acc~7#1; {1445#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:09:06,906 INFO L290 TraceCheckUtils]: 4: Hoare triple {1445#(= ~waterLevel~0 (_ bv1 32))} main_#t~ret36#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;main_~tmp~4#1 := main_#t~ret36#1;havoc main_#t~ret36#1; {1445#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:09:06,906 INFO L290 TraceCheckUtils]: 5: Hoare triple {1445#(= ~waterLevel~0 (_ bv1 32))} assume 0bv32 != main_~tmp~4#1;assume { :begin_inline_setup } true; {1445#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:09:06,906 INFO L290 TraceCheckUtils]: 6: Hoare triple {1445#(= ~waterLevel~0 (_ bv1 32))} assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;havoc test_#t~nondet49#1, test_#t~nondet50#1, test_#t~nondet51#1, test_#t~nondet52#1, test_~splverifierCounter~0#1, test_~tmp~8#1, test_~tmp___0~2#1, test_~tmp___1~1#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~8#1;havoc test_~tmp___0~2#1;havoc test_~tmp___1~1#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0bv32; {1445#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:09:06,907 INFO L290 TraceCheckUtils]: 7: Hoare triple {1445#(= ~waterLevel~0 (_ bv1 32))} assume !false; {1445#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:09:06,907 INFO L290 TraceCheckUtils]: 8: Hoare triple {1445#(= ~waterLevel~0 (_ bv1 32))} assume ~bvslt32(test_~splverifierCounter~0#1, 4bv32); {1445#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:09:06,908 INFO L290 TraceCheckUtils]: 9: Hoare triple {1445#(= ~waterLevel~0 (_ bv1 32))} test_~tmp~8#1 := test_#t~nondet49#1;havoc test_#t~nondet49#1; {1445#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:09:06,908 INFO L290 TraceCheckUtils]: 10: Hoare triple {1445#(= ~waterLevel~0 (_ bv1 32))} assume !(0bv32 != test_~tmp~8#1); {1445#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:09:06,908 INFO L290 TraceCheckUtils]: 11: Hoare triple {1445#(= ~waterLevel~0 (_ bv1 32))} test_~tmp___0~2#1 := test_#t~nondet50#1;havoc test_#t~nondet50#1; {1445#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:09:06,909 INFO L290 TraceCheckUtils]: 12: Hoare triple {1445#(= ~waterLevel~0 (_ bv1 32))} assume !(0bv32 != test_~tmp___0~2#1); {1445#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:09:06,909 INFO L290 TraceCheckUtils]: 13: Hoare triple {1445#(= ~waterLevel~0 (_ bv1 32))} test_~tmp___2~0#1 := test_#t~nondet51#1;havoc test_#t~nondet51#1; {1445#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:09:06,910 INFO L290 TraceCheckUtils]: 14: Hoare triple {1445#(= ~waterLevel~0 (_ bv1 32))} assume 0bv32 != test_~tmp___2~0#1; {1445#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:09:06,910 INFO L272 TraceCheckUtils]: 15: Hoare triple {1445#(= ~waterLevel~0 (_ bv1 32))} call timeShift(); {1445#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:09:06,910 INFO L290 TraceCheckUtils]: 16: Hoare triple {1445#(= ~waterLevel~0 (_ bv1 32))} assume !(0bv32 != ~pumpRunning~0); {1445#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:09:06,911 INFO L290 TraceCheckUtils]: 17: Hoare triple {1445#(= ~waterLevel~0 (_ bv1 32))} assume 0bv32 != ~systemActive~0;assume { :begin_inline_processEnvironment } true;havoc processEnvironment_#t~ret37#1, processEnvironment_~tmp~5#1;havoc processEnvironment_~tmp~5#1; {1445#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:09:06,911 INFO L290 TraceCheckUtils]: 18: Hoare triple {1445#(= ~waterLevel~0 (_ bv1 32))} assume !(0bv32 != ~pumpRunning~0); {1445#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:09:06,912 INFO L272 TraceCheckUtils]: 19: Hoare triple {1445#(= ~waterLevel~0 (_ bv1 32))} call processEnvironment__wrappee__base(); {1445#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:09:06,912 INFO L290 TraceCheckUtils]: 20: Hoare triple {1445#(= ~waterLevel~0 (_ bv1 32))} assume true; {1445#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:09:06,913 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1445#(= ~waterLevel~0 (_ bv1 32))} {1445#(= ~waterLevel~0 (_ bv1 32))} #201#return; {1445#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:09:06,913 INFO L290 TraceCheckUtils]: 22: Hoare triple {1445#(= ~waterLevel~0 (_ bv1 32))} assume { :end_inline_processEnvironment } true; {1445#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:09:06,914 INFO L290 TraceCheckUtils]: 23: Hoare triple {1445#(= ~waterLevel~0 (_ bv1 32))} assume { :begin_inline___utac_acc__Specification3_spec__1 } true;havoc __utac_acc__Specification3_spec__1_#t~ret4#1, __utac_acc__Specification3_spec__1_#t~ret5#1, __utac_acc__Specification3_spec__1_#t~ret6#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; {1445#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:09:06,914 INFO L272 TraceCheckUtils]: 24: Hoare triple {1445#(= ~waterLevel~0 (_ bv1 32))} call __utac_acc__Specification3_spec__1_#t~ret4#1 := isMethaneLevelCritical(); {1445#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:09:06,914 INFO L290 TraceCheckUtils]: 25: Hoare triple {1445#(= ~waterLevel~0 (_ bv1 32))} havoc ~retValue_acc~3;~retValue_acc~3 := ~methaneLevelCritical~0;#res := ~retValue_acc~3; {1445#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:09:06,915 INFO L290 TraceCheckUtils]: 26: Hoare triple {1445#(= ~waterLevel~0 (_ bv1 32))} assume true; {1445#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:09:06,915 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1445#(= ~waterLevel~0 (_ bv1 32))} {1445#(= ~waterLevel~0 (_ bv1 32))} #203#return; {1445#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:09:06,916 INFO L290 TraceCheckUtils]: 28: Hoare triple {1445#(= ~waterLevel~0 (_ bv1 32))} __utac_acc__Specification3_spec__1_~tmp~0#1 := __utac_acc__Specification3_spec__1_#t~ret4#1;havoc __utac_acc__Specification3_spec__1_#t~ret4#1; {1445#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:09:06,916 INFO L290 TraceCheckUtils]: 29: Hoare triple {1445#(= ~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~4#1;havoc getWaterLevel_~retValue_acc~4#1;getWaterLevel_~retValue_acc~4#1 := ~waterLevel~0;getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~4#1; {1533#(= |timeShift_getWaterLevel_#res#1| (_ bv1 32))} is VALID [2022-02-20 18:09:06,917 INFO L290 TraceCheckUtils]: 30: Hoare triple {1533#(= |timeShift_getWaterLevel_#res#1| (_ bv1 32))} __utac_acc__Specification3_spec__1_#t~ret5#1 := getWaterLevel_#res#1;assume { :end_inline_getWaterLevel } true;__utac_acc__Specification3_spec__1_~tmp___0~0#1 := __utac_acc__Specification3_spec__1_#t~ret5#1;havoc __utac_acc__Specification3_spec__1_#t~ret5#1; {1537#(= |timeShift___utac_acc__Specification3_spec__1_~tmp___0~0#1| (_ bv1 32))} is VALID [2022-02-20 18:09:06,917 INFO L290 TraceCheckUtils]: 31: Hoare triple {1537#(= |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; {1441#false} is VALID [2022-02-20 18:09:06,917 INFO L290 TraceCheckUtils]: 32: Hoare triple {1441#false} __utac_acc__Specification3_spec__1_#t~ret6#1 := isPumpRunning_#res#1;assume { :end_inline_isPumpRunning } true;__utac_acc__Specification3_spec__1_~tmp___1~0#1 := __utac_acc__Specification3_spec__1_#t~ret6#1;havoc __utac_acc__Specification3_spec__1_#t~ret6#1; {1441#false} is VALID [2022-02-20 18:09:06,918 INFO L290 TraceCheckUtils]: 33: Hoare triple {1441#false} assume !(0bv32 != __utac_acc__Specification3_spec__1_~tmp___1~0#1);assume { :begin_inline___automaton_fail } true; {1441#false} is VALID [2022-02-20 18:09:06,918 INFO L290 TraceCheckUtils]: 34: Hoare triple {1441#false} assume !false; {1441#false} is VALID [2022-02-20 18:09:06,918 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:06,918 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 18:09:06,919 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 18:09:06,919 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1913960316] [2022-02-20 18:09:06,919 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1913960316] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:09:06,919 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:09:06,919 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:09:06,919 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92467817] [2022-02-20 18:09:06,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:09:06,920 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:09:06,920 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:09:06,921 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:09:06,952 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:09:06,952 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:09:06,952 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 18:09:06,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:09:06,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:09:06,953 INFO L87 Difference]: Start difference. First operand 57 states and 71 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:09:07,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:09:07,188 INFO L93 Difference]: Finished difference Result 153 states and 199 transitions. [2022-02-20 18:09:07,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:09:07,189 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:09:07,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:09:07,189 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:09:07,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 199 transitions. [2022-02-20 18:09:07,192 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:09:07,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 199 transitions. [2022-02-20 18:09:07,195 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 199 transitions. [2022-02-20 18:09:07,361 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 199 edges. 199 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:09:07,364 INFO L225 Difference]: With dead ends: 153 [2022-02-20 18:09:07,364 INFO L226 Difference]: Without dead ends: 103 [2022-02-20 18:09:07,364 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:09:07,365 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 37 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 277 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:09:07,365 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 277 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:09:07,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-02-20 18:09:07,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 100. [2022-02-20 18:09:07,373 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:09:07,373 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand has 100 states, 78 states have (on average 1.3076923076923077) internal successors, (102), 86 states have internal predecessors, (102), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (13), 9 states have call predecessors, (13), 12 states have call successors, (13) [2022-02-20 18:09:07,374 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand has 100 states, 78 states have (on average 1.3076923076923077) internal successors, (102), 86 states have internal predecessors, (102), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (13), 9 states have call predecessors, (13), 12 states have call successors, (13) [2022-02-20 18:09:07,374 INFO L87 Difference]: Start difference. First operand 103 states. Second operand has 100 states, 78 states have (on average 1.3076923076923077) internal successors, (102), 86 states have internal predecessors, (102), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (13), 9 states have call predecessors, (13), 12 states have call successors, (13) [2022-02-20 18:09:07,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:09:07,378 INFO L93 Difference]: Finished difference Result 103 states and 130 transitions. [2022-02-20 18:09:07,378 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 130 transitions. [2022-02-20 18:09:07,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:09:07,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:09:07,379 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 78 states have (on average 1.3076923076923077) internal successors, (102), 86 states have internal predecessors, (102), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (13), 9 states have call predecessors, (13), 12 states have call successors, (13) Second operand 103 states. [2022-02-20 18:09:07,379 INFO L87 Difference]: Start difference. First operand has 100 states, 78 states have (on average 1.3076923076923077) internal successors, (102), 86 states have internal predecessors, (102), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (13), 9 states have call predecessors, (13), 12 states have call successors, (13) Second operand 103 states. [2022-02-20 18:09:07,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:09:07,383 INFO L93 Difference]: Finished difference Result 103 states and 130 transitions. [2022-02-20 18:09:07,383 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 130 transitions. [2022-02-20 18:09:07,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:09:07,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:09:07,384 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:09:07,384 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:09:07,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 78 states have (on average 1.3076923076923077) internal successors, (102), 86 states have internal predecessors, (102), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (13), 9 states have call predecessors, (13), 12 states have call successors, (13) [2022-02-20 18:09:07,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 127 transitions. [2022-02-20 18:09:07,388 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 127 transitions. Word has length 35 [2022-02-20 18:09:07,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:09:07,388 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 127 transitions. [2022-02-20 18:09:07,388 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:09:07,388 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 127 transitions. [2022-02-20 18:09:07,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 18:09:07,389 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:09:07,389 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:09:07,412 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:07,598 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:07,599 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:09:07,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:09:07,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1706255597, now seen corresponding path program 1 times [2022-02-20 18:09:07,600 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 18:09:07,600 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [711662244] [2022-02-20 18:09:07,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:09:07,600 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 18:09:07,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 18:09:07,602 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:07,603 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:07,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:09:07,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 18:09:07,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:09:07,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:09:07,752 INFO L290 TraceCheckUtils]: 0: Hoare triple {2117#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;~waterLevel~0 := 1bv32;~methaneLevelCritical~0 := 0bv32;~cleanupTimeShifts~0 := 4bv32;~pumpRunning~0 := 0bv32;~systemActive~0 := 1bv32; {2122#(= (_ bv0 32) ~pumpRunning~0)} is VALID [2022-02-20 18:09:07,753 INFO L290 TraceCheckUtils]: 1: Hoare triple {2122#(= (_ bv0 32) ~pumpRunning~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret36#1, main_~retValue_acc~8#1, main_~tmp~4#1;havoc main_~retValue_acc~8#1;havoc main_~tmp~4#1;assume { :begin_inline_select_helpers } true; {2122#(= (_ bv0 32) ~pumpRunning~0)} is VALID [2022-02-20 18:09:07,758 INFO L290 TraceCheckUtils]: 2: Hoare triple {2122#(= (_ bv0 32) ~pumpRunning~0)} assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; {2122#(= (_ bv0 32) ~pumpRunning~0)} is VALID [2022-02-20 18:09:07,758 INFO L290 TraceCheckUtils]: 3: Hoare triple {2122#(= (_ 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~7#1;havoc valid_product_~retValue_acc~7#1;valid_product_~retValue_acc~7#1 := 1bv32;valid_product_#res#1 := valid_product_~retValue_acc~7#1; {2122#(= (_ bv0 32) ~pumpRunning~0)} is VALID [2022-02-20 18:09:07,759 INFO L290 TraceCheckUtils]: 4: Hoare triple {2122#(= (_ bv0 32) ~pumpRunning~0)} main_#t~ret36#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;main_~tmp~4#1 := main_#t~ret36#1;havoc main_#t~ret36#1; {2122#(= (_ bv0 32) ~pumpRunning~0)} is VALID [2022-02-20 18:09:07,759 INFO L290 TraceCheckUtils]: 5: Hoare triple {2122#(= (_ bv0 32) ~pumpRunning~0)} assume 0bv32 != main_~tmp~4#1;assume { :begin_inline_setup } true; {2122#(= (_ bv0 32) ~pumpRunning~0)} is VALID [2022-02-20 18:09:07,760 INFO L290 TraceCheckUtils]: 6: Hoare triple {2122#(= (_ bv0 32) ~pumpRunning~0)} assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;havoc test_#t~nondet49#1, test_#t~nondet50#1, test_#t~nondet51#1, test_#t~nondet52#1, test_~splverifierCounter~0#1, test_~tmp~8#1, test_~tmp___0~2#1, test_~tmp___1~1#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~8#1;havoc test_~tmp___0~2#1;havoc test_~tmp___1~1#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0bv32; {2122#(= (_ bv0 32) ~pumpRunning~0)} is VALID [2022-02-20 18:09:07,760 INFO L290 TraceCheckUtils]: 7: Hoare triple {2122#(= (_ bv0 32) ~pumpRunning~0)} assume !false; {2122#(= (_ bv0 32) ~pumpRunning~0)} is VALID [2022-02-20 18:09:07,760 INFO L290 TraceCheckUtils]: 8: Hoare triple {2122#(= (_ bv0 32) ~pumpRunning~0)} assume ~bvslt32(test_~splverifierCounter~0#1, 4bv32); {2122#(= (_ bv0 32) ~pumpRunning~0)} is VALID [2022-02-20 18:09:07,761 INFO L290 TraceCheckUtils]: 9: Hoare triple {2122#(= (_ bv0 32) ~pumpRunning~0)} test_~tmp~8#1 := test_#t~nondet49#1;havoc test_#t~nondet49#1; {2122#(= (_ bv0 32) ~pumpRunning~0)} is VALID [2022-02-20 18:09:07,762 INFO L290 TraceCheckUtils]: 10: Hoare triple {2122#(= (_ bv0 32) ~pumpRunning~0)} assume !(0bv32 != test_~tmp~8#1); {2122#(= (_ bv0 32) ~pumpRunning~0)} is VALID [2022-02-20 18:09:07,762 INFO L290 TraceCheckUtils]: 11: Hoare triple {2122#(= (_ bv0 32) ~pumpRunning~0)} test_~tmp___0~2#1 := test_#t~nondet50#1;havoc test_#t~nondet50#1; {2122#(= (_ bv0 32) ~pumpRunning~0)} is VALID [2022-02-20 18:09:07,776 INFO L290 TraceCheckUtils]: 12: Hoare triple {2122#(= (_ bv0 32) ~pumpRunning~0)} assume !(0bv32 != test_~tmp___0~2#1); {2122#(= (_ bv0 32) ~pumpRunning~0)} is VALID [2022-02-20 18:09:07,776 INFO L290 TraceCheckUtils]: 13: Hoare triple {2122#(= (_ bv0 32) ~pumpRunning~0)} test_~tmp___2~0#1 := test_#t~nondet51#1;havoc test_#t~nondet51#1; {2122#(= (_ bv0 32) ~pumpRunning~0)} is VALID [2022-02-20 18:09:07,777 INFO L290 TraceCheckUtils]: 14: Hoare triple {2122#(= (_ bv0 32) ~pumpRunning~0)} assume 0bv32 != test_~tmp___2~0#1; {2122#(= (_ bv0 32) ~pumpRunning~0)} is VALID [2022-02-20 18:09:07,777 INFO L272 TraceCheckUtils]: 15: Hoare triple {2122#(= (_ bv0 32) ~pumpRunning~0)} call timeShift(); {2122#(= (_ bv0 32) ~pumpRunning~0)} is VALID [2022-02-20 18:09:07,777 INFO L290 TraceCheckUtils]: 16: Hoare triple {2122#(= (_ bv0 32) ~pumpRunning~0)} assume 0bv32 != ~pumpRunning~0;assume { :begin_inline_lowerWaterLevel } true; {2118#false} is VALID [2022-02-20 18:09:07,778 INFO L290 TraceCheckUtils]: 17: Hoare triple {2118#false} assume ~bvsgt32(~waterLevel~0, 0bv32);~waterLevel~0 := ~bvsub32(~waterLevel~0, 1bv32); {2118#false} is VALID [2022-02-20 18:09:07,778 INFO L290 TraceCheckUtils]: 18: Hoare triple {2118#false} assume { :end_inline_lowerWaterLevel } true; {2118#false} is VALID [2022-02-20 18:09:07,778 INFO L290 TraceCheckUtils]: 19: Hoare triple {2118#false} assume 0bv32 != ~systemActive~0;assume { :begin_inline_processEnvironment } true;havoc processEnvironment_#t~ret37#1, processEnvironment_~tmp~5#1;havoc processEnvironment_~tmp~5#1; {2118#false} is VALID [2022-02-20 18:09:07,778 INFO L290 TraceCheckUtils]: 20: Hoare triple {2118#false} assume !(0bv32 != ~pumpRunning~0); {2118#false} is VALID [2022-02-20 18:09:07,778 INFO L272 TraceCheckUtils]: 21: Hoare triple {2118#false} call processEnvironment__wrappee__base(); {2118#false} is VALID [2022-02-20 18:09:07,778 INFO L290 TraceCheckUtils]: 22: Hoare triple {2118#false} assume true; {2118#false} is VALID [2022-02-20 18:09:07,778 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2118#false} {2118#false} #201#return; {2118#false} is VALID [2022-02-20 18:09:07,778 INFO L290 TraceCheckUtils]: 24: Hoare triple {2118#false} assume { :end_inline_processEnvironment } true; {2118#false} is VALID [2022-02-20 18:09:07,778 INFO L290 TraceCheckUtils]: 25: Hoare triple {2118#false} assume { :begin_inline___utac_acc__Specification3_spec__1 } true;havoc __utac_acc__Specification3_spec__1_#t~ret4#1, __utac_acc__Specification3_spec__1_#t~ret5#1, __utac_acc__Specification3_spec__1_#t~ret6#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; {2118#false} is VALID [2022-02-20 18:09:07,779 INFO L272 TraceCheckUtils]: 26: Hoare triple {2118#false} call __utac_acc__Specification3_spec__1_#t~ret4#1 := isMethaneLevelCritical(); {2118#false} is VALID [2022-02-20 18:09:07,779 INFO L290 TraceCheckUtils]: 27: Hoare triple {2118#false} havoc ~retValue_acc~3;~retValue_acc~3 := ~methaneLevelCritical~0;#res := ~retValue_acc~3; {2118#false} is VALID [2022-02-20 18:09:07,779 INFO L290 TraceCheckUtils]: 28: Hoare triple {2118#false} assume true; {2118#false} is VALID [2022-02-20 18:09:07,779 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2118#false} {2118#false} #203#return; {2118#false} is VALID [2022-02-20 18:09:07,779 INFO L290 TraceCheckUtils]: 30: Hoare triple {2118#false} __utac_acc__Specification3_spec__1_~tmp~0#1 := __utac_acc__Specification3_spec__1_#t~ret4#1;havoc __utac_acc__Specification3_spec__1_#t~ret4#1; {2118#false} is VALID [2022-02-20 18:09:07,779 INFO L290 TraceCheckUtils]: 31: Hoare triple {2118#false} assume !(0bv32 != __utac_acc__Specification3_spec__1_~tmp~0#1);assume { :begin_inline_getWaterLevel } true;havoc getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~4#1;havoc getWaterLevel_~retValue_acc~4#1;getWaterLevel_~retValue_acc~4#1 := ~waterLevel~0;getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~4#1; {2118#false} is VALID [2022-02-20 18:09:07,779 INFO L290 TraceCheckUtils]: 32: Hoare triple {2118#false} __utac_acc__Specification3_spec__1_#t~ret5#1 := getWaterLevel_#res#1;assume { :end_inline_getWaterLevel } true;__utac_acc__Specification3_spec__1_~tmp___0~0#1 := __utac_acc__Specification3_spec__1_#t~ret5#1;havoc __utac_acc__Specification3_spec__1_#t~ret5#1; {2118#false} is VALID [2022-02-20 18:09:07,779 INFO L290 TraceCheckUtils]: 33: Hoare triple {2118#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; {2118#false} is VALID [2022-02-20 18:09:07,779 INFO L290 TraceCheckUtils]: 34: Hoare triple {2118#false} __utac_acc__Specification3_spec__1_#t~ret6#1 := isPumpRunning_#res#1;assume { :end_inline_isPumpRunning } true;__utac_acc__Specification3_spec__1_~tmp___1~0#1 := __utac_acc__Specification3_spec__1_#t~ret6#1;havoc __utac_acc__Specification3_spec__1_#t~ret6#1; {2118#false} is VALID [2022-02-20 18:09:07,779 INFO L290 TraceCheckUtils]: 35: Hoare triple {2118#false} assume !(0bv32 != __utac_acc__Specification3_spec__1_~tmp___1~0#1);assume { :begin_inline___automaton_fail } true; {2118#false} is VALID [2022-02-20 18:09:07,780 INFO L290 TraceCheckUtils]: 36: Hoare triple {2118#false} assume !false; {2118#false} is VALID [2022-02-20 18:09:07,780 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:07,780 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 18:09:07,780 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 18:09:07,780 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [711662244] [2022-02-20 18:09:07,780 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [711662244] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:09:07,780 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:09:07,780 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 18:09:07,781 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535227115] [2022-02-20 18:09:07,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:09:07,781 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:07,781 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:09:07,782 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:07,820 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:07,820 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:09:07,820 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 18:09:07,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:09:07,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:09:07,821 INFO L87 Difference]: Start difference. First operand 100 states and 127 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:07,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:09:07,880 INFO L93 Difference]: Finished difference Result 176 states and 225 transitions. [2022-02-20 18:09:07,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:09:07,881 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:07,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:09:07,881 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:07,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2022-02-20 18:09:07,883 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:07,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2022-02-20 18:09:07,886 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 123 transitions. [2022-02-20 18:09:07,994 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:09:07,996 INFO L225 Difference]: With dead ends: 176 [2022-02-20 18:09:07,996 INFO L226 Difference]: Without dead ends: 83 [2022-02-20 18:09:07,997 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:07,998 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 40 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:09:07,998 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 53 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:09:07,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-02-20 18:09:08,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2022-02-20 18:09:08,004 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:09:08,004 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand has 83 states, 63 states have (on average 1.2380952380952381) internal successors, (78), 67 states have internal predecessors, (78), 10 states have call successors, (10), 10 states have call predecessors, (10), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 18:09:08,005 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand has 83 states, 63 states have (on average 1.2380952380952381) internal successors, (78), 67 states have internal predecessors, (78), 10 states have call successors, (10), 10 states have call predecessors, (10), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 18:09:08,005 INFO L87 Difference]: Start difference. First operand 83 states. Second operand has 83 states, 63 states have (on average 1.2380952380952381) internal successors, (78), 67 states have internal predecessors, (78), 10 states have call successors, (10), 10 states have call predecessors, (10), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 18:09:08,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:09:08,007 INFO L93 Difference]: Finished difference Result 83 states and 98 transitions. [2022-02-20 18:09:08,007 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 98 transitions. [2022-02-20 18:09:08,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:09:08,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:09:08,008 INFO L74 IsIncluded]: Start isIncluded. First operand has 83 states, 63 states have (on average 1.2380952380952381) internal successors, (78), 67 states have internal predecessors, (78), 10 states have call successors, (10), 10 states have call predecessors, (10), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 83 states. [2022-02-20 18:09:08,009 INFO L87 Difference]: Start difference. First operand has 83 states, 63 states have (on average 1.2380952380952381) internal successors, (78), 67 states have internal predecessors, (78), 10 states have call successors, (10), 10 states have call predecessors, (10), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 83 states. [2022-02-20 18:09:08,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:09:08,011 INFO L93 Difference]: Finished difference Result 83 states and 98 transitions. [2022-02-20 18:09:08,011 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 98 transitions. [2022-02-20 18:09:08,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:09:08,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:09:08,012 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:09:08,012 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:09:08,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 63 states have (on average 1.2380952380952381) internal successors, (78), 67 states have internal predecessors, (78), 10 states have call successors, (10), 10 states have call predecessors, (10), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 18:09:08,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 98 transitions. [2022-02-20 18:09:08,015 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 98 transitions. Word has length 37 [2022-02-20 18:09:08,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:09:08,016 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 98 transitions. [2022-02-20 18:09:08,016 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:08,016 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 98 transitions. [2022-02-20 18:09:08,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-02-20 18:09:08,017 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:09:08,017 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:08,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-02-20 18:09:08,227 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:08,228 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:09:08,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:09:08,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1701903188, now seen corresponding path program 1 times [2022-02-20 18:09:08,228 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 18:09:08,229 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [869651854] [2022-02-20 18:09:08,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:09:08,229 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 18:09:08,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 18:09:08,230 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:08,231 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:08,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 18:09:08,275 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 18:09:08,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 18:09:08,329 INFO L138 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-02-20 18:09:08,330 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 18:09:08,330 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 18:09:08,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-02-20 18:09:08,532 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:08,535 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-02-20 18:09:08,538 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 18:09:08,557 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call waterRise(); [2022-02-20 18:09:08,558 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:08,560 INFO L158 Benchmark]: Toolchain (without parser) took 5509.64ms. Allocated memory was 58.7MB in the beginning and 92.3MB in the end (delta: 33.6MB). Free memory was 35.6MB in the beginning and 53.6MB in the end (delta: -18.0MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. [2022-02-20 18:09:08,560 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 58.7MB. Free memory was 40.0MB in the beginning and 39.9MB in the end (delta: 29.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 18:09:08,560 INFO L158 Benchmark]: CACSL2BoogieTranslator took 591.06ms. Allocated memory was 58.7MB in the beginning and 75.5MB in the end (delta: 16.8MB). Free memory was 35.5MB in the beginning and 56.6MB in the end (delta: -21.1MB). Peak memory consumption was 13.4MB. Max. memory is 16.1GB. [2022-02-20 18:09:08,561 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.90ms. Allocated memory is still 75.5MB. Free memory was 56.6MB in the beginning and 53.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 18:09:08,561 INFO L158 Benchmark]: Boogie Preprocessor took 30.19ms. Allocated memory is still 75.5MB. Free memory was 53.9MB in the beginning and 52.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 18:09:08,561 INFO L158 Benchmark]: RCFGBuilder took 477.39ms. Allocated memory is still 75.5MB. Free memory was 52.1MB in the beginning and 35.0MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-02-20 18:09:08,561 INFO L158 Benchmark]: TraceAbstraction took 4334.49ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 56.3MB in the beginning and 53.6MB in the end (delta: 2.7MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. [2022-02-20 18:09:08,563 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.21ms. Allocated memory is still 58.7MB. Free memory was 40.0MB in the beginning and 39.9MB in the end (delta: 29.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 591.06ms. Allocated memory was 58.7MB in the beginning and 75.5MB in the end (delta: 16.8MB). Free memory was 35.5MB in the beginning and 56.6MB in the end (delta: -21.1MB). Peak memory consumption was 13.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.90ms. Allocated memory is still 75.5MB. Free memory was 56.6MB in the beginning and 53.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.19ms. Allocated memory is still 75.5MB. Free memory was 53.9MB in the beginning and 52.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 477.39ms. Allocated memory is still 75.5MB. Free memory was 52.1MB in the beginning and 35.0MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4334.49ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 56.3MB in the beginning and 53.6MB in the end (delta: 2.7MB). Peak memory consumption was 17.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:08,596 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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