./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec3_product64.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_product64.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 d436abf98cab5db4fbcf1977ce5628e2227cd7aa643df1d726e32cf2e71cb81f --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:09:50,882 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:09:50,884 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:09:50,919 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:09:50,920 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:09:50,922 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:09:50,923 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:09:50,925 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:09:50,926 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:09:50,930 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:09:50,931 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:09:50,932 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:09:50,933 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:09:50,935 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:09:50,936 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:09:50,939 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:09:50,940 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:09:50,940 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:09:50,942 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:09:50,952 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:09:50,953 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:09:50,954 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:09:50,955 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:09:50,956 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:09:50,961 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:09:50,962 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:09:50,962 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:09:50,963 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:09:50,964 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:09:50,965 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:09:50,965 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:09:50,966 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:09:50,967 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:09:50,968 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:09:50,969 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:09:50,969 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:09:50,970 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:09:50,970 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:09:50,970 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:09:50,971 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:09:50,971 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:09:50,973 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:09:51,001 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:09:51,001 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:09:51,002 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:09:51,002 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:09:51,003 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:09:51,003 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:09:51,003 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:09:51,003 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:09:51,003 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:09:51,004 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:09:51,004 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:09:51,004 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:09:51,005 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:09:51,005 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:09:51,005 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:09:51,005 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:09:51,005 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:09:51,005 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:09:51,005 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:09:51,006 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:09:51,006 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:09:51,006 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:09:51,006 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:09:51,006 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:09:51,006 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:09:51,006 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:09:51,007 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:09:51,007 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:09:51,007 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:09:51,007 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:09:51,007 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:09:51,007 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:09:51,008 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:09:51,008 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 -> d436abf98cab5db4fbcf1977ce5628e2227cd7aa643df1d726e32cf2e71cb81f [2022-02-20 18:09:51,196 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:09:51,213 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:09:51,216 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:09:51,216 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:09:51,217 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:09:51,218 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec3_product64.cil.c [2022-02-20 18:09:51,263 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6d7e7537/cbc3ab4f262446e69630cb74a6fdd2e5/FLAGd61159c72 [2022-02-20 18:09:51,698 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:09:51,703 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec3_product64.cil.c [2022-02-20 18:09:51,712 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6d7e7537/cbc3ab4f262446e69630cb74a6fdd2e5/FLAGd61159c72 [2022-02-20 18:09:51,723 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6d7e7537/cbc3ab4f262446e69630cb74a6fdd2e5 [2022-02-20 18:09:51,725 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:09:51,727 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:09:51,729 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:09:51,729 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:09:51,732 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:09:51,732 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:09:51" (1/1) ... [2022-02-20 18:09:51,733 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a4e6deb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:09:51, skipping insertion in model container [2022-02-20 18:09:51,733 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:09:51" (1/1) ... [2022-02-20 18:09:51,738 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:09:51,777 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:09:52,066 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_product64.cil.c[19022,19035] [2022-02-20 18:09:52,073 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:09:52,082 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:09:52,152 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_product64.cil.c[19022,19035] [2022-02-20 18:09:52,154 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:09:52,166 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:09:52,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:09:52 WrapperNode [2022-02-20 18:09:52,169 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:09:52,170 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:09:52,170 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:09:52,170 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:09:52,175 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:52" (1/1) ... [2022-02-20 18:09:52,195 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:52" (1/1) ... [2022-02-20 18:09:52,227 INFO L137 Inliner]: procedures = 59, calls = 164, calls flagged for inlining = 25, calls inlined = 22, statements flattened = 288 [2022-02-20 18:09:52,227 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:09:52,228 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:09:52,228 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:09:52,228 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:09:52,234 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:52" (1/1) ... [2022-02-20 18:09:52,234 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:52" (1/1) ... [2022-02-20 18:09:52,236 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:52" (1/1) ... [2022-02-20 18:09:52,236 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:52" (1/1) ... [2022-02-20 18:09:52,240 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:52" (1/1) ... [2022-02-20 18:09:52,243 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:52" (1/1) ... [2022-02-20 18:09:52,244 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:52" (1/1) ... [2022-02-20 18:09:52,246 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:09:52,247 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:09:52,247 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:09:52,247 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:09:52,267 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:09:52" (1/1) ... [2022-02-20 18:09:52,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:09:52,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:09:52,289 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:52,307 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:52,321 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:09:52,322 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2022-02-20 18:09:52,322 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2022-02-20 18:09:52,322 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2022-02-20 18:09:52,322 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2022-02-20 18:09:52,322 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2022-02-20 18:09:52,322 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2022-02-20 18:09:52,322 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2022-02-20 18:09:52,323 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2022-02-20 18:09:52,323 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2022-02-20 18:09:52,323 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2022-02-20 18:09:52,323 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2022-02-20 18:09:52,323 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2022-02-20 18:09:52,323 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__methaneQuery [2022-02-20 18:09:52,324 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__methaneQuery [2022-02-20 18:09:52,324 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneAlarm [2022-02-20 18:09:52,324 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneAlarm [2022-02-20 18:09:52,324 INFO L130 BoogieDeclarations]: Found specification of procedure deactivatePump [2022-02-20 18:09:52,324 INFO L138 BoogieDeclarations]: Found implementation of procedure deactivatePump [2022-02-20 18:09:52,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:09:52,324 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2022-02-20 18:09:52,324 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2022-02-20 18:09:52,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:09:52,325 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:09:52,390 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:09:52,392 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:09:52,738 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:09:52,743 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:09:52,743 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 18:09:52,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:09:52 BoogieIcfgContainer [2022-02-20 18:09:52,744 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:09:52,745 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:09:52,745 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:09:52,747 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:09:52,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:09:51" (1/3) ... [2022-02-20 18:09:52,748 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ab8e3ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:09:52, skipping insertion in model container [2022-02-20 18:09:52,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:09:52" (2/3) ... [2022-02-20 18:09:52,748 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ab8e3ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:09:52, skipping insertion in model container [2022-02-20 18:09:52,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:09:52" (3/3) ... [2022-02-20 18:09:52,749 INFO L111 eAbstractionObserver]: Analyzing ICFG minepump_spec3_product64.cil.c [2022-02-20 18:09:52,752 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:09:52,758 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:09:52,784 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:09:52,788 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:52,788 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:09:52,803 INFO L276 IsEmpty]: Start isEmpty. Operand has 115 states, 84 states have (on average 1.369047619047619) internal successors, (115), 95 states have internal predecessors, (115), 19 states have call successors, (19), 10 states have call predecessors, (19), 10 states have return successors, (19), 14 states have call predecessors, (19), 19 states have call successors, (19) [2022-02-20 18:09:52,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 18:09:52,809 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:09:52,809 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:52,810 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:09:52,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:09:52,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1815405350, now seen corresponding path program 1 times [2022-02-20 18:09:52,822 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:09:52,822 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300527430] [2022-02-20 18:09:52,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:09:52,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:09:52,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:09:53,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-20 18:09:53,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:09:53,022 INFO L290 TraceCheckUtils]: 0: Hoare triple {118#true} havoc ~retValue_acc~6;~retValue_acc~6 := ~methaneLevelCritical~0;#res := ~retValue_acc~6; {118#true} is VALID [2022-02-20 18:09:53,022 INFO L290 TraceCheckUtils]: 1: Hoare triple {118#true} assume true; {118#true} is VALID [2022-02-20 18:09:53,023 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {118#true} {119#false} #297#return; {119#false} is VALID [2022-02-20 18:09:53,027 INFO L290 TraceCheckUtils]: 0: Hoare triple {118#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(13, 4);call #Ultimate.allocInit(3, 5);call write~init~int(79, 5, 0, 1);call write~init~int(110, 5, 1, 1);call write~init~int(0, 5, 2, 1);call #Ultimate.allocInit(4, 6);call write~init~int(79, 6, 0, 1);call write~init~int(102, 6, 1, 1);call write~init~int(102, 6, 2, 1);call write~init~int(0, 6, 3, 1);call #Ultimate.allocInit(7, 7);call write~init~int(44, 7, 0, 1);call write~init~int(80, 7, 1, 1);call write~init~int(117, 7, 2, 1);call write~init~int(109, 7, 3, 1);call write~init~int(112, 7, 4, 1);call write~init~int(58, 7, 5, 1);call write~init~int(0, 7, 6, 1);call #Ultimate.allocInit(3, 8);call write~init~int(79, 8, 0, 1);call write~init~int(110, 8, 1, 1);call write~init~int(0, 8, 2, 1);call #Ultimate.allocInit(4, 9);call write~init~int(79, 9, 0, 1);call write~init~int(102, 9, 1, 1);call write~init~int(102, 9, 2, 1);call write~init~int(0, 9, 3, 1);call #Ultimate.allocInit(3, 10);call write~init~int(41, 10, 0, 1);call write~init~int(32, 10, 1, 1);call write~init~int(0, 10, 2, 1);call #Ultimate.allocInit(2, 11);call write~init~int(10, 11, 0, 1);call write~init~int(0, 11, 1, 1);call #Ultimate.allocInit(13, 12);call #Ultimate.allocInit(7, 13);call write~init~int(44, 13, 0, 1);call write~init~int(77, 13, 1, 1);call write~init~int(101, 13, 2, 1);call write~init~int(116, 13, 3, 1);call write~init~int(104, 13, 4, 1);call write~init~int(58, 13, 5, 1);call write~init~int(0, 13, 6, 1);call #Ultimate.allocInit(5, 14);call write~init~int(67, 14, 0, 1);call write~init~int(82, 14, 1, 1);call write~init~int(73, 14, 2, 1);call write~init~int(84, 14, 3, 1);call write~init~int(0, 14, 4, 1);call #Ultimate.allocInit(3, 15);call write~init~int(79, 15, 0, 1);call write~init~int(75, 15, 1, 1);call write~init~int(0, 15, 2, 1);call #Ultimate.allocInit(2, 16);call write~init~int(41, 16, 0, 1);call write~init~int(0, 16, 1, 1);call #Ultimate.allocInit(30, 17);call #Ultimate.allocInit(9, 18);call #Ultimate.allocInit(21, 19);call #Ultimate.allocInit(30, 20);call #Ultimate.allocInit(9, 21);call #Ultimate.allocInit(21, 22);call #Ultimate.allocInit(30, 23);call #Ultimate.allocInit(9, 24);call #Ultimate.allocInit(25, 25);call #Ultimate.allocInit(30, 26);call #Ultimate.allocInit(9, 27);call #Ultimate.allocInit(25, 28);~pumpRunning~0 := 0;~systemActive~0 := 1;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~head~0.base, ~head~0.offset := 0, 0;~cleanupTimeShifts~0 := 4; {118#true} is VALID [2022-02-20 18:09:53,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {118#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret52#1, main_~retValue_acc~13#1, main_~tmp~10#1;havoc main_~retValue_acc~13#1;havoc main_~tmp~10#1;assume { :begin_inline_select_helpers } true; {118#true} is VALID [2022-02-20 18:09:53,027 INFO L290 TraceCheckUtils]: 2: Hoare triple {118#true} assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; {118#true} is VALID [2022-02-20 18:09:53,027 INFO L290 TraceCheckUtils]: 3: Hoare triple {118#true} assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~1#1;havoc valid_product_~retValue_acc~1#1;valid_product_~retValue_acc~1#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~1#1; {118#true} is VALID [2022-02-20 18:09:53,027 INFO L290 TraceCheckUtils]: 4: Hoare triple {118#true} main_#t~ret52#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;assume -2147483648 <= main_#t~ret52#1 && main_#t~ret52#1 <= 2147483647;main_~tmp~10#1 := main_#t~ret52#1;havoc main_#t~ret52#1; {118#true} is VALID [2022-02-20 18:09:53,028 INFO L290 TraceCheckUtils]: 5: Hoare triple {118#true} assume 0 != main_~tmp~10#1;assume { :begin_inline_setup } true; {118#true} is VALID [2022-02-20 18:09:53,028 INFO L290 TraceCheckUtils]: 6: Hoare triple {118#true} assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;havoc test_#t~nondet20#1, test_#t~nondet21#1, test_#t~nondet22#1, test_#t~nondet23#1, test_~splverifierCounter~0#1, test_~tmp~6#1, test_~tmp___0~2#1, test_~tmp___1~0#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~6#1;havoc test_~tmp___0~2#1;havoc test_~tmp___1~0#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0; {118#true} is VALID [2022-02-20 18:09:53,029 INFO L290 TraceCheckUtils]: 7: Hoare triple {118#true} assume !true; {119#false} is VALID [2022-02-20 18:09:53,029 INFO L272 TraceCheckUtils]: 8: Hoare triple {119#false} call cleanup(); {119#false} is VALID [2022-02-20 18:09:53,029 INFO L290 TraceCheckUtils]: 9: Hoare triple {119#false} havoc ~i~0;havoc ~__cil_tmp2~0; {119#false} is VALID [2022-02-20 18:09:53,029 INFO L272 TraceCheckUtils]: 10: Hoare triple {119#false} call timeShift(); {119#false} is VALID [2022-02-20 18:09:53,030 INFO L290 TraceCheckUtils]: 11: Hoare triple {119#false} assume !(0 != ~pumpRunning~0); {119#false} is VALID [2022-02-20 18:09:53,030 INFO L290 TraceCheckUtils]: 12: Hoare triple {119#false} assume !(0 != ~systemActive~0); {119#false} is VALID [2022-02-20 18:09:53,030 INFO L290 TraceCheckUtils]: 13: Hoare triple {119#false} assume { :begin_inline___utac_acc__Specification3_spec__1 } true;havoc __utac_acc__Specification3_spec__1_#t~ret53#1, __utac_acc__Specification3_spec__1_#t~ret54#1, __utac_acc__Specification3_spec__1_#t~ret55#1, __utac_acc__Specification3_spec__1_~tmp~11#1, __utac_acc__Specification3_spec__1_~tmp___0~3#1, __utac_acc__Specification3_spec__1_~tmp___1~1#1;havoc __utac_acc__Specification3_spec__1_~tmp~11#1;havoc __utac_acc__Specification3_spec__1_~tmp___0~3#1;havoc __utac_acc__Specification3_spec__1_~tmp___1~1#1; {119#false} is VALID [2022-02-20 18:09:53,030 INFO L272 TraceCheckUtils]: 14: Hoare triple {119#false} call __utac_acc__Specification3_spec__1_#t~ret53#1 := isMethaneLevelCritical(); {118#true} is VALID [2022-02-20 18:09:53,030 INFO L290 TraceCheckUtils]: 15: Hoare triple {118#true} havoc ~retValue_acc~6;~retValue_acc~6 := ~methaneLevelCritical~0;#res := ~retValue_acc~6; {118#true} is VALID [2022-02-20 18:09:53,030 INFO L290 TraceCheckUtils]: 16: Hoare triple {118#true} assume true; {118#true} is VALID [2022-02-20 18:09:53,031 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {118#true} {119#false} #297#return; {119#false} is VALID [2022-02-20 18:09:53,031 INFO L290 TraceCheckUtils]: 18: Hoare triple {119#false} assume -2147483648 <= __utac_acc__Specification3_spec__1_#t~ret53#1 && __utac_acc__Specification3_spec__1_#t~ret53#1 <= 2147483647;__utac_acc__Specification3_spec__1_~tmp~11#1 := __utac_acc__Specification3_spec__1_#t~ret53#1;havoc __utac_acc__Specification3_spec__1_#t~ret53#1; {119#false} is VALID [2022-02-20 18:09:53,031 INFO L290 TraceCheckUtils]: 19: Hoare triple {119#false} assume !(0 != __utac_acc__Specification3_spec__1_~tmp~11#1);assume { :begin_inline_getWaterLevel } true;havoc getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~7#1;havoc getWaterLevel_~retValue_acc~7#1;getWaterLevel_~retValue_acc~7#1 := ~waterLevel~0;getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~7#1; {119#false} is VALID [2022-02-20 18:09:53,032 INFO L290 TraceCheckUtils]: 20: Hoare triple {119#false} __utac_acc__Specification3_spec__1_#t~ret54#1 := getWaterLevel_#res#1;assume { :end_inline_getWaterLevel } true;assume -2147483648 <= __utac_acc__Specification3_spec__1_#t~ret54#1 && __utac_acc__Specification3_spec__1_#t~ret54#1 <= 2147483647;__utac_acc__Specification3_spec__1_~tmp___0~3#1 := __utac_acc__Specification3_spec__1_#t~ret54#1;havoc __utac_acc__Specification3_spec__1_#t~ret54#1; {119#false} is VALID [2022-02-20 18:09:53,032 INFO L290 TraceCheckUtils]: 21: Hoare triple {119#false} assume 2 == __utac_acc__Specification3_spec__1_~tmp___0~3#1;assume { :begin_inline_isPumpRunning } true;havoc isPumpRunning_#res#1;havoc isPumpRunning_~retValue_acc~3#1;havoc isPumpRunning_~retValue_acc~3#1;isPumpRunning_~retValue_acc~3#1 := ~pumpRunning~0;isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~3#1; {119#false} is VALID [2022-02-20 18:09:53,032 INFO L290 TraceCheckUtils]: 22: Hoare triple {119#false} __utac_acc__Specification3_spec__1_#t~ret55#1 := isPumpRunning_#res#1;assume { :end_inline_isPumpRunning } true;assume -2147483648 <= __utac_acc__Specification3_spec__1_#t~ret55#1 && __utac_acc__Specification3_spec__1_#t~ret55#1 <= 2147483647;__utac_acc__Specification3_spec__1_~tmp___1~1#1 := __utac_acc__Specification3_spec__1_#t~ret55#1;havoc __utac_acc__Specification3_spec__1_#t~ret55#1; {119#false} is VALID [2022-02-20 18:09:53,033 INFO L290 TraceCheckUtils]: 23: Hoare triple {119#false} assume !(0 != __utac_acc__Specification3_spec__1_~tmp___1~1#1);assume { :begin_inline___automaton_fail } true; {119#false} is VALID [2022-02-20 18:09:53,033 INFO L290 TraceCheckUtils]: 24: Hoare triple {119#false} assume !false; {119#false} is VALID [2022-02-20 18:09:53,033 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:53,034 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:09:53,034 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300527430] [2022-02-20 18:09:53,034 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300527430] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:09:53,035 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:09:53,035 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 18:09:53,037 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766385194] [2022-02-20 18:09:53,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:09:53,042 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:09:53,043 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:09:53,045 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:09:53,070 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:53,070 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 18:09:53,070 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:09:53,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 18:09:53,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 18:09:53,091 INFO L87 Difference]: Start difference. First operand has 115 states, 84 states have (on average 1.369047619047619) internal successors, (115), 95 states have internal predecessors, (115), 19 states have call successors, (19), 10 states have call predecessors, (19), 10 states have return successors, (19), 14 states have call predecessors, (19), 19 states have call successors, (19) 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:09:53,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:09:53,217 INFO L93 Difference]: Finished difference Result 222 states and 301 transitions. [2022-02-20 18:09:53,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 18:09:53,218 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:09:53,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:09:53,219 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:09:53,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 301 transitions. [2022-02-20 18:09:53,235 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:09:53,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 301 transitions. [2022-02-20 18:09:53,249 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 301 transitions. [2022-02-20 18:09:53,464 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 301 edges. 301 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:09:53,477 INFO L225 Difference]: With dead ends: 222 [2022-02-20 18:09:53,478 INFO L226 Difference]: Without dead ends: 106 [2022-02-20 18:09:53,485 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:09:53,487 INFO L933 BasicCegarLoop]: 147 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, 147 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:53,489 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 147 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:53,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-02-20 18:09:53,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2022-02-20 18:09:53,522 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:09:53,523 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand has 106 states, 77 states have (on average 1.3116883116883118) internal successors, (101), 87 states have internal predecessors, (101), 19 states have call successors, (19), 10 states have call predecessors, (19), 9 states have return successors, (18), 13 states have call predecessors, (18), 18 states have call successors, (18) [2022-02-20 18:09:53,524 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand has 106 states, 77 states have (on average 1.3116883116883118) internal successors, (101), 87 states have internal predecessors, (101), 19 states have call successors, (19), 10 states have call predecessors, (19), 9 states have return successors, (18), 13 states have call predecessors, (18), 18 states have call successors, (18) [2022-02-20 18:09:53,524 INFO L87 Difference]: Start difference. First operand 106 states. Second operand has 106 states, 77 states have (on average 1.3116883116883118) internal successors, (101), 87 states have internal predecessors, (101), 19 states have call successors, (19), 10 states have call predecessors, (19), 9 states have return successors, (18), 13 states have call predecessors, (18), 18 states have call successors, (18) [2022-02-20 18:09:53,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:09:53,530 INFO L93 Difference]: Finished difference Result 106 states and 138 transitions. [2022-02-20 18:09:53,530 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 138 transitions. [2022-02-20 18:09:53,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:09:53,531 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:09:53,532 INFO L74 IsIncluded]: Start isIncluded. First operand has 106 states, 77 states have (on average 1.3116883116883118) internal successors, (101), 87 states have internal predecessors, (101), 19 states have call successors, (19), 10 states have call predecessors, (19), 9 states have return successors, (18), 13 states have call predecessors, (18), 18 states have call successors, (18) Second operand 106 states. [2022-02-20 18:09:53,532 INFO L87 Difference]: Start difference. First operand has 106 states, 77 states have (on average 1.3116883116883118) internal successors, (101), 87 states have internal predecessors, (101), 19 states have call successors, (19), 10 states have call predecessors, (19), 9 states have return successors, (18), 13 states have call predecessors, (18), 18 states have call successors, (18) Second operand 106 states. [2022-02-20 18:09:53,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:09:53,543 INFO L93 Difference]: Finished difference Result 106 states and 138 transitions. [2022-02-20 18:09:53,543 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 138 transitions. [2022-02-20 18:09:53,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:09:53,544 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:09:53,544 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:09:53,544 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:09:53,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 77 states have (on average 1.3116883116883118) internal successors, (101), 87 states have internal predecessors, (101), 19 states have call successors, (19), 10 states have call predecessors, (19), 9 states have return successors, (18), 13 states have call predecessors, (18), 18 states have call successors, (18) [2022-02-20 18:09:53,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 138 transitions. [2022-02-20 18:09:53,552 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 138 transitions. Word has length 25 [2022-02-20 18:09:53,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:09:53,552 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 138 transitions. [2022-02-20 18:09:53,552 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:09:53,552 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 138 transitions. [2022-02-20 18:09:53,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 18:09:53,554 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:09:53,554 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:53,554 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:09:53,554 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:09:53,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:09:53,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1446667371, now seen corresponding path program 1 times [2022-02-20 18:09:53,555 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:09:53,555 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035292148] [2022-02-20 18:09:53,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:09:53,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:09:53,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:09:53,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-20 18:09:53,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:09:53,612 INFO L290 TraceCheckUtils]: 0: Hoare triple {814#true} havoc ~retValue_acc~6;~retValue_acc~6 := ~methaneLevelCritical~0;#res := ~retValue_acc~6; {814#true} is VALID [2022-02-20 18:09:53,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {814#true} assume true; {814#true} is VALID [2022-02-20 18:09:53,612 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {814#true} {815#false} #297#return; {815#false} is VALID [2022-02-20 18:09:53,612 INFO L290 TraceCheckUtils]: 0: Hoare triple {814#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(13, 4);call #Ultimate.allocInit(3, 5);call write~init~int(79, 5, 0, 1);call write~init~int(110, 5, 1, 1);call write~init~int(0, 5, 2, 1);call #Ultimate.allocInit(4, 6);call write~init~int(79, 6, 0, 1);call write~init~int(102, 6, 1, 1);call write~init~int(102, 6, 2, 1);call write~init~int(0, 6, 3, 1);call #Ultimate.allocInit(7, 7);call write~init~int(44, 7, 0, 1);call write~init~int(80, 7, 1, 1);call write~init~int(117, 7, 2, 1);call write~init~int(109, 7, 3, 1);call write~init~int(112, 7, 4, 1);call write~init~int(58, 7, 5, 1);call write~init~int(0, 7, 6, 1);call #Ultimate.allocInit(3, 8);call write~init~int(79, 8, 0, 1);call write~init~int(110, 8, 1, 1);call write~init~int(0, 8, 2, 1);call #Ultimate.allocInit(4, 9);call write~init~int(79, 9, 0, 1);call write~init~int(102, 9, 1, 1);call write~init~int(102, 9, 2, 1);call write~init~int(0, 9, 3, 1);call #Ultimate.allocInit(3, 10);call write~init~int(41, 10, 0, 1);call write~init~int(32, 10, 1, 1);call write~init~int(0, 10, 2, 1);call #Ultimate.allocInit(2, 11);call write~init~int(10, 11, 0, 1);call write~init~int(0, 11, 1, 1);call #Ultimate.allocInit(13, 12);call #Ultimate.allocInit(7, 13);call write~init~int(44, 13, 0, 1);call write~init~int(77, 13, 1, 1);call write~init~int(101, 13, 2, 1);call write~init~int(116, 13, 3, 1);call write~init~int(104, 13, 4, 1);call write~init~int(58, 13, 5, 1);call write~init~int(0, 13, 6, 1);call #Ultimate.allocInit(5, 14);call write~init~int(67, 14, 0, 1);call write~init~int(82, 14, 1, 1);call write~init~int(73, 14, 2, 1);call write~init~int(84, 14, 3, 1);call write~init~int(0, 14, 4, 1);call #Ultimate.allocInit(3, 15);call write~init~int(79, 15, 0, 1);call write~init~int(75, 15, 1, 1);call write~init~int(0, 15, 2, 1);call #Ultimate.allocInit(2, 16);call write~init~int(41, 16, 0, 1);call write~init~int(0, 16, 1, 1);call #Ultimate.allocInit(30, 17);call #Ultimate.allocInit(9, 18);call #Ultimate.allocInit(21, 19);call #Ultimate.allocInit(30, 20);call #Ultimate.allocInit(9, 21);call #Ultimate.allocInit(21, 22);call #Ultimate.allocInit(30, 23);call #Ultimate.allocInit(9, 24);call #Ultimate.allocInit(25, 25);call #Ultimate.allocInit(30, 26);call #Ultimate.allocInit(9, 27);call #Ultimate.allocInit(25, 28);~pumpRunning~0 := 0;~systemActive~0 := 1;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~head~0.base, ~head~0.offset := 0, 0;~cleanupTimeShifts~0 := 4; {814#true} is VALID [2022-02-20 18:09:53,613 INFO L290 TraceCheckUtils]: 1: Hoare triple {814#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret52#1, main_~retValue_acc~13#1, main_~tmp~10#1;havoc main_~retValue_acc~13#1;havoc main_~tmp~10#1;assume { :begin_inline_select_helpers } true; {814#true} is VALID [2022-02-20 18:09:53,613 INFO L290 TraceCheckUtils]: 2: Hoare triple {814#true} assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; {814#true} is VALID [2022-02-20 18:09:53,613 INFO L290 TraceCheckUtils]: 3: Hoare triple {814#true} assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~1#1;havoc valid_product_~retValue_acc~1#1;valid_product_~retValue_acc~1#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~1#1; {814#true} is VALID [2022-02-20 18:09:53,613 INFO L290 TraceCheckUtils]: 4: Hoare triple {814#true} main_#t~ret52#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;assume -2147483648 <= main_#t~ret52#1 && main_#t~ret52#1 <= 2147483647;main_~tmp~10#1 := main_#t~ret52#1;havoc main_#t~ret52#1; {814#true} is VALID [2022-02-20 18:09:53,613 INFO L290 TraceCheckUtils]: 5: Hoare triple {814#true} assume 0 != main_~tmp~10#1;assume { :begin_inline_setup } true; {814#true} is VALID [2022-02-20 18:09:53,614 INFO L290 TraceCheckUtils]: 6: Hoare triple {814#true} assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;havoc test_#t~nondet20#1, test_#t~nondet21#1, test_#t~nondet22#1, test_#t~nondet23#1, test_~splverifierCounter~0#1, test_~tmp~6#1, test_~tmp___0~2#1, test_~tmp___1~0#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~6#1;havoc test_~tmp___0~2#1;havoc test_~tmp___1~0#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0; {816#(= |ULTIMATE.start_test_~splverifierCounter~0#1| 0)} is VALID [2022-02-20 18:09:53,614 INFO L290 TraceCheckUtils]: 7: Hoare triple {816#(= |ULTIMATE.start_test_~splverifierCounter~0#1| 0)} assume !false; {816#(= |ULTIMATE.start_test_~splverifierCounter~0#1| 0)} is VALID [2022-02-20 18:09:53,615 INFO L290 TraceCheckUtils]: 8: Hoare triple {816#(= |ULTIMATE.start_test_~splverifierCounter~0#1| 0)} assume !(test_~splverifierCounter~0#1 < 4); {815#false} is VALID [2022-02-20 18:09:53,615 INFO L272 TraceCheckUtils]: 9: Hoare triple {815#false} call cleanup(); {815#false} is VALID [2022-02-20 18:09:53,615 INFO L290 TraceCheckUtils]: 10: Hoare triple {815#false} havoc ~i~0;havoc ~__cil_tmp2~0; {815#false} is VALID [2022-02-20 18:09:53,615 INFO L272 TraceCheckUtils]: 11: Hoare triple {815#false} call timeShift(); {815#false} is VALID [2022-02-20 18:09:53,615 INFO L290 TraceCheckUtils]: 12: Hoare triple {815#false} assume !(0 != ~pumpRunning~0); {815#false} is VALID [2022-02-20 18:09:53,616 INFO L290 TraceCheckUtils]: 13: Hoare triple {815#false} assume !(0 != ~systemActive~0); {815#false} is VALID [2022-02-20 18:09:53,616 INFO L290 TraceCheckUtils]: 14: Hoare triple {815#false} assume { :begin_inline___utac_acc__Specification3_spec__1 } true;havoc __utac_acc__Specification3_spec__1_#t~ret53#1, __utac_acc__Specification3_spec__1_#t~ret54#1, __utac_acc__Specification3_spec__1_#t~ret55#1, __utac_acc__Specification3_spec__1_~tmp~11#1, __utac_acc__Specification3_spec__1_~tmp___0~3#1, __utac_acc__Specification3_spec__1_~tmp___1~1#1;havoc __utac_acc__Specification3_spec__1_~tmp~11#1;havoc __utac_acc__Specification3_spec__1_~tmp___0~3#1;havoc __utac_acc__Specification3_spec__1_~tmp___1~1#1; {815#false} is VALID [2022-02-20 18:09:53,616 INFO L272 TraceCheckUtils]: 15: Hoare triple {815#false} call __utac_acc__Specification3_spec__1_#t~ret53#1 := isMethaneLevelCritical(); {814#true} is VALID [2022-02-20 18:09:53,616 INFO L290 TraceCheckUtils]: 16: Hoare triple {814#true} havoc ~retValue_acc~6;~retValue_acc~6 := ~methaneLevelCritical~0;#res := ~retValue_acc~6; {814#true} is VALID [2022-02-20 18:09:53,616 INFO L290 TraceCheckUtils]: 17: Hoare triple {814#true} assume true; {814#true} is VALID [2022-02-20 18:09:53,616 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {814#true} {815#false} #297#return; {815#false} is VALID [2022-02-20 18:09:53,617 INFO L290 TraceCheckUtils]: 19: Hoare triple {815#false} assume -2147483648 <= __utac_acc__Specification3_spec__1_#t~ret53#1 && __utac_acc__Specification3_spec__1_#t~ret53#1 <= 2147483647;__utac_acc__Specification3_spec__1_~tmp~11#1 := __utac_acc__Specification3_spec__1_#t~ret53#1;havoc __utac_acc__Specification3_spec__1_#t~ret53#1; {815#false} is VALID [2022-02-20 18:09:53,617 INFO L290 TraceCheckUtils]: 20: Hoare triple {815#false} assume !(0 != __utac_acc__Specification3_spec__1_~tmp~11#1);assume { :begin_inline_getWaterLevel } true;havoc getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~7#1;havoc getWaterLevel_~retValue_acc~7#1;getWaterLevel_~retValue_acc~7#1 := ~waterLevel~0;getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~7#1; {815#false} is VALID [2022-02-20 18:09:53,617 INFO L290 TraceCheckUtils]: 21: Hoare triple {815#false} __utac_acc__Specification3_spec__1_#t~ret54#1 := getWaterLevel_#res#1;assume { :end_inline_getWaterLevel } true;assume -2147483648 <= __utac_acc__Specification3_spec__1_#t~ret54#1 && __utac_acc__Specification3_spec__1_#t~ret54#1 <= 2147483647;__utac_acc__Specification3_spec__1_~tmp___0~3#1 := __utac_acc__Specification3_spec__1_#t~ret54#1;havoc __utac_acc__Specification3_spec__1_#t~ret54#1; {815#false} is VALID [2022-02-20 18:09:53,617 INFO L290 TraceCheckUtils]: 22: Hoare triple {815#false} assume 2 == __utac_acc__Specification3_spec__1_~tmp___0~3#1;assume { :begin_inline_isPumpRunning } true;havoc isPumpRunning_#res#1;havoc isPumpRunning_~retValue_acc~3#1;havoc isPumpRunning_~retValue_acc~3#1;isPumpRunning_~retValue_acc~3#1 := ~pumpRunning~0;isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~3#1; {815#false} is VALID [2022-02-20 18:09:53,617 INFO L290 TraceCheckUtils]: 23: Hoare triple {815#false} __utac_acc__Specification3_spec__1_#t~ret55#1 := isPumpRunning_#res#1;assume { :end_inline_isPumpRunning } true;assume -2147483648 <= __utac_acc__Specification3_spec__1_#t~ret55#1 && __utac_acc__Specification3_spec__1_#t~ret55#1 <= 2147483647;__utac_acc__Specification3_spec__1_~tmp___1~1#1 := __utac_acc__Specification3_spec__1_#t~ret55#1;havoc __utac_acc__Specification3_spec__1_#t~ret55#1; {815#false} is VALID [2022-02-20 18:09:53,618 INFO L290 TraceCheckUtils]: 24: Hoare triple {815#false} assume !(0 != __utac_acc__Specification3_spec__1_~tmp___1~1#1);assume { :begin_inline___automaton_fail } true; {815#false} is VALID [2022-02-20 18:09:53,618 INFO L290 TraceCheckUtils]: 25: Hoare triple {815#false} assume !false; {815#false} is VALID [2022-02-20 18:09:53,618 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:53,618 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:09:53,618 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035292148] [2022-02-20 18:09:53,619 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035292148] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:09:53,619 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:09:53,619 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:09:53,619 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126288051] [2022-02-20 18:09:53,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:09:53,620 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:09:53,620 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:09:53,621 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:09:53,644 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:53,644 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:09:53,645 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:09:53,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:09:53,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:09:53,646 INFO L87 Difference]: Start difference. First operand 106 states and 138 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:09:53,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:09:53,766 INFO L93 Difference]: Finished difference Result 173 states and 225 transitions. [2022-02-20 18:09:53,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:09:53,766 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:09:53,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:09:53,767 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:09:53,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 225 transitions. [2022-02-20 18:09:53,769 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:09:53,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 225 transitions. [2022-02-20 18:09:53,773 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 225 transitions. [2022-02-20 18:09:53,936 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 225 edges. 225 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:09:53,940 INFO L225 Difference]: With dead ends: 173 [2022-02-20 18:09:53,940 INFO L226 Difference]: Without dead ends: 97 [2022-02-20 18:09:53,946 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:09:53,949 INFO L933 BasicCegarLoop]: 125 mSDtfsCounter, 17 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 228 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:53,949 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 228 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:53,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-02-20 18:09:53,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2022-02-20 18:09:53,962 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:09:53,963 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand has 97 states, 71 states have (on average 1.323943661971831) internal successors, (94), 81 states have internal predecessors, (94), 16 states have call successors, (16), 9 states have call predecessors, (16), 9 states have return successors, (16), 11 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 18:09:53,963 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand has 97 states, 71 states have (on average 1.323943661971831) internal successors, (94), 81 states have internal predecessors, (94), 16 states have call successors, (16), 9 states have call predecessors, (16), 9 states have return successors, (16), 11 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 18:09:53,964 INFO L87 Difference]: Start difference. First operand 97 states. Second operand has 97 states, 71 states have (on average 1.323943661971831) internal successors, (94), 81 states have internal predecessors, (94), 16 states have call successors, (16), 9 states have call predecessors, (16), 9 states have return successors, (16), 11 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 18:09:53,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:09:53,969 INFO L93 Difference]: Finished difference Result 97 states and 126 transitions. [2022-02-20 18:09:53,969 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 126 transitions. [2022-02-20 18:09:53,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:09:53,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:09:53,974 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 71 states have (on average 1.323943661971831) internal successors, (94), 81 states have internal predecessors, (94), 16 states have call successors, (16), 9 states have call predecessors, (16), 9 states have return successors, (16), 11 states have call predecessors, (16), 16 states have call successors, (16) Second operand 97 states. [2022-02-20 18:09:53,975 INFO L87 Difference]: Start difference. First operand has 97 states, 71 states have (on average 1.323943661971831) internal successors, (94), 81 states have internal predecessors, (94), 16 states have call successors, (16), 9 states have call predecessors, (16), 9 states have return successors, (16), 11 states have call predecessors, (16), 16 states have call successors, (16) Second operand 97 states. [2022-02-20 18:09:53,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:09:53,978 INFO L93 Difference]: Finished difference Result 97 states and 126 transitions. [2022-02-20 18:09:53,978 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 126 transitions. [2022-02-20 18:09:53,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:09:53,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:09:53,979 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:09:53,979 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:09:53,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 71 states have (on average 1.323943661971831) internal successors, (94), 81 states have internal predecessors, (94), 16 states have call successors, (16), 9 states have call predecessors, (16), 9 states have return successors, (16), 11 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 18:09:53,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 126 transitions. [2022-02-20 18:09:53,984 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 126 transitions. Word has length 26 [2022-02-20 18:09:53,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:09:53,985 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 126 transitions. [2022-02-20 18:09:53,985 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:09:53,985 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 126 transitions. [2022-02-20 18:09:53,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-20 18:09:53,986 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:09:53,986 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] [2022-02-20 18:09:53,986 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:09:53,986 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:09:53,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:09:53,987 INFO L85 PathProgramCache]: Analyzing trace with hash -752091658, now seen corresponding path program 1 times [2022-02-20 18:09:53,987 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:09:53,987 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369248865] [2022-02-20 18:09:53,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:09:53,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:09:54,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:09:54,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-20 18:09:54,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:09:54,034 INFO L290 TraceCheckUtils]: 0: Hoare triple {1407#true} havoc ~retValue_acc~6;~retValue_acc~6 := ~methaneLevelCritical~0;#res := ~retValue_acc~6; {1407#true} is VALID [2022-02-20 18:09:54,035 INFO L290 TraceCheckUtils]: 1: Hoare triple {1407#true} assume true; {1407#true} is VALID [2022-02-20 18:09:54,035 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1407#true} {1408#false} #297#return; {1408#false} is VALID [2022-02-20 18:09:54,035 INFO L290 TraceCheckUtils]: 0: Hoare triple {1407#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(13, 4);call #Ultimate.allocInit(3, 5);call write~init~int(79, 5, 0, 1);call write~init~int(110, 5, 1, 1);call write~init~int(0, 5, 2, 1);call #Ultimate.allocInit(4, 6);call write~init~int(79, 6, 0, 1);call write~init~int(102, 6, 1, 1);call write~init~int(102, 6, 2, 1);call write~init~int(0, 6, 3, 1);call #Ultimate.allocInit(7, 7);call write~init~int(44, 7, 0, 1);call write~init~int(80, 7, 1, 1);call write~init~int(117, 7, 2, 1);call write~init~int(109, 7, 3, 1);call write~init~int(112, 7, 4, 1);call write~init~int(58, 7, 5, 1);call write~init~int(0, 7, 6, 1);call #Ultimate.allocInit(3, 8);call write~init~int(79, 8, 0, 1);call write~init~int(110, 8, 1, 1);call write~init~int(0, 8, 2, 1);call #Ultimate.allocInit(4, 9);call write~init~int(79, 9, 0, 1);call write~init~int(102, 9, 1, 1);call write~init~int(102, 9, 2, 1);call write~init~int(0, 9, 3, 1);call #Ultimate.allocInit(3, 10);call write~init~int(41, 10, 0, 1);call write~init~int(32, 10, 1, 1);call write~init~int(0, 10, 2, 1);call #Ultimate.allocInit(2, 11);call write~init~int(10, 11, 0, 1);call write~init~int(0, 11, 1, 1);call #Ultimate.allocInit(13, 12);call #Ultimate.allocInit(7, 13);call write~init~int(44, 13, 0, 1);call write~init~int(77, 13, 1, 1);call write~init~int(101, 13, 2, 1);call write~init~int(116, 13, 3, 1);call write~init~int(104, 13, 4, 1);call write~init~int(58, 13, 5, 1);call write~init~int(0, 13, 6, 1);call #Ultimate.allocInit(5, 14);call write~init~int(67, 14, 0, 1);call write~init~int(82, 14, 1, 1);call write~init~int(73, 14, 2, 1);call write~init~int(84, 14, 3, 1);call write~init~int(0, 14, 4, 1);call #Ultimate.allocInit(3, 15);call write~init~int(79, 15, 0, 1);call write~init~int(75, 15, 1, 1);call write~init~int(0, 15, 2, 1);call #Ultimate.allocInit(2, 16);call write~init~int(41, 16, 0, 1);call write~init~int(0, 16, 1, 1);call #Ultimate.allocInit(30, 17);call #Ultimate.allocInit(9, 18);call #Ultimate.allocInit(21, 19);call #Ultimate.allocInit(30, 20);call #Ultimate.allocInit(9, 21);call #Ultimate.allocInit(21, 22);call #Ultimate.allocInit(30, 23);call #Ultimate.allocInit(9, 24);call #Ultimate.allocInit(25, 25);call #Ultimate.allocInit(30, 26);call #Ultimate.allocInit(9, 27);call #Ultimate.allocInit(25, 28);~pumpRunning~0 := 0;~systemActive~0 := 1;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~head~0.base, ~head~0.offset := 0, 0;~cleanupTimeShifts~0 := 4; {1407#true} is VALID [2022-02-20 18:09:54,035 INFO L290 TraceCheckUtils]: 1: Hoare triple {1407#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret52#1, main_~retValue_acc~13#1, main_~tmp~10#1;havoc main_~retValue_acc~13#1;havoc main_~tmp~10#1;assume { :begin_inline_select_helpers } true; {1407#true} is VALID [2022-02-20 18:09:54,035 INFO L290 TraceCheckUtils]: 2: Hoare triple {1407#true} assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; {1407#true} is VALID [2022-02-20 18:09:54,036 INFO L290 TraceCheckUtils]: 3: Hoare triple {1407#true} assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~1#1;havoc valid_product_~retValue_acc~1#1;valid_product_~retValue_acc~1#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~1#1; {1407#true} is VALID [2022-02-20 18:09:54,036 INFO L290 TraceCheckUtils]: 4: Hoare triple {1407#true} main_#t~ret52#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;assume -2147483648 <= main_#t~ret52#1 && main_#t~ret52#1 <= 2147483647;main_~tmp~10#1 := main_#t~ret52#1;havoc main_#t~ret52#1; {1407#true} is VALID [2022-02-20 18:09:54,036 INFO L290 TraceCheckUtils]: 5: Hoare triple {1407#true} assume 0 != main_~tmp~10#1;assume { :begin_inline_setup } true; {1407#true} is VALID [2022-02-20 18:09:54,036 INFO L290 TraceCheckUtils]: 6: Hoare triple {1407#true} assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;havoc test_#t~nondet20#1, test_#t~nondet21#1, test_#t~nondet22#1, test_#t~nondet23#1, test_~splverifierCounter~0#1, test_~tmp~6#1, test_~tmp___0~2#1, test_~tmp___1~0#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~6#1;havoc test_~tmp___0~2#1;havoc test_~tmp___1~0#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0; {1407#true} is VALID [2022-02-20 18:09:54,036 INFO L290 TraceCheckUtils]: 7: Hoare triple {1407#true} assume !false; {1407#true} is VALID [2022-02-20 18:09:54,036 INFO L290 TraceCheckUtils]: 8: Hoare triple {1407#true} assume test_~splverifierCounter~0#1 < 4; {1407#true} is VALID [2022-02-20 18:09:54,037 INFO L290 TraceCheckUtils]: 9: Hoare triple {1407#true} assume -2147483648 <= test_#t~nondet20#1 && test_#t~nondet20#1 <= 2147483647;test_~tmp~6#1 := test_#t~nondet20#1;havoc test_#t~nondet20#1; {1407#true} is VALID [2022-02-20 18:09:54,037 INFO L290 TraceCheckUtils]: 10: Hoare triple {1407#true} assume !(0 != test_~tmp~6#1); {1407#true} is VALID [2022-02-20 18:09:54,037 INFO L290 TraceCheckUtils]: 11: Hoare triple {1407#true} assume -2147483648 <= test_#t~nondet21#1 && test_#t~nondet21#1 <= 2147483647;test_~tmp___0~2#1 := test_#t~nondet21#1;havoc test_#t~nondet21#1; {1407#true} is VALID [2022-02-20 18:09:54,037 INFO L290 TraceCheckUtils]: 12: Hoare triple {1407#true} assume !(0 != test_~tmp___0~2#1); {1407#true} is VALID [2022-02-20 18:09:54,037 INFO L290 TraceCheckUtils]: 13: Hoare triple {1407#true} assume -2147483648 <= test_#t~nondet22#1 && test_#t~nondet22#1 <= 2147483647;test_~tmp___2~0#1 := test_#t~nondet22#1;havoc test_#t~nondet22#1; {1407#true} is VALID [2022-02-20 18:09:54,038 INFO L290 TraceCheckUtils]: 14: Hoare triple {1407#true} assume 0 != test_~tmp___2~0#1;assume { :begin_inline_startSystem } true;~systemActive~0 := 1; {1409#(= 1 ~systemActive~0)} is VALID [2022-02-20 18:09:54,038 INFO L290 TraceCheckUtils]: 15: Hoare triple {1409#(= 1 ~systemActive~0)} assume { :end_inline_startSystem } true; {1409#(= 1 ~systemActive~0)} is VALID [2022-02-20 18:09:54,039 INFO L272 TraceCheckUtils]: 16: Hoare triple {1409#(= 1 ~systemActive~0)} call timeShift(); {1409#(= 1 ~systemActive~0)} is VALID [2022-02-20 18:09:54,039 INFO L290 TraceCheckUtils]: 17: Hoare triple {1409#(= 1 ~systemActive~0)} assume !(0 != ~pumpRunning~0); {1409#(= 1 ~systemActive~0)} is VALID [2022-02-20 18:09:54,040 INFO L290 TraceCheckUtils]: 18: Hoare triple {1409#(= 1 ~systemActive~0)} assume !(0 != ~systemActive~0); {1408#false} is VALID [2022-02-20 18:09:54,040 INFO L290 TraceCheckUtils]: 19: Hoare triple {1408#false} assume { :begin_inline___utac_acc__Specification3_spec__1 } true;havoc __utac_acc__Specification3_spec__1_#t~ret53#1, __utac_acc__Specification3_spec__1_#t~ret54#1, __utac_acc__Specification3_spec__1_#t~ret55#1, __utac_acc__Specification3_spec__1_~tmp~11#1, __utac_acc__Specification3_spec__1_~tmp___0~3#1, __utac_acc__Specification3_spec__1_~tmp___1~1#1;havoc __utac_acc__Specification3_spec__1_~tmp~11#1;havoc __utac_acc__Specification3_spec__1_~tmp___0~3#1;havoc __utac_acc__Specification3_spec__1_~tmp___1~1#1; {1408#false} is VALID [2022-02-20 18:09:54,040 INFO L272 TraceCheckUtils]: 20: Hoare triple {1408#false} call __utac_acc__Specification3_spec__1_#t~ret53#1 := isMethaneLevelCritical(); {1407#true} is VALID [2022-02-20 18:09:54,040 INFO L290 TraceCheckUtils]: 21: Hoare triple {1407#true} havoc ~retValue_acc~6;~retValue_acc~6 := ~methaneLevelCritical~0;#res := ~retValue_acc~6; {1407#true} is VALID [2022-02-20 18:09:54,040 INFO L290 TraceCheckUtils]: 22: Hoare triple {1407#true} assume true; {1407#true} is VALID [2022-02-20 18:09:54,041 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1407#true} {1408#false} #297#return; {1408#false} is VALID [2022-02-20 18:09:54,041 INFO L290 TraceCheckUtils]: 24: Hoare triple {1408#false} assume -2147483648 <= __utac_acc__Specification3_spec__1_#t~ret53#1 && __utac_acc__Specification3_spec__1_#t~ret53#1 <= 2147483647;__utac_acc__Specification3_spec__1_~tmp~11#1 := __utac_acc__Specification3_spec__1_#t~ret53#1;havoc __utac_acc__Specification3_spec__1_#t~ret53#1; {1408#false} is VALID [2022-02-20 18:09:54,041 INFO L290 TraceCheckUtils]: 25: Hoare triple {1408#false} assume !(0 != __utac_acc__Specification3_spec__1_~tmp~11#1);assume { :begin_inline_getWaterLevel } true;havoc getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~7#1;havoc getWaterLevel_~retValue_acc~7#1;getWaterLevel_~retValue_acc~7#1 := ~waterLevel~0;getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~7#1; {1408#false} is VALID [2022-02-20 18:09:54,041 INFO L290 TraceCheckUtils]: 26: Hoare triple {1408#false} __utac_acc__Specification3_spec__1_#t~ret54#1 := getWaterLevel_#res#1;assume { :end_inline_getWaterLevel } true;assume -2147483648 <= __utac_acc__Specification3_spec__1_#t~ret54#1 && __utac_acc__Specification3_spec__1_#t~ret54#1 <= 2147483647;__utac_acc__Specification3_spec__1_~tmp___0~3#1 := __utac_acc__Specification3_spec__1_#t~ret54#1;havoc __utac_acc__Specification3_spec__1_#t~ret54#1; {1408#false} is VALID [2022-02-20 18:09:54,041 INFO L290 TraceCheckUtils]: 27: Hoare triple {1408#false} assume 2 == __utac_acc__Specification3_spec__1_~tmp___0~3#1;assume { :begin_inline_isPumpRunning } true;havoc isPumpRunning_#res#1;havoc isPumpRunning_~retValue_acc~3#1;havoc isPumpRunning_~retValue_acc~3#1;isPumpRunning_~retValue_acc~3#1 := ~pumpRunning~0;isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~3#1; {1408#false} is VALID [2022-02-20 18:09:54,041 INFO L290 TraceCheckUtils]: 28: Hoare triple {1408#false} __utac_acc__Specification3_spec__1_#t~ret55#1 := isPumpRunning_#res#1;assume { :end_inline_isPumpRunning } true;assume -2147483648 <= __utac_acc__Specification3_spec__1_#t~ret55#1 && __utac_acc__Specification3_spec__1_#t~ret55#1 <= 2147483647;__utac_acc__Specification3_spec__1_~tmp___1~1#1 := __utac_acc__Specification3_spec__1_#t~ret55#1;havoc __utac_acc__Specification3_spec__1_#t~ret55#1; {1408#false} is VALID [2022-02-20 18:09:54,042 INFO L290 TraceCheckUtils]: 29: Hoare triple {1408#false} assume !(0 != __utac_acc__Specification3_spec__1_~tmp___1~1#1);assume { :begin_inline___automaton_fail } true; {1408#false} is VALID [2022-02-20 18:09:54,042 INFO L290 TraceCheckUtils]: 30: Hoare triple {1408#false} assume !false; {1408#false} is VALID [2022-02-20 18:09:54,042 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:54,042 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:09:54,042 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369248865] [2022-02-20 18:09:54,043 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369248865] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:09:54,043 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:09:54,043 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:09:54,043 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441688247] [2022-02-20 18:09:54,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:09:54,044 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 31 [2022-02-20 18:09:54,044 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:09:54,044 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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:54,063 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:09:54,063 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:09:54,063 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:09:54,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:09:54,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:09:54,064 INFO L87 Difference]: Start difference. First operand 97 states and 126 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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:54,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:09:54,208 INFO L93 Difference]: Finished difference Result 275 states and 363 transitions. [2022-02-20 18:09:54,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:09:54,208 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 31 [2022-02-20 18:09:54,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:09:54,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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:54,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 363 transitions. [2022-02-20 18:09:54,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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:54,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 363 transitions. [2022-02-20 18:09:54,216 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 363 transitions. [2022-02-20 18:09:54,433 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 363 edges. 363 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:09:54,437 INFO L225 Difference]: With dead ends: 275 [2022-02-20 18:09:54,437 INFO L226 Difference]: Without dead ends: 185 [2022-02-20 18:09:54,438 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:09:54,438 INFO L933 BasicCegarLoop]: 160 mSDtfsCounter, 118 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:09:54,439 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 274 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:09:54,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-02-20 18:09:54,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 182. [2022-02-20 18:09:54,450 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:09:54,450 INFO L82 GeneralOperation]: Start isEquivalent. First operand 185 states. Second operand has 182 states, 131 states have (on average 1.3435114503816794) internal successors, (176), 150 states have internal predecessors, (176), 32 states have call successors, (32), 18 states have call predecessors, (32), 18 states have return successors, (32), 21 states have call predecessors, (32), 32 states have call successors, (32) [2022-02-20 18:09:54,451 INFO L74 IsIncluded]: Start isIncluded. First operand 185 states. Second operand has 182 states, 131 states have (on average 1.3435114503816794) internal successors, (176), 150 states have internal predecessors, (176), 32 states have call successors, (32), 18 states have call predecessors, (32), 18 states have return successors, (32), 21 states have call predecessors, (32), 32 states have call successors, (32) [2022-02-20 18:09:54,452 INFO L87 Difference]: Start difference. First operand 185 states. Second operand has 182 states, 131 states have (on average 1.3435114503816794) internal successors, (176), 150 states have internal predecessors, (176), 32 states have call successors, (32), 18 states have call predecessors, (32), 18 states have return successors, (32), 21 states have call predecessors, (32), 32 states have call successors, (32) [2022-02-20 18:09:54,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:09:54,457 INFO L93 Difference]: Finished difference Result 185 states and 242 transitions. [2022-02-20 18:09:54,457 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 242 transitions. [2022-02-20 18:09:54,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:09:54,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:09:54,458 INFO L74 IsIncluded]: Start isIncluded. First operand has 182 states, 131 states have (on average 1.3435114503816794) internal successors, (176), 150 states have internal predecessors, (176), 32 states have call successors, (32), 18 states have call predecessors, (32), 18 states have return successors, (32), 21 states have call predecessors, (32), 32 states have call successors, (32) Second operand 185 states. [2022-02-20 18:09:54,459 INFO L87 Difference]: Start difference. First operand has 182 states, 131 states have (on average 1.3435114503816794) internal successors, (176), 150 states have internal predecessors, (176), 32 states have call successors, (32), 18 states have call predecessors, (32), 18 states have return successors, (32), 21 states have call predecessors, (32), 32 states have call successors, (32) Second operand 185 states. [2022-02-20 18:09:54,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:09:54,464 INFO L93 Difference]: Finished difference Result 185 states and 242 transitions. [2022-02-20 18:09:54,464 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 242 transitions. [2022-02-20 18:09:54,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:09:54,465 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:09:54,465 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:09:54,465 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:09:54,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 131 states have (on average 1.3435114503816794) internal successors, (176), 150 states have internal predecessors, (176), 32 states have call successors, (32), 18 states have call predecessors, (32), 18 states have return successors, (32), 21 states have call predecessors, (32), 32 states have call successors, (32) [2022-02-20 18:09:54,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 240 transitions. [2022-02-20 18:09:54,471 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 240 transitions. Word has length 31 [2022-02-20 18:09:54,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:09:54,471 INFO L470 AbstractCegarLoop]: Abstraction has 182 states and 240 transitions. [2022-02-20 18:09:54,472 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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:54,472 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 240 transitions. [2022-02-20 18:09:54,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-20 18:09:54,473 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:09:54,473 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] [2022-02-20 18:09:54,473 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:09:54,473 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:09:54,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:09:54,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1994729148, now seen corresponding path program 1 times [2022-02-20 18:09:54,474 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:09:54,474 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971517509] [2022-02-20 18:09:54,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:09:54,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:09:54,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:09:54,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-02-20 18:09:54,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:09:54,557 INFO L290 TraceCheckUtils]: 0: Hoare triple {2441#true} havoc ~retValue_acc~6;~retValue_acc~6 := ~methaneLevelCritical~0;#res := ~retValue_acc~6; {2441#true} is VALID [2022-02-20 18:09:54,557 INFO L290 TraceCheckUtils]: 1: Hoare triple {2441#true} assume true; {2441#true} is VALID [2022-02-20 18:09:54,558 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2441#true} {2443#(= ~waterLevel~0 1)} #297#return; {2443#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:09:54,558 INFO L290 TraceCheckUtils]: 0: Hoare triple {2441#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(13, 4);call #Ultimate.allocInit(3, 5);call write~init~int(79, 5, 0, 1);call write~init~int(110, 5, 1, 1);call write~init~int(0, 5, 2, 1);call #Ultimate.allocInit(4, 6);call write~init~int(79, 6, 0, 1);call write~init~int(102, 6, 1, 1);call write~init~int(102, 6, 2, 1);call write~init~int(0, 6, 3, 1);call #Ultimate.allocInit(7, 7);call write~init~int(44, 7, 0, 1);call write~init~int(80, 7, 1, 1);call write~init~int(117, 7, 2, 1);call write~init~int(109, 7, 3, 1);call write~init~int(112, 7, 4, 1);call write~init~int(58, 7, 5, 1);call write~init~int(0, 7, 6, 1);call #Ultimate.allocInit(3, 8);call write~init~int(79, 8, 0, 1);call write~init~int(110, 8, 1, 1);call write~init~int(0, 8, 2, 1);call #Ultimate.allocInit(4, 9);call write~init~int(79, 9, 0, 1);call write~init~int(102, 9, 1, 1);call write~init~int(102, 9, 2, 1);call write~init~int(0, 9, 3, 1);call #Ultimate.allocInit(3, 10);call write~init~int(41, 10, 0, 1);call write~init~int(32, 10, 1, 1);call write~init~int(0, 10, 2, 1);call #Ultimate.allocInit(2, 11);call write~init~int(10, 11, 0, 1);call write~init~int(0, 11, 1, 1);call #Ultimate.allocInit(13, 12);call #Ultimate.allocInit(7, 13);call write~init~int(44, 13, 0, 1);call write~init~int(77, 13, 1, 1);call write~init~int(101, 13, 2, 1);call write~init~int(116, 13, 3, 1);call write~init~int(104, 13, 4, 1);call write~init~int(58, 13, 5, 1);call write~init~int(0, 13, 6, 1);call #Ultimate.allocInit(5, 14);call write~init~int(67, 14, 0, 1);call write~init~int(82, 14, 1, 1);call write~init~int(73, 14, 2, 1);call write~init~int(84, 14, 3, 1);call write~init~int(0, 14, 4, 1);call #Ultimate.allocInit(3, 15);call write~init~int(79, 15, 0, 1);call write~init~int(75, 15, 1, 1);call write~init~int(0, 15, 2, 1);call #Ultimate.allocInit(2, 16);call write~init~int(41, 16, 0, 1);call write~init~int(0, 16, 1, 1);call #Ultimate.allocInit(30, 17);call #Ultimate.allocInit(9, 18);call #Ultimate.allocInit(21, 19);call #Ultimate.allocInit(30, 20);call #Ultimate.allocInit(9, 21);call #Ultimate.allocInit(21, 22);call #Ultimate.allocInit(30, 23);call #Ultimate.allocInit(9, 24);call #Ultimate.allocInit(25, 25);call #Ultimate.allocInit(30, 26);call #Ultimate.allocInit(9, 27);call #Ultimate.allocInit(25, 28);~pumpRunning~0 := 0;~systemActive~0 := 1;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0;~head~0.base, ~head~0.offset := 0, 0;~cleanupTimeShifts~0 := 4; {2443#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:09:54,559 INFO L290 TraceCheckUtils]: 1: Hoare triple {2443#(= ~waterLevel~0 1)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret52#1, main_~retValue_acc~13#1, main_~tmp~10#1;havoc main_~retValue_acc~13#1;havoc main_~tmp~10#1;assume { :begin_inline_select_helpers } true; {2443#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:09:54,559 INFO L290 TraceCheckUtils]: 2: Hoare triple {2443#(= ~waterLevel~0 1)} assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; {2443#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:09:54,560 INFO L290 TraceCheckUtils]: 3: Hoare triple {2443#(= ~waterLevel~0 1)} assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~1#1;havoc valid_product_~retValue_acc~1#1;valid_product_~retValue_acc~1#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~1#1; {2443#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:09:54,560 INFO L290 TraceCheckUtils]: 4: Hoare triple {2443#(= ~waterLevel~0 1)} main_#t~ret52#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;assume -2147483648 <= main_#t~ret52#1 && main_#t~ret52#1 <= 2147483647;main_~tmp~10#1 := main_#t~ret52#1;havoc main_#t~ret52#1; {2443#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:09:54,560 INFO L290 TraceCheckUtils]: 5: Hoare triple {2443#(= ~waterLevel~0 1)} assume 0 != main_~tmp~10#1;assume { :begin_inline_setup } true; {2443#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:09:54,561 INFO L290 TraceCheckUtils]: 6: Hoare triple {2443#(= ~waterLevel~0 1)} assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;havoc test_#t~nondet20#1, test_#t~nondet21#1, test_#t~nondet22#1, test_#t~nondet23#1, test_~splverifierCounter~0#1, test_~tmp~6#1, test_~tmp___0~2#1, test_~tmp___1~0#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~6#1;havoc test_~tmp___0~2#1;havoc test_~tmp___1~0#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0; {2443#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:09:54,561 INFO L290 TraceCheckUtils]: 7: Hoare triple {2443#(= ~waterLevel~0 1)} assume !false; {2443#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:09:54,561 INFO L290 TraceCheckUtils]: 8: Hoare triple {2443#(= ~waterLevel~0 1)} assume test_~splverifierCounter~0#1 < 4; {2443#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:09:54,562 INFO L290 TraceCheckUtils]: 9: Hoare triple {2443#(= ~waterLevel~0 1)} assume -2147483648 <= test_#t~nondet20#1 && test_#t~nondet20#1 <= 2147483647;test_~tmp~6#1 := test_#t~nondet20#1;havoc test_#t~nondet20#1; {2443#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:09:54,562 INFO L290 TraceCheckUtils]: 10: Hoare triple {2443#(= ~waterLevel~0 1)} assume !(0 != test_~tmp~6#1); {2443#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:09:54,562 INFO L290 TraceCheckUtils]: 11: Hoare triple {2443#(= ~waterLevel~0 1)} assume -2147483648 <= test_#t~nondet21#1 && test_#t~nondet21#1 <= 2147483647;test_~tmp___0~2#1 := test_#t~nondet21#1;havoc test_#t~nondet21#1; {2443#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:09:54,563 INFO L290 TraceCheckUtils]: 12: Hoare triple {2443#(= ~waterLevel~0 1)} assume !(0 != test_~tmp___0~2#1); {2443#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:09:54,563 INFO L290 TraceCheckUtils]: 13: Hoare triple {2443#(= ~waterLevel~0 1)} assume -2147483648 <= test_#t~nondet22#1 && test_#t~nondet22#1 <= 2147483647;test_~tmp___2~0#1 := test_#t~nondet22#1;havoc test_#t~nondet22#1; {2443#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:09:54,563 INFO L290 TraceCheckUtils]: 14: Hoare triple {2443#(= ~waterLevel~0 1)} assume !(0 != test_~tmp___2~0#1);assume -2147483648 <= test_#t~nondet23#1 && test_#t~nondet23#1 <= 2147483647;test_~tmp___1~0#1 := test_#t~nondet23#1;havoc test_#t~nondet23#1; {2443#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:09:54,564 INFO L290 TraceCheckUtils]: 15: Hoare triple {2443#(= ~waterLevel~0 1)} assume 0 != test_~tmp___1~0#1;assume { :begin_inline_stopSystem } true; {2443#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:09:54,564 INFO L290 TraceCheckUtils]: 16: Hoare triple {2443#(= ~waterLevel~0 1)} assume !(0 != ~pumpRunning~0); {2443#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:09:54,564 INFO L290 TraceCheckUtils]: 17: Hoare triple {2443#(= ~waterLevel~0 1)} ~systemActive~0 := 0; {2443#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:09:54,565 INFO L290 TraceCheckUtils]: 18: Hoare triple {2443#(= ~waterLevel~0 1)} assume { :end_inline_stopSystem } true; {2443#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:09:54,565 INFO L272 TraceCheckUtils]: 19: Hoare triple {2443#(= ~waterLevel~0 1)} call timeShift(); {2443#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:09:54,565 INFO L290 TraceCheckUtils]: 20: Hoare triple {2443#(= ~waterLevel~0 1)} assume !(0 != ~pumpRunning~0); {2443#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:09:54,566 INFO L290 TraceCheckUtils]: 21: Hoare triple {2443#(= ~waterLevel~0 1)} assume !(0 != ~systemActive~0); {2443#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:09:54,566 INFO L290 TraceCheckUtils]: 22: Hoare triple {2443#(= ~waterLevel~0 1)} assume { :begin_inline___utac_acc__Specification3_spec__1 } true;havoc __utac_acc__Specification3_spec__1_#t~ret53#1, __utac_acc__Specification3_spec__1_#t~ret54#1, __utac_acc__Specification3_spec__1_#t~ret55#1, __utac_acc__Specification3_spec__1_~tmp~11#1, __utac_acc__Specification3_spec__1_~tmp___0~3#1, __utac_acc__Specification3_spec__1_~tmp___1~1#1;havoc __utac_acc__Specification3_spec__1_~tmp~11#1;havoc __utac_acc__Specification3_spec__1_~tmp___0~3#1;havoc __utac_acc__Specification3_spec__1_~tmp___1~1#1; {2443#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:09:54,566 INFO L272 TraceCheckUtils]: 23: Hoare triple {2443#(= ~waterLevel~0 1)} call __utac_acc__Specification3_spec__1_#t~ret53#1 := isMethaneLevelCritical(); {2441#true} is VALID [2022-02-20 18:09:54,566 INFO L290 TraceCheckUtils]: 24: Hoare triple {2441#true} havoc ~retValue_acc~6;~retValue_acc~6 := ~methaneLevelCritical~0;#res := ~retValue_acc~6; {2441#true} is VALID [2022-02-20 18:09:54,566 INFO L290 TraceCheckUtils]: 25: Hoare triple {2441#true} assume true; {2441#true} is VALID [2022-02-20 18:09:54,567 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2441#true} {2443#(= ~waterLevel~0 1)} #297#return; {2443#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:09:54,567 INFO L290 TraceCheckUtils]: 27: Hoare triple {2443#(= ~waterLevel~0 1)} assume -2147483648 <= __utac_acc__Specification3_spec__1_#t~ret53#1 && __utac_acc__Specification3_spec__1_#t~ret53#1 <= 2147483647;__utac_acc__Specification3_spec__1_~tmp~11#1 := __utac_acc__Specification3_spec__1_#t~ret53#1;havoc __utac_acc__Specification3_spec__1_#t~ret53#1; {2443#(= ~waterLevel~0 1)} is VALID [2022-02-20 18:09:54,568 INFO L290 TraceCheckUtils]: 28: Hoare triple {2443#(= ~waterLevel~0 1)} assume !(0 != __utac_acc__Specification3_spec__1_~tmp~11#1);assume { :begin_inline_getWaterLevel } true;havoc getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~7#1;havoc getWaterLevel_~retValue_acc~7#1;getWaterLevel_~retValue_acc~7#1 := ~waterLevel~0;getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~7#1; {2447#(= |timeShift_getWaterLevel_#res#1| 1)} is VALID [2022-02-20 18:09:54,568 INFO L290 TraceCheckUtils]: 29: Hoare triple {2447#(= |timeShift_getWaterLevel_#res#1| 1)} __utac_acc__Specification3_spec__1_#t~ret54#1 := getWaterLevel_#res#1;assume { :end_inline_getWaterLevel } true;assume -2147483648 <= __utac_acc__Specification3_spec__1_#t~ret54#1 && __utac_acc__Specification3_spec__1_#t~ret54#1 <= 2147483647;__utac_acc__Specification3_spec__1_~tmp___0~3#1 := __utac_acc__Specification3_spec__1_#t~ret54#1;havoc __utac_acc__Specification3_spec__1_#t~ret54#1; {2448#(= (+ (- 1) |timeShift___utac_acc__Specification3_spec__1_~tmp___0~3#1|) 0)} is VALID [2022-02-20 18:09:54,569 INFO L290 TraceCheckUtils]: 30: Hoare triple {2448#(= (+ (- 1) |timeShift___utac_acc__Specification3_spec__1_~tmp___0~3#1|) 0)} assume 2 == __utac_acc__Specification3_spec__1_~tmp___0~3#1;assume { :begin_inline_isPumpRunning } true;havoc isPumpRunning_#res#1;havoc isPumpRunning_~retValue_acc~3#1;havoc isPumpRunning_~retValue_acc~3#1;isPumpRunning_~retValue_acc~3#1 := ~pumpRunning~0;isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~3#1; {2442#false} is VALID [2022-02-20 18:09:54,569 INFO L290 TraceCheckUtils]: 31: Hoare triple {2442#false} __utac_acc__Specification3_spec__1_#t~ret55#1 := isPumpRunning_#res#1;assume { :end_inline_isPumpRunning } true;assume -2147483648 <= __utac_acc__Specification3_spec__1_#t~ret55#1 && __utac_acc__Specification3_spec__1_#t~ret55#1 <= 2147483647;__utac_acc__Specification3_spec__1_~tmp___1~1#1 := __utac_acc__Specification3_spec__1_#t~ret55#1;havoc __utac_acc__Specification3_spec__1_#t~ret55#1; {2442#false} is VALID [2022-02-20 18:09:54,569 INFO L290 TraceCheckUtils]: 32: Hoare triple {2442#false} assume !(0 != __utac_acc__Specification3_spec__1_~tmp___1~1#1);assume { :begin_inline___automaton_fail } true; {2442#false} is VALID [2022-02-20 18:09:54,569 INFO L290 TraceCheckUtils]: 33: Hoare triple {2442#false} assume !false; {2442#false} is VALID [2022-02-20 18:09:54,569 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:54,569 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:09:54,570 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971517509] [2022-02-20 18:09:54,570 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971517509] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:09:54,570 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:09:54,570 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:09:54,570 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432567247] [2022-02-20 18:09:54,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:09:54,570 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 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 34 [2022-02-20 18:09:54,571 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:09:54,571 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 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:54,590 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:09:54,590 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:09:54,590 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:09:54,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:09:54,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:09:54,591 INFO L87 Difference]: Start difference. First operand 182 states and 240 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 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:54,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:09:54,869 INFO L93 Difference]: Finished difference Result 526 states and 715 transitions. [2022-02-20 18:09:54,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:09:54,869 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 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 34 [2022-02-20 18:09:54,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:09:54,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 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:54,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 368 transitions. [2022-02-20 18:09:54,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 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:54,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 368 transitions. [2022-02-20 18:09:54,877 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 368 transitions. [2022-02-20 18:09:55,131 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 368 edges. 368 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:09:55,140 INFO L225 Difference]: With dead ends: 526 [2022-02-20 18:09:55,140 INFO L226 Difference]: Without dead ends: 351 [2022-02-20 18:09:55,141 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:09:55,141 INFO L933 BasicCegarLoop]: 138 mSDtfsCounter, 95 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:09:55,142 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 522 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:09:55,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2022-02-20 18:09:55,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 345. [2022-02-20 18:09:55,157 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:09:55,158 INFO L82 GeneralOperation]: Start isEquivalent. First operand 351 states. Second operand has 345 states, 246 states have (on average 1.3252032520325203) internal successors, (326), 281 states have internal predecessors, (326), 64 states have call successors, (64), 36 states have call predecessors, (64), 34 states have return successors, (66), 40 states have call predecessors, (66), 64 states have call successors, (66) [2022-02-20 18:09:55,159 INFO L74 IsIncluded]: Start isIncluded. First operand 351 states. Second operand has 345 states, 246 states have (on average 1.3252032520325203) internal successors, (326), 281 states have internal predecessors, (326), 64 states have call successors, (64), 36 states have call predecessors, (64), 34 states have return successors, (66), 40 states have call predecessors, (66), 64 states have call successors, (66) [2022-02-20 18:09:55,160 INFO L87 Difference]: Start difference. First operand 351 states. Second operand has 345 states, 246 states have (on average 1.3252032520325203) internal successors, (326), 281 states have internal predecessors, (326), 64 states have call successors, (64), 36 states have call predecessors, (64), 34 states have return successors, (66), 40 states have call predecessors, (66), 64 states have call successors, (66) [2022-02-20 18:09:55,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:09:55,169 INFO L93 Difference]: Finished difference Result 351 states and 462 transitions. [2022-02-20 18:09:55,170 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 462 transitions. [2022-02-20 18:09:55,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:09:55,171 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:09:55,172 INFO L74 IsIncluded]: Start isIncluded. First operand has 345 states, 246 states have (on average 1.3252032520325203) internal successors, (326), 281 states have internal predecessors, (326), 64 states have call successors, (64), 36 states have call predecessors, (64), 34 states have return successors, (66), 40 states have call predecessors, (66), 64 states have call successors, (66) Second operand 351 states. [2022-02-20 18:09:55,176 INFO L87 Difference]: Start difference. First operand has 345 states, 246 states have (on average 1.3252032520325203) internal successors, (326), 281 states have internal predecessors, (326), 64 states have call successors, (64), 36 states have call predecessors, (64), 34 states have return successors, (66), 40 states have call predecessors, (66), 64 states have call successors, (66) Second operand 351 states. [2022-02-20 18:09:55,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:09:55,185 INFO L93 Difference]: Finished difference Result 351 states and 462 transitions. [2022-02-20 18:09:55,186 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 462 transitions. [2022-02-20 18:09:55,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:09:55,187 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:09:55,187 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:09:55,187 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:09:55,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 246 states have (on average 1.3252032520325203) internal successors, (326), 281 states have internal predecessors, (326), 64 states have call successors, (64), 36 states have call predecessors, (64), 34 states have return successors, (66), 40 states have call predecessors, (66), 64 states have call successors, (66) [2022-02-20 18:09:55,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 456 transitions. [2022-02-20 18:09:55,198 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 456 transitions. Word has length 34 [2022-02-20 18:09:55,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:09:55,199 INFO L470 AbstractCegarLoop]: Abstraction has 345 states and 456 transitions. [2022-02-20 18:09:55,199 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 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:55,199 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 456 transitions. [2022-02-20 18:09:55,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-20 18:09:55,200 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:09:55,200 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] [2022-02-20 18:09:55,201 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:09:55,201 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:09:55,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:09:55,201 INFO L85 PathProgramCache]: Analyzing trace with hash 695972842, now seen corresponding path program 1 times [2022-02-20 18:09:55,201 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:09:55,202 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253750576] [2022-02-20 18:09:55,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:09:55,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:09:55,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 18:09:55,225 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 18:09:55,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 18:09:55,257 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 18:09:55,258 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 18:09:55,258 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 18:09:55,260 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:09:55,262 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-02-20 18:09:55,264 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 18:09:55,277 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call waterRise(); [2022-02-20 18:09:55,277 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:55,280 INFO L158 Benchmark]: Toolchain (without parser) took 3553.66ms. Allocated memory was 98.6MB in the beginning and 151.0MB in the end (delta: 52.4MB). Free memory was 66.9MB in the beginning and 79.1MB in the end (delta: -12.3MB). Peak memory consumption was 38.5MB. Max. memory is 16.1GB. [2022-02-20 18:09:55,281 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 98.6MB. Free memory is still 53.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 18:09:55,281 INFO L158 Benchmark]: CACSL2BoogieTranslator took 440.40ms. Allocated memory was 98.6MB in the beginning and 125.8MB in the end (delta: 27.3MB). Free memory was 66.6MB in the beginning and 89.2MB in the end (delta: -22.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 18:09:55,281 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.55ms. Allocated memory is still 125.8MB. Free memory was 89.2MB in the beginning and 86.2MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 18:09:55,281 INFO L158 Benchmark]: Boogie Preprocessor took 18.11ms. Allocated memory is still 125.8MB. Free memory was 86.2MB in the beginning and 84.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 18:09:55,282 INFO L158 Benchmark]: RCFGBuilder took 497.71ms. Allocated memory is still 125.8MB. Free memory was 84.5MB in the beginning and 94.4MB in the end (delta: -9.9MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB. [2022-02-20 18:09:55,282 INFO L158 Benchmark]: TraceAbstraction took 2534.31ms. Allocated memory was 125.8MB in the beginning and 151.0MB in the end (delta: 25.2MB). Free memory was 93.8MB in the beginning and 79.1MB in the end (delta: 14.7MB). Peak memory consumption was 38.3MB. Max. memory is 16.1GB. [2022-02-20 18:09:55,283 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.17ms. Allocated memory is still 98.6MB. Free memory is still 53.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 440.40ms. Allocated memory was 98.6MB in the beginning and 125.8MB in the end (delta: 27.3MB). Free memory was 66.6MB in the beginning and 89.2MB in the end (delta: -22.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.55ms. Allocated memory is still 125.8MB. Free memory was 89.2MB in the beginning and 86.2MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 18.11ms. Allocated memory is still 125.8MB. Free memory was 86.2MB in the beginning and 84.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 497.71ms. Allocated memory is still 125.8MB. Free memory was 84.5MB in the beginning and 94.4MB in the end (delta: -9.9MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2534.31ms. Allocated memory was 125.8MB in the beginning and 151.0MB in the end (delta: 25.2MB). Free memory was 93.8MB in the beginning and 79.1MB in the end (delta: 14.7MB). Peak memory consumption was 38.3MB. 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:55,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/minepump_spec3_product64.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 d436abf98cab5db4fbcf1977ce5628e2227cd7aa643df1d726e32cf2e71cb81f --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:09:56,914 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:09:56,915 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:09:56,936 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:09:56,936 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:09:56,937 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:09:56,938 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:09:56,939 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:09:56,940 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:09:56,941 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:09:56,942 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:09:56,942 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:09:56,943 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:09:56,943 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:09:56,944 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:09:56,945 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:09:56,945 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:09:56,946 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:09:56,947 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:09:56,948 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:09:56,949 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:09:56,950 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:09:56,952 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:09:56,953 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:09:56,957 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:09:56,961 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:09:56,961 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:09:56,961 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:09:56,962 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:09:56,963 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:09:56,963 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:09:56,963 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:09:56,964 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:09:56,966 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:09:56,967 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:09:56,967 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:09:56,967 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:09:56,967 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:09:56,967 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:09:56,968 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:09:56,968 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:09:56,969 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:56,994 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:09:56,999 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:09:57,000 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:09:57,000 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:09:57,001 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:09:57,001 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:09:57,001 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:09:57,002 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:09:57,002 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:09:57,002 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:09:57,003 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:09:57,003 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:09:57,003 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:09:57,003 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:09:57,003 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:09:57,003 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:09:57,004 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 18:09:57,004 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 18:09:57,004 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 18:09:57,004 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:09:57,004 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:09:57,004 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:09:57,004 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:09:57,004 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:09:57,005 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:09:57,015 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:09:57,015 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:09:57,015 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:09:57,016 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:09:57,016 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:09:57,016 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 18:09:57,016 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 18:09:57,016 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:09:57,017 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:09:57,017 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:09:57,017 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 18:09:57,017 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 -> d436abf98cab5db4fbcf1977ce5628e2227cd7aa643df1d726e32cf2e71cb81f [2022-02-20 18:09:57,260 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:09:57,277 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:09:57,280 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:09:57,281 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:09:57,281 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:09:57,282 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec3_product64.cil.c [2022-02-20 18:09:57,330 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41ebc5605/da7fc48bcd22438caac5a501ff86d69b/FLAGa74c468a5 [2022-02-20 18:09:57,724 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:09:57,724 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec3_product64.cil.c [2022-02-20 18:09:57,736 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41ebc5605/da7fc48bcd22438caac5a501ff86d69b/FLAGa74c468a5 [2022-02-20 18:09:57,746 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41ebc5605/da7fc48bcd22438caac5a501ff86d69b [2022-02-20 18:09:57,748 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:09:57,750 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:09:57,752 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:09:57,752 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:09:57,754 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:09:57,755 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:09:57" (1/1) ... [2022-02-20 18:09:57,756 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a7a714e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:09:57, skipping insertion in model container [2022-02-20 18:09:57,756 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:09:57" (1/1) ... [2022-02-20 18:09:57,763 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:09:57,790 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:09:58,021 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_product64.cil.c[19022,19035] [2022-02-20 18:09:58,025 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:09:58,043 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-02-20 18:09:58,050 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:09:58,115 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_product64.cil.c[19022,19035] [2022-02-20 18:09:58,116 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:09:58,121 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:09:58,192 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_product64.cil.c[19022,19035] [2022-02-20 18:09:58,193 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:09:58,213 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:09:58,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:09:58 WrapperNode [2022-02-20 18:09:58,214 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:09:58,214 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:09:58,214 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:09:58,214 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:09:58,218 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:58" (1/1) ... [2022-02-20 18:09:58,241 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:58" (1/1) ... [2022-02-20 18:09:58,273 INFO L137 Inliner]: procedures = 61, calls = 164, calls flagged for inlining = 25, calls inlined = 22, statements flattened = 274 [2022-02-20 18:09:58,274 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:09:58,274 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:09:58,274 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:09:58,274 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:09:58,282 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:58" (1/1) ... [2022-02-20 18:09:58,283 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:58" (1/1) ... [2022-02-20 18:09:58,292 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:58" (1/1) ... [2022-02-20 18:09:58,293 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:58" (1/1) ... [2022-02-20 18:09:58,303 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:58" (1/1) ... [2022-02-20 18:09:58,307 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:58" (1/1) ... [2022-02-20 18:09:58,309 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:58" (1/1) ... [2022-02-20 18:09:58,319 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:09:58,320 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:09:58,320 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:09:58,320 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:09:58,321 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:09:58" (1/1) ... [2022-02-20 18:09:58,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:09:58,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:09:58,347 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:58,348 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:58,380 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:09:58,382 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2022-02-20 18:09:58,383 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2022-02-20 18:09:58,383 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2022-02-20 18:09:58,383 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2022-02-20 18:09:58,383 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2022-02-20 18:09:58,383 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2022-02-20 18:09:58,383 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2022-02-20 18:09:58,383 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2022-02-20 18:09:58,383 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2022-02-20 18:09:58,383 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2022-02-20 18:09:58,383 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2022-02-20 18:09:58,383 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2022-02-20 18:09:58,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 18:09:58,384 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__methaneQuery [2022-02-20 18:09:58,384 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__methaneQuery [2022-02-20 18:09:58,384 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneAlarm [2022-02-20 18:09:58,384 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneAlarm [2022-02-20 18:09:58,384 INFO L130 BoogieDeclarations]: Found specification of procedure deactivatePump [2022-02-20 18:09:58,384 INFO L138 BoogieDeclarations]: Found implementation of procedure deactivatePump [2022-02-20 18:09:58,384 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2022-02-20 18:09:58,384 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2022-02-20 18:09:58,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:09:58,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:09:58,457 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:09:58,458 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:09:58,766 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:09:58,772 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:09:58,772 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 18:09:58,773 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:09:58 BoogieIcfgContainer [2022-02-20 18:09:58,773 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:09:58,774 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:09:58,774 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:09:58,776 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:09:58,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:09:57" (1/3) ... [2022-02-20 18:09:58,777 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45ae95b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:09:58, skipping insertion in model container [2022-02-20 18:09:58,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:09:58" (2/3) ... [2022-02-20 18:09:58,777 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45ae95b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:09:58, skipping insertion in model container [2022-02-20 18:09:58,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:09:58" (3/3) ... [2022-02-20 18:09:58,778 INFO L111 eAbstractionObserver]: Analyzing ICFG minepump_spec3_product64.cil.c [2022-02-20 18:09:58,781 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:09:58,781 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:09:58,811 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:09:58,815 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:58,815 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:09:58,830 INFO L276 IsEmpty]: Start isEmpty. Operand has 115 states, 84 states have (on average 1.369047619047619) internal successors, (115), 95 states have internal predecessors, (115), 19 states have call successors, (19), 10 states have call predecessors, (19), 10 states have return successors, (19), 14 states have call predecessors, (19), 19 states have call successors, (19) [2022-02-20 18:09:58,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 18:09:58,835 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:09:58,835 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:58,836 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:09:58,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:09:58,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1815405350, now seen corresponding path program 1 times [2022-02-20 18:09:58,851 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 18:09:58,851 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [624123771] [2022-02-20 18:09:58,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:09:58,853 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 18:09:58,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 18:09:58,855 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:58,856 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:58,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:09:58,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 18:09:58,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:09:58,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:09:59,045 INFO L290 TraceCheckUtils]: 0: Hoare triple {118#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(13bv32, 4bv32);call #Ultimate.allocInit(3bv32, 5bv32);call write~init~intINTTYPE1(79bv8, 5bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(110bv8, 5bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 5bv32, 2bv32, 1bv32);call #Ultimate.allocInit(4bv32, 6bv32);call write~init~intINTTYPE1(79bv8, 6bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(102bv8, 6bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(102bv8, 6bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 6bv32, 3bv32, 1bv32);call #Ultimate.allocInit(7bv32, 7bv32);call write~init~intINTTYPE1(44bv8, 7bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(80bv8, 7bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(117bv8, 7bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(109bv8, 7bv32, 3bv32, 1bv32);call write~init~intINTTYPE1(112bv8, 7bv32, 4bv32, 1bv32);call write~init~intINTTYPE1(58bv8, 7bv32, 5bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 7bv32, 6bv32, 1bv32);call #Ultimate.allocInit(3bv32, 8bv32);call write~init~intINTTYPE1(79bv8, 8bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(110bv8, 8bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 8bv32, 2bv32, 1bv32);call #Ultimate.allocInit(4bv32, 9bv32);call write~init~intINTTYPE1(79bv8, 9bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(102bv8, 9bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(102bv8, 9bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 9bv32, 3bv32, 1bv32);call #Ultimate.allocInit(3bv32, 10bv32);call write~init~intINTTYPE1(41bv8, 10bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(32bv8, 10bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 10bv32, 2bv32, 1bv32);call #Ultimate.allocInit(2bv32, 11bv32);call write~init~intINTTYPE1(10bv8, 11bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 11bv32, 1bv32, 1bv32);call #Ultimate.allocInit(13bv32, 12bv32);call #Ultimate.allocInit(7bv32, 13bv32);call write~init~intINTTYPE1(44bv8, 13bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(77bv8, 13bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(101bv8, 13bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(116bv8, 13bv32, 3bv32, 1bv32);call write~init~intINTTYPE1(104bv8, 13bv32, 4bv32, 1bv32);call write~init~intINTTYPE1(58bv8, 13bv32, 5bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 13bv32, 6bv32, 1bv32);call #Ultimate.allocInit(5bv32, 14bv32);call write~init~intINTTYPE1(67bv8, 14bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(82bv8, 14bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(73bv8, 14bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(84bv8, 14bv32, 3bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 14bv32, 4bv32, 1bv32);call #Ultimate.allocInit(3bv32, 15bv32);call write~init~intINTTYPE1(79bv8, 15bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(75bv8, 15bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 15bv32, 2bv32, 1bv32);call #Ultimate.allocInit(2bv32, 16bv32);call write~init~intINTTYPE1(41bv8, 16bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 16bv32, 1bv32, 1bv32);call #Ultimate.allocInit(30bv32, 17bv32);call #Ultimate.allocInit(9bv32, 18bv32);call #Ultimate.allocInit(21bv32, 19bv32);call #Ultimate.allocInit(30bv32, 20bv32);call #Ultimate.allocInit(9bv32, 21bv32);call #Ultimate.allocInit(21bv32, 22bv32);call #Ultimate.allocInit(30bv32, 23bv32);call #Ultimate.allocInit(9bv32, 24bv32);call #Ultimate.allocInit(25bv32, 25bv32);call #Ultimate.allocInit(30bv32, 26bv32);call #Ultimate.allocInit(9bv32, 27bv32);call #Ultimate.allocInit(25bv32, 28bv32);~pumpRunning~0 := 0bv32;~systemActive~0 := 1bv32;~waterLevel~0 := 1bv32;~methaneLevelCritical~0 := 0bv32;~head~0.base, ~head~0.offset := 0bv32, 0bv32;~cleanupTimeShifts~0 := 4bv32; {118#true} is VALID [2022-02-20 18:09:59,048 INFO L290 TraceCheckUtils]: 1: Hoare triple {118#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret52#1, main_~retValue_acc~13#1, main_~tmp~10#1;havoc main_~retValue_acc~13#1;havoc main_~tmp~10#1;assume { :begin_inline_select_helpers } true; {118#true} is VALID [2022-02-20 18:09:59,048 INFO L290 TraceCheckUtils]: 2: Hoare triple {118#true} assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; {118#true} is VALID [2022-02-20 18:09:59,049 INFO L290 TraceCheckUtils]: 3: Hoare triple {118#true} assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~1#1;havoc valid_product_~retValue_acc~1#1;valid_product_~retValue_acc~1#1 := 1bv32;valid_product_#res#1 := valid_product_~retValue_acc~1#1; {118#true} is VALID [2022-02-20 18:09:59,049 INFO L290 TraceCheckUtils]: 4: Hoare triple {118#true} main_#t~ret52#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;main_~tmp~10#1 := main_#t~ret52#1;havoc main_#t~ret52#1; {118#true} is VALID [2022-02-20 18:09:59,049 INFO L290 TraceCheckUtils]: 5: Hoare triple {118#true} assume 0bv32 != main_~tmp~10#1;assume { :begin_inline_setup } true; {118#true} is VALID [2022-02-20 18:09:59,049 INFO L290 TraceCheckUtils]: 6: Hoare triple {118#true} assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;havoc test_#t~nondet20#1, test_#t~nondet21#1, test_#t~nondet22#1, test_#t~nondet23#1, test_~splverifierCounter~0#1, test_~tmp~6#1, test_~tmp___0~2#1, test_~tmp___1~0#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~6#1;havoc test_~tmp___0~2#1;havoc test_~tmp___1~0#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0bv32; {118#true} is VALID [2022-02-20 18:09:59,050 INFO L290 TraceCheckUtils]: 7: Hoare triple {118#true} assume !true; {119#false} is VALID [2022-02-20 18:09:59,050 INFO L272 TraceCheckUtils]: 8: Hoare triple {119#false} call cleanup(); {119#false} is VALID [2022-02-20 18:09:59,050 INFO L290 TraceCheckUtils]: 9: Hoare triple {119#false} havoc ~i~0;havoc ~__cil_tmp2~0; {119#false} is VALID [2022-02-20 18:09:59,051 INFO L272 TraceCheckUtils]: 10: Hoare triple {119#false} call timeShift(); {119#false} is VALID [2022-02-20 18:09:59,051 INFO L290 TraceCheckUtils]: 11: Hoare triple {119#false} assume !(0bv32 != ~pumpRunning~0); {119#false} is VALID [2022-02-20 18:09:59,051 INFO L290 TraceCheckUtils]: 12: Hoare triple {119#false} assume !(0bv32 != ~systemActive~0); {119#false} is VALID [2022-02-20 18:09:59,051 INFO L290 TraceCheckUtils]: 13: Hoare triple {119#false} assume { :begin_inline___utac_acc__Specification3_spec__1 } true;havoc __utac_acc__Specification3_spec__1_#t~ret53#1, __utac_acc__Specification3_spec__1_#t~ret54#1, __utac_acc__Specification3_spec__1_#t~ret55#1, __utac_acc__Specification3_spec__1_~tmp~11#1, __utac_acc__Specification3_spec__1_~tmp___0~3#1, __utac_acc__Specification3_spec__1_~tmp___1~1#1;havoc __utac_acc__Specification3_spec__1_~tmp~11#1;havoc __utac_acc__Specification3_spec__1_~tmp___0~3#1;havoc __utac_acc__Specification3_spec__1_~tmp___1~1#1; {119#false} is VALID [2022-02-20 18:09:59,051 INFO L272 TraceCheckUtils]: 14: Hoare triple {119#false} call __utac_acc__Specification3_spec__1_#t~ret53#1 := isMethaneLevelCritical(); {119#false} is VALID [2022-02-20 18:09:59,051 INFO L290 TraceCheckUtils]: 15: Hoare triple {119#false} havoc ~retValue_acc~6;~retValue_acc~6 := ~methaneLevelCritical~0;#res := ~retValue_acc~6; {119#false} is VALID [2022-02-20 18:09:59,051 INFO L290 TraceCheckUtils]: 16: Hoare triple {119#false} assume true; {119#false} is VALID [2022-02-20 18:09:59,052 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {119#false} {119#false} #297#return; {119#false} is VALID [2022-02-20 18:09:59,052 INFO L290 TraceCheckUtils]: 18: Hoare triple {119#false} __utac_acc__Specification3_spec__1_~tmp~11#1 := __utac_acc__Specification3_spec__1_#t~ret53#1;havoc __utac_acc__Specification3_spec__1_#t~ret53#1; {119#false} is VALID [2022-02-20 18:09:59,052 INFO L290 TraceCheckUtils]: 19: Hoare triple {119#false} assume !(0bv32 != __utac_acc__Specification3_spec__1_~tmp~11#1);assume { :begin_inline_getWaterLevel } true;havoc getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~7#1;havoc getWaterLevel_~retValue_acc~7#1;getWaterLevel_~retValue_acc~7#1 := ~waterLevel~0;getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~7#1; {119#false} is VALID [2022-02-20 18:09:59,053 INFO L290 TraceCheckUtils]: 20: Hoare triple {119#false} __utac_acc__Specification3_spec__1_#t~ret54#1 := getWaterLevel_#res#1;assume { :end_inline_getWaterLevel } true;__utac_acc__Specification3_spec__1_~tmp___0~3#1 := __utac_acc__Specification3_spec__1_#t~ret54#1;havoc __utac_acc__Specification3_spec__1_#t~ret54#1; {119#false} is VALID [2022-02-20 18:09:59,053 INFO L290 TraceCheckUtils]: 21: Hoare triple {119#false} assume 2bv32 == __utac_acc__Specification3_spec__1_~tmp___0~3#1;assume { :begin_inline_isPumpRunning } true;havoc isPumpRunning_#res#1;havoc isPumpRunning_~retValue_acc~3#1;havoc isPumpRunning_~retValue_acc~3#1;isPumpRunning_~retValue_acc~3#1 := ~pumpRunning~0;isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~3#1; {119#false} is VALID [2022-02-20 18:09:59,053 INFO L290 TraceCheckUtils]: 22: Hoare triple {119#false} __utac_acc__Specification3_spec__1_#t~ret55#1 := isPumpRunning_#res#1;assume { :end_inline_isPumpRunning } true;__utac_acc__Specification3_spec__1_~tmp___1~1#1 := __utac_acc__Specification3_spec__1_#t~ret55#1;havoc __utac_acc__Specification3_spec__1_#t~ret55#1; {119#false} is VALID [2022-02-20 18:09:59,053 INFO L290 TraceCheckUtils]: 23: Hoare triple {119#false} assume !(0bv32 != __utac_acc__Specification3_spec__1_~tmp___1~1#1);assume { :begin_inline___automaton_fail } true; {119#false} is VALID [2022-02-20 18:09:59,054 INFO L290 TraceCheckUtils]: 24: Hoare triple {119#false} assume !false; {119#false} is VALID [2022-02-20 18:09:59,055 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:59,055 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 18:09:59,055 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 18:09:59,055 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [624123771] [2022-02-20 18:09:59,056 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [624123771] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:09:59,056 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:09:59,056 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 18:09:59,058 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016756794] [2022-02-20 18:09:59,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:09:59,064 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:59,066 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:09:59,069 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:59,097 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:59,097 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 18:09:59,097 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 18:09:59,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 18:09:59,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 18:09:59,126 INFO L87 Difference]: Start difference. First operand has 115 states, 84 states have (on average 1.369047619047619) internal successors, (115), 95 states have internal predecessors, (115), 19 states have call successors, (19), 10 states have call predecessors, (19), 10 states have return successors, (19), 14 states have call predecessors, (19), 19 states have call successors, (19) 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:59,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:09:59,273 INFO L93 Difference]: Finished difference Result 222 states and 301 transitions. [2022-02-20 18:09:59,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 18:09:59,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), 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:59,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:09:59,275 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:59,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 301 transitions. [2022-02-20 18:09:59,291 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:59,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 301 transitions. [2022-02-20 18:09:59,302 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 301 transitions. [2022-02-20 18:09:59,535 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 301 edges. 301 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:09:59,544 INFO L225 Difference]: With dead ends: 222 [2022-02-20 18:09:59,544 INFO L226 Difference]: Without dead ends: 106 [2022-02-20 18:09:59,547 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:59,549 INFO L933 BasicCegarLoop]: 147 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, 147 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:59,550 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 147 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:59,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-02-20 18:09:59,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2022-02-20 18:09:59,574 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:09:59,575 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand has 106 states, 77 states have (on average 1.3116883116883118) internal successors, (101), 87 states have internal predecessors, (101), 19 states have call successors, (19), 10 states have call predecessors, (19), 9 states have return successors, (18), 13 states have call predecessors, (18), 18 states have call successors, (18) [2022-02-20 18:09:59,576 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand has 106 states, 77 states have (on average 1.3116883116883118) internal successors, (101), 87 states have internal predecessors, (101), 19 states have call successors, (19), 10 states have call predecessors, (19), 9 states have return successors, (18), 13 states have call predecessors, (18), 18 states have call successors, (18) [2022-02-20 18:09:59,577 INFO L87 Difference]: Start difference. First operand 106 states. Second operand has 106 states, 77 states have (on average 1.3116883116883118) internal successors, (101), 87 states have internal predecessors, (101), 19 states have call successors, (19), 10 states have call predecessors, (19), 9 states have return successors, (18), 13 states have call predecessors, (18), 18 states have call successors, (18) [2022-02-20 18:09:59,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:09:59,585 INFO L93 Difference]: Finished difference Result 106 states and 138 transitions. [2022-02-20 18:09:59,585 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 138 transitions. [2022-02-20 18:09:59,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:09:59,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:09:59,587 INFO L74 IsIncluded]: Start isIncluded. First operand has 106 states, 77 states have (on average 1.3116883116883118) internal successors, (101), 87 states have internal predecessors, (101), 19 states have call successors, (19), 10 states have call predecessors, (19), 9 states have return successors, (18), 13 states have call predecessors, (18), 18 states have call successors, (18) Second operand 106 states. [2022-02-20 18:09:59,588 INFO L87 Difference]: Start difference. First operand has 106 states, 77 states have (on average 1.3116883116883118) internal successors, (101), 87 states have internal predecessors, (101), 19 states have call successors, (19), 10 states have call predecessors, (19), 9 states have return successors, (18), 13 states have call predecessors, (18), 18 states have call successors, (18) Second operand 106 states. [2022-02-20 18:09:59,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:09:59,596 INFO L93 Difference]: Finished difference Result 106 states and 138 transitions. [2022-02-20 18:09:59,596 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 138 transitions. [2022-02-20 18:09:59,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:09:59,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:09:59,598 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:09:59,598 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:09:59,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 77 states have (on average 1.3116883116883118) internal successors, (101), 87 states have internal predecessors, (101), 19 states have call successors, (19), 10 states have call predecessors, (19), 9 states have return successors, (18), 13 states have call predecessors, (18), 18 states have call successors, (18) [2022-02-20 18:09:59,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 138 transitions. [2022-02-20 18:09:59,607 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 138 transitions. Word has length 25 [2022-02-20 18:09:59,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:09:59,608 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 138 transitions. [2022-02-20 18:09:59,608 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:59,608 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 138 transitions. [2022-02-20 18:09:59,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 18:09:59,609 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:09:59,609 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:59,620 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:59,810 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:59,810 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:09:59,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:09:59,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1446667371, now seen corresponding path program 1 times [2022-02-20 18:09:59,811 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 18:09:59,811 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1236595542] [2022-02-20 18:09:59,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:09:59,812 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 18:09:59,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 18:09:59,814 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:59,817 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:59,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:09:59,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 18:09:59,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:09:59,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:10:00,007 INFO L290 TraceCheckUtils]: 0: Hoare triple {883#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(13bv32, 4bv32);call #Ultimate.allocInit(3bv32, 5bv32);call write~init~intINTTYPE1(79bv8, 5bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(110bv8, 5bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 5bv32, 2bv32, 1bv32);call #Ultimate.allocInit(4bv32, 6bv32);call write~init~intINTTYPE1(79bv8, 6bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(102bv8, 6bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(102bv8, 6bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 6bv32, 3bv32, 1bv32);call #Ultimate.allocInit(7bv32, 7bv32);call write~init~intINTTYPE1(44bv8, 7bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(80bv8, 7bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(117bv8, 7bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(109bv8, 7bv32, 3bv32, 1bv32);call write~init~intINTTYPE1(112bv8, 7bv32, 4bv32, 1bv32);call write~init~intINTTYPE1(58bv8, 7bv32, 5bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 7bv32, 6bv32, 1bv32);call #Ultimate.allocInit(3bv32, 8bv32);call write~init~intINTTYPE1(79bv8, 8bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(110bv8, 8bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 8bv32, 2bv32, 1bv32);call #Ultimate.allocInit(4bv32, 9bv32);call write~init~intINTTYPE1(79bv8, 9bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(102bv8, 9bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(102bv8, 9bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 9bv32, 3bv32, 1bv32);call #Ultimate.allocInit(3bv32, 10bv32);call write~init~intINTTYPE1(41bv8, 10bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(32bv8, 10bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 10bv32, 2bv32, 1bv32);call #Ultimate.allocInit(2bv32, 11bv32);call write~init~intINTTYPE1(10bv8, 11bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 11bv32, 1bv32, 1bv32);call #Ultimate.allocInit(13bv32, 12bv32);call #Ultimate.allocInit(7bv32, 13bv32);call write~init~intINTTYPE1(44bv8, 13bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(77bv8, 13bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(101bv8, 13bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(116bv8, 13bv32, 3bv32, 1bv32);call write~init~intINTTYPE1(104bv8, 13bv32, 4bv32, 1bv32);call write~init~intINTTYPE1(58bv8, 13bv32, 5bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 13bv32, 6bv32, 1bv32);call #Ultimate.allocInit(5bv32, 14bv32);call write~init~intINTTYPE1(67bv8, 14bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(82bv8, 14bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(73bv8, 14bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(84bv8, 14bv32, 3bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 14bv32, 4bv32, 1bv32);call #Ultimate.allocInit(3bv32, 15bv32);call write~init~intINTTYPE1(79bv8, 15bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(75bv8, 15bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 15bv32, 2bv32, 1bv32);call #Ultimate.allocInit(2bv32, 16bv32);call write~init~intINTTYPE1(41bv8, 16bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 16bv32, 1bv32, 1bv32);call #Ultimate.allocInit(30bv32, 17bv32);call #Ultimate.allocInit(9bv32, 18bv32);call #Ultimate.allocInit(21bv32, 19bv32);call #Ultimate.allocInit(30bv32, 20bv32);call #Ultimate.allocInit(9bv32, 21bv32);call #Ultimate.allocInit(21bv32, 22bv32);call #Ultimate.allocInit(30bv32, 23bv32);call #Ultimate.allocInit(9bv32, 24bv32);call #Ultimate.allocInit(25bv32, 25bv32);call #Ultimate.allocInit(30bv32, 26bv32);call #Ultimate.allocInit(9bv32, 27bv32);call #Ultimate.allocInit(25bv32, 28bv32);~pumpRunning~0 := 0bv32;~systemActive~0 := 1bv32;~waterLevel~0 := 1bv32;~methaneLevelCritical~0 := 0bv32;~head~0.base, ~head~0.offset := 0bv32, 0bv32;~cleanupTimeShifts~0 := 4bv32; {883#true} is VALID [2022-02-20 18:10:00,007 INFO L290 TraceCheckUtils]: 1: Hoare triple {883#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret52#1, main_~retValue_acc~13#1, main_~tmp~10#1;havoc main_~retValue_acc~13#1;havoc main_~tmp~10#1;assume { :begin_inline_select_helpers } true; {883#true} is VALID [2022-02-20 18:10:00,007 INFO L290 TraceCheckUtils]: 2: Hoare triple {883#true} assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; {883#true} is VALID [2022-02-20 18:10:00,007 INFO L290 TraceCheckUtils]: 3: Hoare triple {883#true} assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~1#1;havoc valid_product_~retValue_acc~1#1;valid_product_~retValue_acc~1#1 := 1bv32;valid_product_#res#1 := valid_product_~retValue_acc~1#1; {883#true} is VALID [2022-02-20 18:10:00,008 INFO L290 TraceCheckUtils]: 4: Hoare triple {883#true} main_#t~ret52#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;main_~tmp~10#1 := main_#t~ret52#1;havoc main_#t~ret52#1; {883#true} is VALID [2022-02-20 18:10:00,008 INFO L290 TraceCheckUtils]: 5: Hoare triple {883#true} assume 0bv32 != main_~tmp~10#1;assume { :begin_inline_setup } true; {883#true} is VALID [2022-02-20 18:10:00,008 INFO L290 TraceCheckUtils]: 6: Hoare triple {883#true} assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;havoc test_#t~nondet20#1, test_#t~nondet21#1, test_#t~nondet22#1, test_#t~nondet23#1, test_~splverifierCounter~0#1, test_~tmp~6#1, test_~tmp___0~2#1, test_~tmp___1~0#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~6#1;havoc test_~tmp___0~2#1;havoc test_~tmp___1~0#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0bv32; {906#(= |ULTIMATE.start_test_~splverifierCounter~0#1| (_ bv0 32))} is VALID [2022-02-20 18:10:00,008 INFO L290 TraceCheckUtils]: 7: Hoare triple {906#(= |ULTIMATE.start_test_~splverifierCounter~0#1| (_ bv0 32))} assume !false; {906#(= |ULTIMATE.start_test_~splverifierCounter~0#1| (_ bv0 32))} is VALID [2022-02-20 18:10:00,009 INFO L290 TraceCheckUtils]: 8: Hoare triple {906#(= |ULTIMATE.start_test_~splverifierCounter~0#1| (_ bv0 32))} assume !~bvslt32(test_~splverifierCounter~0#1, 4bv32); {884#false} is VALID [2022-02-20 18:10:00,009 INFO L272 TraceCheckUtils]: 9: Hoare triple {884#false} call cleanup(); {884#false} is VALID [2022-02-20 18:10:00,009 INFO L290 TraceCheckUtils]: 10: Hoare triple {884#false} havoc ~i~0;havoc ~__cil_tmp2~0; {884#false} is VALID [2022-02-20 18:10:00,009 INFO L272 TraceCheckUtils]: 11: Hoare triple {884#false} call timeShift(); {884#false} is VALID [2022-02-20 18:10:00,010 INFO L290 TraceCheckUtils]: 12: Hoare triple {884#false} assume !(0bv32 != ~pumpRunning~0); {884#false} is VALID [2022-02-20 18:10:00,012 INFO L290 TraceCheckUtils]: 13: Hoare triple {884#false} assume !(0bv32 != ~systemActive~0); {884#false} is VALID [2022-02-20 18:10:00,012 INFO L290 TraceCheckUtils]: 14: Hoare triple {884#false} assume { :begin_inline___utac_acc__Specification3_spec__1 } true;havoc __utac_acc__Specification3_spec__1_#t~ret53#1, __utac_acc__Specification3_spec__1_#t~ret54#1, __utac_acc__Specification3_spec__1_#t~ret55#1, __utac_acc__Specification3_spec__1_~tmp~11#1, __utac_acc__Specification3_spec__1_~tmp___0~3#1, __utac_acc__Specification3_spec__1_~tmp___1~1#1;havoc __utac_acc__Specification3_spec__1_~tmp~11#1;havoc __utac_acc__Specification3_spec__1_~tmp___0~3#1;havoc __utac_acc__Specification3_spec__1_~tmp___1~1#1; {884#false} is VALID [2022-02-20 18:10:00,012 INFO L272 TraceCheckUtils]: 15: Hoare triple {884#false} call __utac_acc__Specification3_spec__1_#t~ret53#1 := isMethaneLevelCritical(); {884#false} is VALID [2022-02-20 18:10:00,012 INFO L290 TraceCheckUtils]: 16: Hoare triple {884#false} havoc ~retValue_acc~6;~retValue_acc~6 := ~methaneLevelCritical~0;#res := ~retValue_acc~6; {884#false} is VALID [2022-02-20 18:10:00,012 INFO L290 TraceCheckUtils]: 17: Hoare triple {884#false} assume true; {884#false} is VALID [2022-02-20 18:10:00,013 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {884#false} {884#false} #297#return; {884#false} is VALID [2022-02-20 18:10:00,013 INFO L290 TraceCheckUtils]: 19: Hoare triple {884#false} __utac_acc__Specification3_spec__1_~tmp~11#1 := __utac_acc__Specification3_spec__1_#t~ret53#1;havoc __utac_acc__Specification3_spec__1_#t~ret53#1; {884#false} is VALID [2022-02-20 18:10:00,013 INFO L290 TraceCheckUtils]: 20: Hoare triple {884#false} assume !(0bv32 != __utac_acc__Specification3_spec__1_~tmp~11#1);assume { :begin_inline_getWaterLevel } true;havoc getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~7#1;havoc getWaterLevel_~retValue_acc~7#1;getWaterLevel_~retValue_acc~7#1 := ~waterLevel~0;getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~7#1; {884#false} is VALID [2022-02-20 18:10:00,013 INFO L290 TraceCheckUtils]: 21: Hoare triple {884#false} __utac_acc__Specification3_spec__1_#t~ret54#1 := getWaterLevel_#res#1;assume { :end_inline_getWaterLevel } true;__utac_acc__Specification3_spec__1_~tmp___0~3#1 := __utac_acc__Specification3_spec__1_#t~ret54#1;havoc __utac_acc__Specification3_spec__1_#t~ret54#1; {884#false} is VALID [2022-02-20 18:10:00,013 INFO L290 TraceCheckUtils]: 22: Hoare triple {884#false} assume 2bv32 == __utac_acc__Specification3_spec__1_~tmp___0~3#1;assume { :begin_inline_isPumpRunning } true;havoc isPumpRunning_#res#1;havoc isPumpRunning_~retValue_acc~3#1;havoc isPumpRunning_~retValue_acc~3#1;isPumpRunning_~retValue_acc~3#1 := ~pumpRunning~0;isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~3#1; {884#false} is VALID [2022-02-20 18:10:00,013 INFO L290 TraceCheckUtils]: 23: Hoare triple {884#false} __utac_acc__Specification3_spec__1_#t~ret55#1 := isPumpRunning_#res#1;assume { :end_inline_isPumpRunning } true;__utac_acc__Specification3_spec__1_~tmp___1~1#1 := __utac_acc__Specification3_spec__1_#t~ret55#1;havoc __utac_acc__Specification3_spec__1_#t~ret55#1; {884#false} is VALID [2022-02-20 18:10:00,014 INFO L290 TraceCheckUtils]: 24: Hoare triple {884#false} assume !(0bv32 != __utac_acc__Specification3_spec__1_~tmp___1~1#1);assume { :begin_inline___automaton_fail } true; {884#false} is VALID [2022-02-20 18:10:00,014 INFO L290 TraceCheckUtils]: 25: Hoare triple {884#false} assume !false; {884#false} is VALID [2022-02-20 18:10:00,014 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:10:00,014 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 18:10:00,014 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 18:10:00,016 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1236595542] [2022-02-20 18:10:00,016 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1236595542] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:10:00,016 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:10:00,016 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:10:00,016 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478023698] [2022-02-20 18:10:00,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:10:00,017 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:10:00,018 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:10:00,018 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:10:00,045 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:10:00,045 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:10:00,046 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 18:10:00,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:10:00,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:10:00,046 INFO L87 Difference]: Start difference. First operand 106 states and 138 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:10:00,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:10:00,196 INFO L93 Difference]: Finished difference Result 173 states and 225 transitions. [2022-02-20 18:10:00,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:10:00,197 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:10:00,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:10:00,197 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:10:00,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 225 transitions. [2022-02-20 18:10:00,202 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:10:00,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 225 transitions. [2022-02-20 18:10:00,204 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 225 transitions. [2022-02-20 18:10:00,360 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 225 edges. 225 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:10:00,362 INFO L225 Difference]: With dead ends: 173 [2022-02-20 18:10:00,362 INFO L226 Difference]: Without dead ends: 97 [2022-02-20 18:10:00,363 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:10:00,364 INFO L933 BasicCegarLoop]: 125 mSDtfsCounter, 17 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 228 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:10:00,364 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 228 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:10:00,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-02-20 18:10:00,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2022-02-20 18:10:00,379 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:10:00,379 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand has 97 states, 71 states have (on average 1.323943661971831) internal successors, (94), 81 states have internal predecessors, (94), 16 states have call successors, (16), 9 states have call predecessors, (16), 9 states have return successors, (16), 11 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 18:10:00,380 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand has 97 states, 71 states have (on average 1.323943661971831) internal successors, (94), 81 states have internal predecessors, (94), 16 states have call successors, (16), 9 states have call predecessors, (16), 9 states have return successors, (16), 11 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 18:10:00,380 INFO L87 Difference]: Start difference. First operand 97 states. Second operand has 97 states, 71 states have (on average 1.323943661971831) internal successors, (94), 81 states have internal predecessors, (94), 16 states have call successors, (16), 9 states have call predecessors, (16), 9 states have return successors, (16), 11 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 18:10:00,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:10:00,385 INFO L93 Difference]: Finished difference Result 97 states and 126 transitions. [2022-02-20 18:10:00,385 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 126 transitions. [2022-02-20 18:10:00,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:10:00,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:10:00,391 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 71 states have (on average 1.323943661971831) internal successors, (94), 81 states have internal predecessors, (94), 16 states have call successors, (16), 9 states have call predecessors, (16), 9 states have return successors, (16), 11 states have call predecessors, (16), 16 states have call successors, (16) Second operand 97 states. [2022-02-20 18:10:00,392 INFO L87 Difference]: Start difference. First operand has 97 states, 71 states have (on average 1.323943661971831) internal successors, (94), 81 states have internal predecessors, (94), 16 states have call successors, (16), 9 states have call predecessors, (16), 9 states have return successors, (16), 11 states have call predecessors, (16), 16 states have call successors, (16) Second operand 97 states. [2022-02-20 18:10:00,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:10:00,395 INFO L93 Difference]: Finished difference Result 97 states and 126 transitions. [2022-02-20 18:10:00,395 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 126 transitions. [2022-02-20 18:10:00,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:10:00,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:10:00,396 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:10:00,399 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:10:00,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 71 states have (on average 1.323943661971831) internal successors, (94), 81 states have internal predecessors, (94), 16 states have call successors, (16), 9 states have call predecessors, (16), 9 states have return successors, (16), 11 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 18:10:00,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 126 transitions. [2022-02-20 18:10:00,404 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 126 transitions. Word has length 26 [2022-02-20 18:10:00,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:10:00,405 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 126 transitions. [2022-02-20 18:10:00,406 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:10:00,406 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 126 transitions. [2022-02-20 18:10:00,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-20 18:10:00,407 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:10:00,407 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] [2022-02-20 18:10:00,421 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-02-20 18:10:00,615 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:10:00,616 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:10:00,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:10:00,616 INFO L85 PathProgramCache]: Analyzing trace with hash -752091658, now seen corresponding path program 1 times [2022-02-20 18:10:00,617 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 18:10:00,617 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1169808148] [2022-02-20 18:10:00,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:10:00,617 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 18:10:00,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 18:10:00,618 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:10:00,619 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:10:00,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:10:00,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 18:10:00,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:10:00,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:10:00,733 INFO L290 TraceCheckUtils]: 0: Hoare triple {1548#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(13bv32, 4bv32);call #Ultimate.allocInit(3bv32, 5bv32);call write~init~intINTTYPE1(79bv8, 5bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(110bv8, 5bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 5bv32, 2bv32, 1bv32);call #Ultimate.allocInit(4bv32, 6bv32);call write~init~intINTTYPE1(79bv8, 6bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(102bv8, 6bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(102bv8, 6bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 6bv32, 3bv32, 1bv32);call #Ultimate.allocInit(7bv32, 7bv32);call write~init~intINTTYPE1(44bv8, 7bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(80bv8, 7bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(117bv8, 7bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(109bv8, 7bv32, 3bv32, 1bv32);call write~init~intINTTYPE1(112bv8, 7bv32, 4bv32, 1bv32);call write~init~intINTTYPE1(58bv8, 7bv32, 5bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 7bv32, 6bv32, 1bv32);call #Ultimate.allocInit(3bv32, 8bv32);call write~init~intINTTYPE1(79bv8, 8bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(110bv8, 8bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 8bv32, 2bv32, 1bv32);call #Ultimate.allocInit(4bv32, 9bv32);call write~init~intINTTYPE1(79bv8, 9bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(102bv8, 9bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(102bv8, 9bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 9bv32, 3bv32, 1bv32);call #Ultimate.allocInit(3bv32, 10bv32);call write~init~intINTTYPE1(41bv8, 10bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(32bv8, 10bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 10bv32, 2bv32, 1bv32);call #Ultimate.allocInit(2bv32, 11bv32);call write~init~intINTTYPE1(10bv8, 11bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 11bv32, 1bv32, 1bv32);call #Ultimate.allocInit(13bv32, 12bv32);call #Ultimate.allocInit(7bv32, 13bv32);call write~init~intINTTYPE1(44bv8, 13bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(77bv8, 13bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(101bv8, 13bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(116bv8, 13bv32, 3bv32, 1bv32);call write~init~intINTTYPE1(104bv8, 13bv32, 4bv32, 1bv32);call write~init~intINTTYPE1(58bv8, 13bv32, 5bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 13bv32, 6bv32, 1bv32);call #Ultimate.allocInit(5bv32, 14bv32);call write~init~intINTTYPE1(67bv8, 14bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(82bv8, 14bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(73bv8, 14bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(84bv8, 14bv32, 3bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 14bv32, 4bv32, 1bv32);call #Ultimate.allocInit(3bv32, 15bv32);call write~init~intINTTYPE1(79bv8, 15bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(75bv8, 15bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 15bv32, 2bv32, 1bv32);call #Ultimate.allocInit(2bv32, 16bv32);call write~init~intINTTYPE1(41bv8, 16bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 16bv32, 1bv32, 1bv32);call #Ultimate.allocInit(30bv32, 17bv32);call #Ultimate.allocInit(9bv32, 18bv32);call #Ultimate.allocInit(21bv32, 19bv32);call #Ultimate.allocInit(30bv32, 20bv32);call #Ultimate.allocInit(9bv32, 21bv32);call #Ultimate.allocInit(21bv32, 22bv32);call #Ultimate.allocInit(30bv32, 23bv32);call #Ultimate.allocInit(9bv32, 24bv32);call #Ultimate.allocInit(25bv32, 25bv32);call #Ultimate.allocInit(30bv32, 26bv32);call #Ultimate.allocInit(9bv32, 27bv32);call #Ultimate.allocInit(25bv32, 28bv32);~pumpRunning~0 := 0bv32;~systemActive~0 := 1bv32;~waterLevel~0 := 1bv32;~methaneLevelCritical~0 := 0bv32;~head~0.base, ~head~0.offset := 0bv32, 0bv32;~cleanupTimeShifts~0 := 4bv32; {1548#true} is VALID [2022-02-20 18:10:00,733 INFO L290 TraceCheckUtils]: 1: Hoare triple {1548#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret52#1, main_~retValue_acc~13#1, main_~tmp~10#1;havoc main_~retValue_acc~13#1;havoc main_~tmp~10#1;assume { :begin_inline_select_helpers } true; {1548#true} is VALID [2022-02-20 18:10:00,733 INFO L290 TraceCheckUtils]: 2: Hoare triple {1548#true} assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; {1548#true} is VALID [2022-02-20 18:10:00,734 INFO L290 TraceCheckUtils]: 3: Hoare triple {1548#true} assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~1#1;havoc valid_product_~retValue_acc~1#1;valid_product_~retValue_acc~1#1 := 1bv32;valid_product_#res#1 := valid_product_~retValue_acc~1#1; {1548#true} is VALID [2022-02-20 18:10:00,734 INFO L290 TraceCheckUtils]: 4: Hoare triple {1548#true} main_#t~ret52#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;main_~tmp~10#1 := main_#t~ret52#1;havoc main_#t~ret52#1; {1548#true} is VALID [2022-02-20 18:10:00,734 INFO L290 TraceCheckUtils]: 5: Hoare triple {1548#true} assume 0bv32 != main_~tmp~10#1;assume { :begin_inline_setup } true; {1548#true} is VALID [2022-02-20 18:10:00,734 INFO L290 TraceCheckUtils]: 6: Hoare triple {1548#true} assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;havoc test_#t~nondet20#1, test_#t~nondet21#1, test_#t~nondet22#1, test_#t~nondet23#1, test_~splverifierCounter~0#1, test_~tmp~6#1, test_~tmp___0~2#1, test_~tmp___1~0#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~6#1;havoc test_~tmp___0~2#1;havoc test_~tmp___1~0#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0bv32; {1548#true} is VALID [2022-02-20 18:10:00,734 INFO L290 TraceCheckUtils]: 7: Hoare triple {1548#true} assume !false; {1548#true} is VALID [2022-02-20 18:10:00,734 INFO L290 TraceCheckUtils]: 8: Hoare triple {1548#true} assume ~bvslt32(test_~splverifierCounter~0#1, 4bv32); {1548#true} is VALID [2022-02-20 18:10:00,734 INFO L290 TraceCheckUtils]: 9: Hoare triple {1548#true} test_~tmp~6#1 := test_#t~nondet20#1;havoc test_#t~nondet20#1; {1548#true} is VALID [2022-02-20 18:10:00,735 INFO L290 TraceCheckUtils]: 10: Hoare triple {1548#true} assume !(0bv32 != test_~tmp~6#1); {1548#true} is VALID [2022-02-20 18:10:00,735 INFO L290 TraceCheckUtils]: 11: Hoare triple {1548#true} test_~tmp___0~2#1 := test_#t~nondet21#1;havoc test_#t~nondet21#1; {1548#true} is VALID [2022-02-20 18:10:00,735 INFO L290 TraceCheckUtils]: 12: Hoare triple {1548#true} assume !(0bv32 != test_~tmp___0~2#1); {1548#true} is VALID [2022-02-20 18:10:00,735 INFO L290 TraceCheckUtils]: 13: Hoare triple {1548#true} test_~tmp___2~0#1 := test_#t~nondet22#1;havoc test_#t~nondet22#1; {1548#true} is VALID [2022-02-20 18:10:00,735 INFO L290 TraceCheckUtils]: 14: Hoare triple {1548#true} assume 0bv32 != test_~tmp___2~0#1;assume { :begin_inline_startSystem } true;~systemActive~0 := 1bv32; {1595#(= ~systemActive~0 (_ bv1 32))} is VALID [2022-02-20 18:10:00,736 INFO L290 TraceCheckUtils]: 15: Hoare triple {1595#(= ~systemActive~0 (_ bv1 32))} assume { :end_inline_startSystem } true; {1595#(= ~systemActive~0 (_ bv1 32))} is VALID [2022-02-20 18:10:00,736 INFO L272 TraceCheckUtils]: 16: Hoare triple {1595#(= ~systemActive~0 (_ bv1 32))} call timeShift(); {1595#(= ~systemActive~0 (_ bv1 32))} is VALID [2022-02-20 18:10:00,737 INFO L290 TraceCheckUtils]: 17: Hoare triple {1595#(= ~systemActive~0 (_ bv1 32))} assume !(0bv32 != ~pumpRunning~0); {1595#(= ~systemActive~0 (_ bv1 32))} is VALID [2022-02-20 18:10:00,737 INFO L290 TraceCheckUtils]: 18: Hoare triple {1595#(= ~systemActive~0 (_ bv1 32))} assume !(0bv32 != ~systemActive~0); {1549#false} is VALID [2022-02-20 18:10:00,737 INFO L290 TraceCheckUtils]: 19: Hoare triple {1549#false} assume { :begin_inline___utac_acc__Specification3_spec__1 } true;havoc __utac_acc__Specification3_spec__1_#t~ret53#1, __utac_acc__Specification3_spec__1_#t~ret54#1, __utac_acc__Specification3_spec__1_#t~ret55#1, __utac_acc__Specification3_spec__1_~tmp~11#1, __utac_acc__Specification3_spec__1_~tmp___0~3#1, __utac_acc__Specification3_spec__1_~tmp___1~1#1;havoc __utac_acc__Specification3_spec__1_~tmp~11#1;havoc __utac_acc__Specification3_spec__1_~tmp___0~3#1;havoc __utac_acc__Specification3_spec__1_~tmp___1~1#1; {1549#false} is VALID [2022-02-20 18:10:00,737 INFO L272 TraceCheckUtils]: 20: Hoare triple {1549#false} call __utac_acc__Specification3_spec__1_#t~ret53#1 := isMethaneLevelCritical(); {1549#false} is VALID [2022-02-20 18:10:00,737 INFO L290 TraceCheckUtils]: 21: Hoare triple {1549#false} havoc ~retValue_acc~6;~retValue_acc~6 := ~methaneLevelCritical~0;#res := ~retValue_acc~6; {1549#false} is VALID [2022-02-20 18:10:00,737 INFO L290 TraceCheckUtils]: 22: Hoare triple {1549#false} assume true; {1549#false} is VALID [2022-02-20 18:10:00,738 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1549#false} {1549#false} #297#return; {1549#false} is VALID [2022-02-20 18:10:00,738 INFO L290 TraceCheckUtils]: 24: Hoare triple {1549#false} __utac_acc__Specification3_spec__1_~tmp~11#1 := __utac_acc__Specification3_spec__1_#t~ret53#1;havoc __utac_acc__Specification3_spec__1_#t~ret53#1; {1549#false} is VALID [2022-02-20 18:10:00,738 INFO L290 TraceCheckUtils]: 25: Hoare triple {1549#false} assume !(0bv32 != __utac_acc__Specification3_spec__1_~tmp~11#1);assume { :begin_inline_getWaterLevel } true;havoc getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~7#1;havoc getWaterLevel_~retValue_acc~7#1;getWaterLevel_~retValue_acc~7#1 := ~waterLevel~0;getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~7#1; {1549#false} is VALID [2022-02-20 18:10:00,738 INFO L290 TraceCheckUtils]: 26: Hoare triple {1549#false} __utac_acc__Specification3_spec__1_#t~ret54#1 := getWaterLevel_#res#1;assume { :end_inline_getWaterLevel } true;__utac_acc__Specification3_spec__1_~tmp___0~3#1 := __utac_acc__Specification3_spec__1_#t~ret54#1;havoc __utac_acc__Specification3_spec__1_#t~ret54#1; {1549#false} is VALID [2022-02-20 18:10:00,738 INFO L290 TraceCheckUtils]: 27: Hoare triple {1549#false} assume 2bv32 == __utac_acc__Specification3_spec__1_~tmp___0~3#1;assume { :begin_inline_isPumpRunning } true;havoc isPumpRunning_#res#1;havoc isPumpRunning_~retValue_acc~3#1;havoc isPumpRunning_~retValue_acc~3#1;isPumpRunning_~retValue_acc~3#1 := ~pumpRunning~0;isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~3#1; {1549#false} is VALID [2022-02-20 18:10:00,738 INFO L290 TraceCheckUtils]: 28: Hoare triple {1549#false} __utac_acc__Specification3_spec__1_#t~ret55#1 := isPumpRunning_#res#1;assume { :end_inline_isPumpRunning } true;__utac_acc__Specification3_spec__1_~tmp___1~1#1 := __utac_acc__Specification3_spec__1_#t~ret55#1;havoc __utac_acc__Specification3_spec__1_#t~ret55#1; {1549#false} is VALID [2022-02-20 18:10:00,739 INFO L290 TraceCheckUtils]: 29: Hoare triple {1549#false} assume !(0bv32 != __utac_acc__Specification3_spec__1_~tmp___1~1#1);assume { :begin_inline___automaton_fail } true; {1549#false} is VALID [2022-02-20 18:10:00,739 INFO L290 TraceCheckUtils]: 30: Hoare triple {1549#false} assume !false; {1549#false} is VALID [2022-02-20 18:10:00,739 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:10:00,739 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 18:10:00,739 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 18:10:00,739 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1169808148] [2022-02-20 18:10:00,739 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1169808148] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:10:00,740 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:10:00,740 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:10:00,740 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309134670] [2022-02-20 18:10:00,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:10:00,740 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 31 [2022-02-20 18:10:00,740 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:10:00,741 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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:10:00,762 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:10:00,762 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:10:00,762 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 18:10:00,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:10:00,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:10:00,763 INFO L87 Difference]: Start difference. First operand 97 states and 126 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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:10:00,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:10:00,950 INFO L93 Difference]: Finished difference Result 275 states and 363 transitions. [2022-02-20 18:10:00,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:10:00,951 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 31 [2022-02-20 18:10:00,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:10:00,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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:10:00,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 363 transitions. [2022-02-20 18:10:00,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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:10:00,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 363 transitions. [2022-02-20 18:10:00,958 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 363 transitions. [2022-02-20 18:10:01,201 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 363 edges. 363 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:10:01,212 INFO L225 Difference]: With dead ends: 275 [2022-02-20 18:10:01,213 INFO L226 Difference]: Without dead ends: 185 [2022-02-20 18:10:01,214 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 29 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:10:01,217 INFO L933 BasicCegarLoop]: 160 mSDtfsCounter, 118 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:10:01,218 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 274 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:10:01,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-02-20 18:10:01,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 182. [2022-02-20 18:10:01,229 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:10:01,230 INFO L82 GeneralOperation]: Start isEquivalent. First operand 185 states. Second operand has 182 states, 131 states have (on average 1.3435114503816794) internal successors, (176), 150 states have internal predecessors, (176), 32 states have call successors, (32), 18 states have call predecessors, (32), 18 states have return successors, (32), 21 states have call predecessors, (32), 32 states have call successors, (32) [2022-02-20 18:10:01,231 INFO L74 IsIncluded]: Start isIncluded. First operand 185 states. Second operand has 182 states, 131 states have (on average 1.3435114503816794) internal successors, (176), 150 states have internal predecessors, (176), 32 states have call successors, (32), 18 states have call predecessors, (32), 18 states have return successors, (32), 21 states have call predecessors, (32), 32 states have call successors, (32) [2022-02-20 18:10:01,231 INFO L87 Difference]: Start difference. First operand 185 states. Second operand has 182 states, 131 states have (on average 1.3435114503816794) internal successors, (176), 150 states have internal predecessors, (176), 32 states have call successors, (32), 18 states have call predecessors, (32), 18 states have return successors, (32), 21 states have call predecessors, (32), 32 states have call successors, (32) [2022-02-20 18:10:01,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:10:01,237 INFO L93 Difference]: Finished difference Result 185 states and 242 transitions. [2022-02-20 18:10:01,237 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 242 transitions. [2022-02-20 18:10:01,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:10:01,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:10:01,238 INFO L74 IsIncluded]: Start isIncluded. First operand has 182 states, 131 states have (on average 1.3435114503816794) internal successors, (176), 150 states have internal predecessors, (176), 32 states have call successors, (32), 18 states have call predecessors, (32), 18 states have return successors, (32), 21 states have call predecessors, (32), 32 states have call successors, (32) Second operand 185 states. [2022-02-20 18:10:01,238 INFO L87 Difference]: Start difference. First operand has 182 states, 131 states have (on average 1.3435114503816794) internal successors, (176), 150 states have internal predecessors, (176), 32 states have call successors, (32), 18 states have call predecessors, (32), 18 states have return successors, (32), 21 states have call predecessors, (32), 32 states have call successors, (32) Second operand 185 states. [2022-02-20 18:10:01,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:10:01,243 INFO L93 Difference]: Finished difference Result 185 states and 242 transitions. [2022-02-20 18:10:01,243 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 242 transitions. [2022-02-20 18:10:01,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:10:01,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:10:01,244 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:10:01,244 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:10:01,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 131 states have (on average 1.3435114503816794) internal successors, (176), 150 states have internal predecessors, (176), 32 states have call successors, (32), 18 states have call predecessors, (32), 18 states have return successors, (32), 21 states have call predecessors, (32), 32 states have call successors, (32) [2022-02-20 18:10:01,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 240 transitions. [2022-02-20 18:10:01,249 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 240 transitions. Word has length 31 [2022-02-20 18:10:01,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:10:01,249 INFO L470 AbstractCegarLoop]: Abstraction has 182 states and 240 transitions. [2022-02-20 18:10:01,250 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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:10:01,250 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 240 transitions. [2022-02-20 18:10:01,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-20 18:10:01,250 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:10:01,251 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] [2022-02-20 18:10:01,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-02-20 18:10:01,457 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:10:01,458 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:10:01,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:10:01,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1994729148, now seen corresponding path program 1 times [2022-02-20 18:10:01,458 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 18:10:01,459 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1531826444] [2022-02-20 18:10:01,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:10:01,459 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 18:10:01,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 18:10:01,461 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:10:01,462 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:10:01,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:10:01,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 18:10:01,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:10:01,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:10:01,640 INFO L290 TraceCheckUtils]: 0: Hoare triple {2669#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(13bv32, 4bv32);call #Ultimate.allocInit(3bv32, 5bv32);call write~init~intINTTYPE1(79bv8, 5bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(110bv8, 5bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 5bv32, 2bv32, 1bv32);call #Ultimate.allocInit(4bv32, 6bv32);call write~init~intINTTYPE1(79bv8, 6bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(102bv8, 6bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(102bv8, 6bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 6bv32, 3bv32, 1bv32);call #Ultimate.allocInit(7bv32, 7bv32);call write~init~intINTTYPE1(44bv8, 7bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(80bv8, 7bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(117bv8, 7bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(109bv8, 7bv32, 3bv32, 1bv32);call write~init~intINTTYPE1(112bv8, 7bv32, 4bv32, 1bv32);call write~init~intINTTYPE1(58bv8, 7bv32, 5bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 7bv32, 6bv32, 1bv32);call #Ultimate.allocInit(3bv32, 8bv32);call write~init~intINTTYPE1(79bv8, 8bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(110bv8, 8bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 8bv32, 2bv32, 1bv32);call #Ultimate.allocInit(4bv32, 9bv32);call write~init~intINTTYPE1(79bv8, 9bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(102bv8, 9bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(102bv8, 9bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 9bv32, 3bv32, 1bv32);call #Ultimate.allocInit(3bv32, 10bv32);call write~init~intINTTYPE1(41bv8, 10bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(32bv8, 10bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 10bv32, 2bv32, 1bv32);call #Ultimate.allocInit(2bv32, 11bv32);call write~init~intINTTYPE1(10bv8, 11bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 11bv32, 1bv32, 1bv32);call #Ultimate.allocInit(13bv32, 12bv32);call #Ultimate.allocInit(7bv32, 13bv32);call write~init~intINTTYPE1(44bv8, 13bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(77bv8, 13bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(101bv8, 13bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(116bv8, 13bv32, 3bv32, 1bv32);call write~init~intINTTYPE1(104bv8, 13bv32, 4bv32, 1bv32);call write~init~intINTTYPE1(58bv8, 13bv32, 5bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 13bv32, 6bv32, 1bv32);call #Ultimate.allocInit(5bv32, 14bv32);call write~init~intINTTYPE1(67bv8, 14bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(82bv8, 14bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(73bv8, 14bv32, 2bv32, 1bv32);call write~init~intINTTYPE1(84bv8, 14bv32, 3bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 14bv32, 4bv32, 1bv32);call #Ultimate.allocInit(3bv32, 15bv32);call write~init~intINTTYPE1(79bv8, 15bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(75bv8, 15bv32, 1bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 15bv32, 2bv32, 1bv32);call #Ultimate.allocInit(2bv32, 16bv32);call write~init~intINTTYPE1(41bv8, 16bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 16bv32, 1bv32, 1bv32);call #Ultimate.allocInit(30bv32, 17bv32);call #Ultimate.allocInit(9bv32, 18bv32);call #Ultimate.allocInit(21bv32, 19bv32);call #Ultimate.allocInit(30bv32, 20bv32);call #Ultimate.allocInit(9bv32, 21bv32);call #Ultimate.allocInit(21bv32, 22bv32);call #Ultimate.allocInit(30bv32, 23bv32);call #Ultimate.allocInit(9bv32, 24bv32);call #Ultimate.allocInit(25bv32, 25bv32);call #Ultimate.allocInit(30bv32, 26bv32);call #Ultimate.allocInit(9bv32, 27bv32);call #Ultimate.allocInit(25bv32, 28bv32);~pumpRunning~0 := 0bv32;~systemActive~0 := 1bv32;~waterLevel~0 := 1bv32;~methaneLevelCritical~0 := 0bv32;~head~0.base, ~head~0.offset := 0bv32, 0bv32;~cleanupTimeShifts~0 := 4bv32; {2674#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:10:01,641 INFO L290 TraceCheckUtils]: 1: Hoare triple {2674#(= ~waterLevel~0 (_ bv1 32))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret52#1, main_~retValue_acc~13#1, main_~tmp~10#1;havoc main_~retValue_acc~13#1;havoc main_~tmp~10#1;assume { :begin_inline_select_helpers } true; {2674#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:10:01,642 INFO L290 TraceCheckUtils]: 2: Hoare triple {2674#(= ~waterLevel~0 (_ bv1 32))} assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; {2674#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:10:01,643 INFO L290 TraceCheckUtils]: 3: Hoare triple {2674#(= ~waterLevel~0 (_ bv1 32))} assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~1#1;havoc valid_product_~retValue_acc~1#1;valid_product_~retValue_acc~1#1 := 1bv32;valid_product_#res#1 := valid_product_~retValue_acc~1#1; {2674#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:10:01,643 INFO L290 TraceCheckUtils]: 4: Hoare triple {2674#(= ~waterLevel~0 (_ bv1 32))} main_#t~ret52#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;main_~tmp~10#1 := main_#t~ret52#1;havoc main_#t~ret52#1; {2674#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:10:01,643 INFO L290 TraceCheckUtils]: 5: Hoare triple {2674#(= ~waterLevel~0 (_ bv1 32))} assume 0bv32 != main_~tmp~10#1;assume { :begin_inline_setup } true; {2674#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:10:01,644 INFO L290 TraceCheckUtils]: 6: Hoare triple {2674#(= ~waterLevel~0 (_ bv1 32))} assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;havoc test_#t~nondet20#1, test_#t~nondet21#1, test_#t~nondet22#1, test_#t~nondet23#1, test_~splverifierCounter~0#1, test_~tmp~6#1, test_~tmp___0~2#1, test_~tmp___1~0#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~6#1;havoc test_~tmp___0~2#1;havoc test_~tmp___1~0#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0bv32; {2674#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:10:01,644 INFO L290 TraceCheckUtils]: 7: Hoare triple {2674#(= ~waterLevel~0 (_ bv1 32))} assume !false; {2674#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:10:01,644 INFO L290 TraceCheckUtils]: 8: Hoare triple {2674#(= ~waterLevel~0 (_ bv1 32))} assume ~bvslt32(test_~splverifierCounter~0#1, 4bv32); {2674#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:10:01,644 INFO L290 TraceCheckUtils]: 9: Hoare triple {2674#(= ~waterLevel~0 (_ bv1 32))} test_~tmp~6#1 := test_#t~nondet20#1;havoc test_#t~nondet20#1; {2674#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:10:01,645 INFO L290 TraceCheckUtils]: 10: Hoare triple {2674#(= ~waterLevel~0 (_ bv1 32))} assume !(0bv32 != test_~tmp~6#1); {2674#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:10:01,645 INFO L290 TraceCheckUtils]: 11: Hoare triple {2674#(= ~waterLevel~0 (_ bv1 32))} test_~tmp___0~2#1 := test_#t~nondet21#1;havoc test_#t~nondet21#1; {2674#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:10:01,645 INFO L290 TraceCheckUtils]: 12: Hoare triple {2674#(= ~waterLevel~0 (_ bv1 32))} assume !(0bv32 != test_~tmp___0~2#1); {2674#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:10:01,646 INFO L290 TraceCheckUtils]: 13: Hoare triple {2674#(= ~waterLevel~0 (_ bv1 32))} test_~tmp___2~0#1 := test_#t~nondet22#1;havoc test_#t~nondet22#1; {2674#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:10:01,646 INFO L290 TraceCheckUtils]: 14: Hoare triple {2674#(= ~waterLevel~0 (_ bv1 32))} assume !(0bv32 != test_~tmp___2~0#1);test_~tmp___1~0#1 := test_#t~nondet23#1;havoc test_#t~nondet23#1; {2674#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:10:01,646 INFO L290 TraceCheckUtils]: 15: Hoare triple {2674#(= ~waterLevel~0 (_ bv1 32))} assume 0bv32 != test_~tmp___1~0#1;assume { :begin_inline_stopSystem } true; {2674#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:10:01,647 INFO L290 TraceCheckUtils]: 16: Hoare triple {2674#(= ~waterLevel~0 (_ bv1 32))} assume !(0bv32 != ~pumpRunning~0); {2674#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:10:01,647 INFO L290 TraceCheckUtils]: 17: Hoare triple {2674#(= ~waterLevel~0 (_ bv1 32))} ~systemActive~0 := 0bv32; {2674#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:10:01,648 INFO L290 TraceCheckUtils]: 18: Hoare triple {2674#(= ~waterLevel~0 (_ bv1 32))} assume { :end_inline_stopSystem } true; {2674#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:10:01,648 INFO L272 TraceCheckUtils]: 19: Hoare triple {2674#(= ~waterLevel~0 (_ bv1 32))} call timeShift(); {2674#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:10:01,648 INFO L290 TraceCheckUtils]: 20: Hoare triple {2674#(= ~waterLevel~0 (_ bv1 32))} assume !(0bv32 != ~pumpRunning~0); {2674#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:10:01,649 INFO L290 TraceCheckUtils]: 21: Hoare triple {2674#(= ~waterLevel~0 (_ bv1 32))} assume !(0bv32 != ~systemActive~0); {2674#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:10:01,649 INFO L290 TraceCheckUtils]: 22: Hoare triple {2674#(= ~waterLevel~0 (_ bv1 32))} assume { :begin_inline___utac_acc__Specification3_spec__1 } true;havoc __utac_acc__Specification3_spec__1_#t~ret53#1, __utac_acc__Specification3_spec__1_#t~ret54#1, __utac_acc__Specification3_spec__1_#t~ret55#1, __utac_acc__Specification3_spec__1_~tmp~11#1, __utac_acc__Specification3_spec__1_~tmp___0~3#1, __utac_acc__Specification3_spec__1_~tmp___1~1#1;havoc __utac_acc__Specification3_spec__1_~tmp~11#1;havoc __utac_acc__Specification3_spec__1_~tmp___0~3#1;havoc __utac_acc__Specification3_spec__1_~tmp___1~1#1; {2674#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:10:01,655 INFO L272 TraceCheckUtils]: 23: Hoare triple {2674#(= ~waterLevel~0 (_ bv1 32))} call __utac_acc__Specification3_spec__1_#t~ret53#1 := isMethaneLevelCritical(); {2674#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:10:01,656 INFO L290 TraceCheckUtils]: 24: Hoare triple {2674#(= ~waterLevel~0 (_ bv1 32))} havoc ~retValue_acc~6;~retValue_acc~6 := ~methaneLevelCritical~0;#res := ~retValue_acc~6; {2674#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:10:01,656 INFO L290 TraceCheckUtils]: 25: Hoare triple {2674#(= ~waterLevel~0 (_ bv1 32))} assume true; {2674#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:10:01,656 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2674#(= ~waterLevel~0 (_ bv1 32))} {2674#(= ~waterLevel~0 (_ bv1 32))} #297#return; {2674#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:10:01,658 INFO L290 TraceCheckUtils]: 27: Hoare triple {2674#(= ~waterLevel~0 (_ bv1 32))} __utac_acc__Specification3_spec__1_~tmp~11#1 := __utac_acc__Specification3_spec__1_#t~ret53#1;havoc __utac_acc__Specification3_spec__1_#t~ret53#1; {2674#(= ~waterLevel~0 (_ bv1 32))} is VALID [2022-02-20 18:10:01,658 INFO L290 TraceCheckUtils]: 28: Hoare triple {2674#(= ~waterLevel~0 (_ bv1 32))} assume !(0bv32 != __utac_acc__Specification3_spec__1_~tmp~11#1);assume { :begin_inline_getWaterLevel } true;havoc getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~7#1;havoc getWaterLevel_~retValue_acc~7#1;getWaterLevel_~retValue_acc~7#1 := ~waterLevel~0;getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~7#1; {2759#(= |timeShift_getWaterLevel_#res#1| (_ bv1 32))} is VALID [2022-02-20 18:10:01,659 INFO L290 TraceCheckUtils]: 29: Hoare triple {2759#(= |timeShift_getWaterLevel_#res#1| (_ bv1 32))} __utac_acc__Specification3_spec__1_#t~ret54#1 := getWaterLevel_#res#1;assume { :end_inline_getWaterLevel } true;__utac_acc__Specification3_spec__1_~tmp___0~3#1 := __utac_acc__Specification3_spec__1_#t~ret54#1;havoc __utac_acc__Specification3_spec__1_#t~ret54#1; {2763#(= |timeShift___utac_acc__Specification3_spec__1_~tmp___0~3#1| (_ bv1 32))} is VALID [2022-02-20 18:10:01,660 INFO L290 TraceCheckUtils]: 30: Hoare triple {2763#(= |timeShift___utac_acc__Specification3_spec__1_~tmp___0~3#1| (_ bv1 32))} assume 2bv32 == __utac_acc__Specification3_spec__1_~tmp___0~3#1;assume { :begin_inline_isPumpRunning } true;havoc isPumpRunning_#res#1;havoc isPumpRunning_~retValue_acc~3#1;havoc isPumpRunning_~retValue_acc~3#1;isPumpRunning_~retValue_acc~3#1 := ~pumpRunning~0;isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~3#1; {2670#false} is VALID [2022-02-20 18:10:01,661 INFO L290 TraceCheckUtils]: 31: Hoare triple {2670#false} __utac_acc__Specification3_spec__1_#t~ret55#1 := isPumpRunning_#res#1;assume { :end_inline_isPumpRunning } true;__utac_acc__Specification3_spec__1_~tmp___1~1#1 := __utac_acc__Specification3_spec__1_#t~ret55#1;havoc __utac_acc__Specification3_spec__1_#t~ret55#1; {2670#false} is VALID [2022-02-20 18:10:01,661 INFO L290 TraceCheckUtils]: 32: Hoare triple {2670#false} assume !(0bv32 != __utac_acc__Specification3_spec__1_~tmp___1~1#1);assume { :begin_inline___automaton_fail } true; {2670#false} is VALID [2022-02-20 18:10:01,671 INFO L290 TraceCheckUtils]: 33: Hoare triple {2670#false} assume !false; {2670#false} is VALID [2022-02-20 18:10:01,671 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:10:01,671 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 18:10:01,672 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 18:10:01,672 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1531826444] [2022-02-20 18:10:01,672 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1531826444] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:10:01,674 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:10:01,675 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:10:01,675 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047412454] [2022-02-20 18:10:01,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:10:01,675 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (2), 1 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 34 [2022-02-20 18:10:01,676 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:10:01,676 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (2), 1 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:10:01,700 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:10:01,700 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:10:01,701 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 18:10:01,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:10:01,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:10:01,701 INFO L87 Difference]: Start difference. First operand 182 states and 240 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (2), 1 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:10:02,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:10:02,097 INFO L93 Difference]: Finished difference Result 526 states and 715 transitions. [2022-02-20 18:10:02,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:10:02,097 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (2), 1 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 34 [2022-02-20 18:10:02,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:10:02,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (2), 1 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:10:02,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 368 transitions. [2022-02-20 18:10:02,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (2), 1 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:10:02,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 368 transitions. [2022-02-20 18:10:02,108 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 368 transitions. [2022-02-20 18:10:02,361 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 368 edges. 368 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:10:02,370 INFO L225 Difference]: With dead ends: 526 [2022-02-20 18:10:02,370 INFO L226 Difference]: Without dead ends: 351 [2022-02-20 18:10:02,371 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 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:10:02,372 INFO L933 BasicCegarLoop]: 138 mSDtfsCounter, 92 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:10:02,372 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 522 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:10:02,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2022-02-20 18:10:02,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 345. [2022-02-20 18:10:02,389 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:10:02,390 INFO L82 GeneralOperation]: Start isEquivalent. First operand 351 states. Second operand has 345 states, 246 states have (on average 1.3252032520325203) internal successors, (326), 281 states have internal predecessors, (326), 64 states have call successors, (64), 36 states have call predecessors, (64), 34 states have return successors, (66), 40 states have call predecessors, (66), 64 states have call successors, (66) [2022-02-20 18:10:02,391 INFO L74 IsIncluded]: Start isIncluded. First operand 351 states. Second operand has 345 states, 246 states have (on average 1.3252032520325203) internal successors, (326), 281 states have internal predecessors, (326), 64 states have call successors, (64), 36 states have call predecessors, (64), 34 states have return successors, (66), 40 states have call predecessors, (66), 64 states have call successors, (66) [2022-02-20 18:10:02,391 INFO L87 Difference]: Start difference. First operand 351 states. Second operand has 345 states, 246 states have (on average 1.3252032520325203) internal successors, (326), 281 states have internal predecessors, (326), 64 states have call successors, (64), 36 states have call predecessors, (64), 34 states have return successors, (66), 40 states have call predecessors, (66), 64 states have call successors, (66) [2022-02-20 18:10:02,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:10:02,401 INFO L93 Difference]: Finished difference Result 351 states and 462 transitions. [2022-02-20 18:10:02,401 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 462 transitions. [2022-02-20 18:10:02,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:10:02,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:10:02,403 INFO L74 IsIncluded]: Start isIncluded. First operand has 345 states, 246 states have (on average 1.3252032520325203) internal successors, (326), 281 states have internal predecessors, (326), 64 states have call successors, (64), 36 states have call predecessors, (64), 34 states have return successors, (66), 40 states have call predecessors, (66), 64 states have call successors, (66) Second operand 351 states. [2022-02-20 18:10:02,404 INFO L87 Difference]: Start difference. First operand has 345 states, 246 states have (on average 1.3252032520325203) internal successors, (326), 281 states have internal predecessors, (326), 64 states have call successors, (64), 36 states have call predecessors, (64), 34 states have return successors, (66), 40 states have call predecessors, (66), 64 states have call successors, (66) Second operand 351 states. [2022-02-20 18:10:02,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:10:02,413 INFO L93 Difference]: Finished difference Result 351 states and 462 transitions. [2022-02-20 18:10:02,413 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 462 transitions. [2022-02-20 18:10:02,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:10:02,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:10:02,414 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:10:02,414 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:10:02,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 246 states have (on average 1.3252032520325203) internal successors, (326), 281 states have internal predecessors, (326), 64 states have call successors, (64), 36 states have call predecessors, (64), 34 states have return successors, (66), 40 states have call predecessors, (66), 64 states have call successors, (66) [2022-02-20 18:10:02,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 456 transitions. [2022-02-20 18:10:02,427 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 456 transitions. Word has length 34 [2022-02-20 18:10:02,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:10:02,427 INFO L470 AbstractCegarLoop]: Abstraction has 345 states and 456 transitions. [2022-02-20 18:10:02,427 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (2), 1 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:10:02,427 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 456 transitions. [2022-02-20 18:10:02,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-20 18:10:02,429 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:10:02,429 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] [2022-02-20 18:10:02,438 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:10:02,638 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:10:02,638 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:10:02,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:10:02,639 INFO L85 PathProgramCache]: Analyzing trace with hash 695972842, now seen corresponding path program 1 times [2022-02-20 18:10:02,639 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 18:10:02,639 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1023579150] [2022-02-20 18:10:02,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:10:02,640 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 18:10:02,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 18:10:02,641 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:10:02,641 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:10:02,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 18:10:02,705 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 18:10:02,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 18:10:02,751 INFO L138 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-02-20 18:10:02,751 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 18:10:02,752 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 18:10:02,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-02-20 18:10:02,953 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:10:02,956 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-02-20 18:10:02,958 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 18:10:02,973 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call waterRise(); [2022-02-20 18:10:02,974 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:10:02,976 INFO L158 Benchmark]: Toolchain (without parser) took 5226.72ms. Allocated memory was 58.7MB in the beginning and 107.0MB in the end (delta: 48.2MB). Free memory was 36.7MB in the beginning and 74.1MB in the end (delta: -37.4MB). Peak memory consumption was 10.4MB. Max. memory is 16.1GB. [2022-02-20 18:10:02,977 INFO L158 Benchmark]: CDTParser took 0.41ms. Allocated memory is still 58.7MB. Free memory was 40.8MB in the beginning and 40.7MB in the end (delta: 43.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 18:10:02,977 INFO L158 Benchmark]: CACSL2BoogieTranslator took 461.57ms. Allocated memory was 58.7MB in the beginning and 73.4MB in the end (delta: 14.7MB). Free memory was 36.5MB in the beginning and 54.9MB in the end (delta: -18.4MB). Peak memory consumption was 15.8MB. Max. memory is 16.1GB. [2022-02-20 18:10:02,977 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.50ms. Allocated memory is still 73.4MB. Free memory was 54.9MB in the beginning and 51.9MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 18:10:02,978 INFO L158 Benchmark]: Boogie Preprocessor took 44.97ms. Allocated memory is still 73.4MB. Free memory was 51.9MB in the beginning and 49.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 18:10:02,978 INFO L158 Benchmark]: RCFGBuilder took 453.73ms. Allocated memory is still 73.4MB. Free memory was 49.9MB in the beginning and 48.7MB in the end (delta: 1.2MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. [2022-02-20 18:10:02,978 INFO L158 Benchmark]: TraceAbstraction took 4201.29ms. Allocated memory was 73.4MB in the beginning and 107.0MB in the end (delta: 33.6MB). Free memory was 48.0MB in the beginning and 74.1MB in the end (delta: -26.1MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. [2022-02-20 18:10:02,979 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.41ms. Allocated memory is still 58.7MB. Free memory was 40.8MB in the beginning and 40.7MB in the end (delta: 43.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 461.57ms. Allocated memory was 58.7MB in the beginning and 73.4MB in the end (delta: 14.7MB). Free memory was 36.5MB in the beginning and 54.9MB in the end (delta: -18.4MB). Peak memory consumption was 15.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.50ms. Allocated memory is still 73.4MB. Free memory was 54.9MB in the beginning and 51.9MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.97ms. Allocated memory is still 73.4MB. Free memory was 51.9MB in the beginning and 49.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 453.73ms. Allocated memory is still 73.4MB. Free memory was 49.9MB in the beginning and 48.7MB in the end (delta: 1.2MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. * TraceAbstraction took 4201.29ms. Allocated memory was 73.4MB in the beginning and 107.0MB in the end (delta: 33.6MB). Free memory was 48.0MB in the beginning and 74.1MB in the end (delta: -26.1MB). Peak memory consumption was 6.6MB. 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:10:03,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator