./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/product-lines/minepump_spec4_product44.cil.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination 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/AutomizerTermination.xml -i ../sv-benchmarks/c/product-lines/minepump_spec4_product44.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-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(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash da786641c6f5791cd76909be3af2b92112e50156e91d6775689240586eed4e85 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 04:17:55,706 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 04:17:55,708 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 04:17:55,736 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 04:17:55,737 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 04:17:55,740 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 04:17:55,742 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 04:17:55,745 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 04:17:55,747 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 04:17:55,752 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 04:17:55,753 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 04:17:55,754 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 04:17:55,754 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 04:17:55,757 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 04:17:55,759 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 04:17:55,761 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 04:17:55,761 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 04:17:55,762 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 04:17:55,767 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 04:17:55,772 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 04:17:55,774 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 04:17:55,774 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 04:17:55,775 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 04:17:55,776 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 04:17:55,777 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 04:17:55,777 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 04:17:55,777 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 04:17:55,778 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 04:17:55,778 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 04:17:55,779 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 04:17:55,779 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 04:17:55,779 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 04:17:55,780 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 04:17:55,780 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 04:17:55,781 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 04:17:55,781 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 04:17:55,781 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 04:17:55,781 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 04:17:55,781 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 04:17:55,782 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 04:17:55,782 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 04:17:55,786 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-02-21 04:17:55,817 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 04:17:55,817 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 04:17:55,818 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 04:17:55,818 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 04:17:55,819 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 04:17:55,819 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 04:17:55,819 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 04:17:55,820 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 04:17:55,820 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 04:17:55,820 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 04:17:55,821 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 04:17:55,821 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 04:17:55,821 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 04:17:55,821 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 04:17:55,822 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 04:17:55,822 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 04:17:55,822 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 04:17:55,822 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 04:17:55,822 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 04:17:55,823 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 04:17:55,823 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 04:17:55,823 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 04:17:55,823 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 04:17:55,823 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 04:17:55,824 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 04:17:55,824 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 04:17:55,824 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 04:17:55,824 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 04:17:55,824 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 04:17:55,825 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 04:17:55,825 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 04:17:55,826 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 04:17:55,826 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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(F end) ) 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 -> da786641c6f5791cd76909be3af2b92112e50156e91d6775689240586eed4e85 [2022-02-21 04:17:56,046 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 04:17:56,069 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 04:17:56,072 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 04:17:56,073 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 04:17:56,074 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 04:17:56,075 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec4_product44.cil.c [2022-02-21 04:17:56,136 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce68d9ed6/1a5fce9b67a94907866ca159dd2ddb55/FLAG12dd294d5 [2022-02-21 04:17:56,628 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 04:17:56,631 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product44.cil.c [2022-02-21 04:17:56,650 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce68d9ed6/1a5fce9b67a94907866ca159dd2ddb55/FLAG12dd294d5 [2022-02-21 04:17:57,112 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce68d9ed6/1a5fce9b67a94907866ca159dd2ddb55 [2022-02-21 04:17:57,115 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 04:17:57,116 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 04:17:57,117 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 04:17:57,118 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 04:17:57,125 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 04:17:57,125 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:17:57" (1/1) ... [2022-02-21 04:17:57,126 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4198b987 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:17:57, skipping insertion in model container [2022-02-21 04:17:57,126 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:17:57" (1/1) ... [2022-02-21 04:17:57,132 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 04:17:57,171 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 04:17:57,471 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_spec4_product44.cil.c[15806,15819] [2022-02-21 04:17:57,487 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:17:57,495 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 04:17:57,562 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_spec4_product44.cil.c[15806,15819] [2022-02-21 04:17:57,569 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:17:57,602 INFO L208 MainTranslator]: Completed translation [2022-02-21 04:17:57,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:17:57 WrapperNode [2022-02-21 04:17:57,603 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 04:17:57,605 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 04:17:57,605 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 04:17:57,605 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 04:17:57,612 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:17:57" (1/1) ... [2022-02-21 04:17:57,642 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:17:57" (1/1) ... [2022-02-21 04:17:57,685 INFO L137 Inliner]: procedures = 55, calls = 154, calls flagged for inlining = 51, calls inlined = 59, statements flattened = 462 [2022-02-21 04:17:57,685 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 04:17:57,686 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 04:17:57,686 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 04:17:57,686 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 04:17:57,693 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:17:57" (1/1) ... [2022-02-21 04:17:57,700 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:17:57" (1/1) ... [2022-02-21 04:17:57,703 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:17:57" (1/1) ... [2022-02-21 04:17:57,703 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:17:57" (1/1) ... [2022-02-21 04:17:57,710 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:17:57" (1/1) ... [2022-02-21 04:17:57,724 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:17:57" (1/1) ... [2022-02-21 04:17:57,725 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:17:57" (1/1) ... [2022-02-21 04:17:57,728 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 04:17:57,728 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 04:17:57,728 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 04:17:57,728 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 04:17:57,729 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:17:57" (1/1) ... [2022-02-21 04:17:57,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:17:57,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:17:57,764 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:17:57,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-02-21 04:17:57,792 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 04:17:57,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 04:17:57,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 04:17:57,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 04:17:57,858 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 04:17:57,859 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 04:17:58,197 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 04:17:58,203 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 04:17:58,208 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-21 04:17:58,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:17:58 BoogieIcfgContainer [2022-02-21 04:17:58,210 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 04:17:58,211 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 04:17:58,211 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 04:17:58,214 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 04:17:58,224 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:17:58,224 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 04:17:57" (1/3) ... [2022-02-21 04:17:58,225 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4a2cf23e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:17:58, skipping insertion in model container [2022-02-21 04:17:58,225 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:17:58,225 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:17:57" (2/3) ... [2022-02-21 04:17:58,226 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4a2cf23e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:17:58, skipping insertion in model container [2022-02-21 04:17:58,226 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:17:58,226 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:17:58" (3/3) ... [2022-02-21 04:17:58,227 INFO L388 chiAutomizerObserver]: Analyzing ICFG minepump_spec4_product44.cil.c [2022-02-21 04:17:58,288 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 04:17:58,288 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 04:17:58,288 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 04:17:58,289 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 04:17:58,289 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 04:17:58,289 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 04:17:58,289 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 04:17:58,289 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 04:17:58,317 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 122 states, 121 states have (on average 1.3636363636363635) internal successors, (165), 121 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:17:58,379 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 79 [2022-02-21 04:17:58,380 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:17:58,380 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:17:58,386 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:17:58,386 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:17:58,386 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 04:17:58,389 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 122 states, 121 states have (on average 1.3636363636363635) internal successors, (165), 121 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:17:58,412 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 79 [2022-02-21 04:17:58,412 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:17:58,412 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:17:58,414 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:17:58,414 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:17:58,422 INFO L791 eck$LassoCheckResult]: Stem: 113#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(31, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(30, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(21, 6);call #Ultimate.allocInit(30, 7);call #Ultimate.allocInit(9, 8);call #Ultimate.allocInit(21, 9);call #Ultimate.allocInit(30, 10);call #Ultimate.allocInit(9, 11);call #Ultimate.allocInit(25, 12);call #Ultimate.allocInit(30, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(25, 15);call #Ultimate.allocInit(13, 16);call #Ultimate.allocInit(3, 17);call write~init~int(79, 17, 0, 1);call write~init~int(110, 17, 1, 1);call write~init~int(0, 17, 2, 1);call #Ultimate.allocInit(4, 18);call write~init~int(79, 18, 0, 1);call write~init~int(102, 18, 1, 1);call write~init~int(102, 18, 2, 1);call write~init~int(0, 18, 3, 1);call #Ultimate.allocInit(7, 19);call write~init~int(44, 19, 0, 1);call write~init~int(80, 19, 1, 1);call write~init~int(117, 19, 2, 1);call write~init~int(109, 19, 3, 1);call write~init~int(112, 19, 4, 1);call write~init~int(58, 19, 5, 1);call write~init~int(0, 19, 6, 1);call #Ultimate.allocInit(3, 20);call write~init~int(79, 20, 0, 1);call write~init~int(110, 20, 1, 1);call write~init~int(0, 20, 2, 1);call #Ultimate.allocInit(4, 21);call write~init~int(79, 21, 0, 1);call write~init~int(102, 21, 1, 1);call write~init~int(102, 21, 2, 1);call write~init~int(0, 21, 3, 1);call #Ultimate.allocInit(3, 22);call write~init~int(41, 22, 0, 1);call write~init~int(32, 22, 1, 1);call write~init~int(0, 22, 2, 1);call #Ultimate.allocInit(2, 23);call write~init~int(10, 23, 0, 1);call write~init~int(0, 23, 1, 1);call #Ultimate.allocInit(13, 24);call #Ultimate.allocInit(7, 25);call write~init~int(44, 25, 0, 1);call write~init~int(77, 25, 1, 1);call write~init~int(101, 25, 2, 1);call write~init~int(116, 25, 3, 1);call write~init~int(104, 25, 4, 1);call write~init~int(58, 25, 5, 1);call write~init~int(0, 25, 6, 1);call #Ultimate.allocInit(5, 26);call write~init~int(67, 26, 0, 1);call write~init~int(82, 26, 1, 1);call write~init~int(73, 26, 2, 1);call write~init~int(84, 26, 3, 1);call write~init~int(0, 26, 4, 1);call #Ultimate.allocInit(3, 27);call write~init~int(79, 27, 0, 1);call write~init~int(75, 27, 1, 1);call write~init~int(0, 27, 2, 1);call #Ultimate.allocInit(2, 28);call write~init~int(41, 28, 0, 1);call write~init~int(0, 28, 1, 1);~head~0.base, ~head~0.offset := 0, 0;~pumpRunning~0 := 0;~systemActive~0 := 1;~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0; 32#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret46#1, main_~retValue_acc~8#1, main_~tmp~8#1;havoc main_~retValue_acc~8#1;havoc main_~tmp~8#1;assume { :begin_inline_select_helpers } true; 98#L470true assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; 33#L463true assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~4#1;havoc valid_product_~retValue_acc~4#1;valid_product_~retValue_acc~4#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~4#1; 120#L478true main_#t~ret46#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;main_~tmp~8#1 := main_#t~ret46#1;havoc main_#t~ret46#1; 118#L849true assume 0 != main_~tmp~8#1;assume { :begin_inline_setup } true; 46#L826true assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;havoc test_#t~nondet30#1, test_#t~nondet31#1, test_#t~nondet32#1, test_#t~nondet33#1, test_~splverifierCounter~0#1, test_~tmp~4#1, test_~tmp___0~1#1, test_~tmp___1~0#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~4#1;havoc test_~tmp___0~1#1;havoc test_~tmp___1~0#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0; 50#L499-2true [2022-02-21 04:17:58,424 INFO L793 eck$LassoCheckResult]: Loop: 50#L499-2true assume !false; 111#L500true assume test_~splverifierCounter~0#1 < 4; 44#L501true test_~tmp~4#1 := test_#t~nondet30#1;havoc test_#t~nondet30#1; 41#L509true assume !(0 != test_~tmp~4#1); 74#L509-2true test_~tmp___0~1#1 := test_#t~nondet31#1;havoc test_#t~nondet31#1; 78#L519true assume !(0 != test_~tmp___0~1#1); 55#L519-2true test_~tmp___2~0#1 := test_#t~nondet32#1;havoc test_#t~nondet32#1; 83#L529true assume !(0 != test_~tmp___2~0#1);test_~tmp___1~0#1 := test_#t~nondet33#1;havoc test_#t~nondet33#1; 77#L537true assume !(0 != test_~tmp___1~0#1); 87#L537-2true assume { :begin_inline_timeShift } true; 97#L572true assume !(0 != ~pumpRunning~0); 19#L572-2true assume !(0 != ~systemActive~0); 8#L579-1true assume { :begin_inline___utac_acc__Specification4_spec__1 } true;havoc __utac_acc__Specification4_spec__1_#t~ret4#1, __utac_acc__Specification4_spec__1_#t~ret5#1, __utac_acc__Specification4_spec__1_~tmp~0#1, __utac_acc__Specification4_spec__1_~tmp___0~0#1;havoc __utac_acc__Specification4_spec__1_~tmp~0#1;havoc __utac_acc__Specification4_spec__1_~tmp___0~0#1;assume { :begin_inline_getWaterLevel } true;havoc getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~10#1;havoc getWaterLevel_~retValue_acc~10#1;getWaterLevel_~retValue_acc~10#1 := ~waterLevel~0;getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~10#1; 107#L938true __utac_acc__Specification4_spec__1_#t~ret4#1 := getWaterLevel_#res#1;assume { :end_inline_getWaterLevel } true;__utac_acc__Specification4_spec__1_~tmp~0#1 := __utac_acc__Specification4_spec__1_#t~ret4#1;havoc __utac_acc__Specification4_spec__1_#t~ret4#1; 65#L61true assume !(0 == __utac_acc__Specification4_spec__1_~tmp~0#1); 103#L61-1true assume { :end_inline___utac_acc__Specification4_spec__1 } true; 11#L589true assume { :end_inline_timeShift } true; 50#L499-2true [2022-02-21 04:17:58,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:17:58,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1803949509, now seen corresponding path program 1 times [2022-02-21 04:17:58,438 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:17:58,439 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329195364] [2022-02-21 04:17:58,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:17:58,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:17:58,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:17:58,584 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:17:58,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:17:58,645 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:17:58,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:17:58,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1883753039, now seen corresponding path program 1 times [2022-02-21 04:17:58,649 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:17:58,650 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810291589] [2022-02-21 04:17:58,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:17:58,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:17:58,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:17:58,677 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:17:58,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:17:58,687 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:17:58,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:17:58,690 INFO L85 PathProgramCache]: Analyzing trace with hash 952071435, now seen corresponding path program 1 times [2022-02-21 04:17:58,691 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:17:58,691 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570637835] [2022-02-21 04:17:58,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:17:58,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:17:58,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:17:58,854 INFO L290 TraceCheckUtils]: 0: Hoare triple {130#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(31, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(30, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(21, 6);call #Ultimate.allocInit(30, 7);call #Ultimate.allocInit(9, 8);call #Ultimate.allocInit(21, 9);call #Ultimate.allocInit(30, 10);call #Ultimate.allocInit(9, 11);call #Ultimate.allocInit(25, 12);call #Ultimate.allocInit(30, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(25, 15);call #Ultimate.allocInit(13, 16);call #Ultimate.allocInit(3, 17);call write~init~int(79, 17, 0, 1);call write~init~int(110, 17, 1, 1);call write~init~int(0, 17, 2, 1);call #Ultimate.allocInit(4, 18);call write~init~int(79, 18, 0, 1);call write~init~int(102, 18, 1, 1);call write~init~int(102, 18, 2, 1);call write~init~int(0, 18, 3, 1);call #Ultimate.allocInit(7, 19);call write~init~int(44, 19, 0, 1);call write~init~int(80, 19, 1, 1);call write~init~int(117, 19, 2, 1);call write~init~int(109, 19, 3, 1);call write~init~int(112, 19, 4, 1);call write~init~int(58, 19, 5, 1);call write~init~int(0, 19, 6, 1);call #Ultimate.allocInit(3, 20);call write~init~int(79, 20, 0, 1);call write~init~int(110, 20, 1, 1);call write~init~int(0, 20, 2, 1);call #Ultimate.allocInit(4, 21);call write~init~int(79, 21, 0, 1);call write~init~int(102, 21, 1, 1);call write~init~int(102, 21, 2, 1);call write~init~int(0, 21, 3, 1);call #Ultimate.allocInit(3, 22);call write~init~int(41, 22, 0, 1);call write~init~int(32, 22, 1, 1);call write~init~int(0, 22, 2, 1);call #Ultimate.allocInit(2, 23);call write~init~int(10, 23, 0, 1);call write~init~int(0, 23, 1, 1);call #Ultimate.allocInit(13, 24);call #Ultimate.allocInit(7, 25);call write~init~int(44, 25, 0, 1);call write~init~int(77, 25, 1, 1);call write~init~int(101, 25, 2, 1);call write~init~int(116, 25, 3, 1);call write~init~int(104, 25, 4, 1);call write~init~int(58, 25, 5, 1);call write~init~int(0, 25, 6, 1);call #Ultimate.allocInit(5, 26);call write~init~int(67, 26, 0, 1);call write~init~int(82, 26, 1, 1);call write~init~int(73, 26, 2, 1);call write~init~int(84, 26, 3, 1);call write~init~int(0, 26, 4, 1);call #Ultimate.allocInit(3, 27);call write~init~int(79, 27, 0, 1);call write~init~int(75, 27, 1, 1);call write~init~int(0, 27, 2, 1);call #Ultimate.allocInit(2, 28);call write~init~int(41, 28, 0, 1);call write~init~int(0, 28, 1, 1);~head~0.base, ~head~0.offset := 0, 0;~pumpRunning~0 := 0;~systemActive~0 := 1;~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0; {132#(= 1 ~systemActive~0)} is VALID [2022-02-21 04:17:58,855 INFO L290 TraceCheckUtils]: 1: Hoare triple {132#(= 1 ~systemActive~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret46#1, main_~retValue_acc~8#1, main_~tmp~8#1;havoc main_~retValue_acc~8#1;havoc main_~tmp~8#1;assume { :begin_inline_select_helpers } true; {132#(= 1 ~systemActive~0)} is VALID [2022-02-21 04:17:58,856 INFO L290 TraceCheckUtils]: 2: Hoare triple {132#(= 1 ~systemActive~0)} assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; {132#(= 1 ~systemActive~0)} is VALID [2022-02-21 04:17:58,856 INFO L290 TraceCheckUtils]: 3: Hoare triple {132#(= 1 ~systemActive~0)} assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~4#1;havoc valid_product_~retValue_acc~4#1;valid_product_~retValue_acc~4#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~4#1; {133#(= |ULTIMATE.start_valid_product_#res#1| ~systemActive~0)} is VALID [2022-02-21 04:17:58,857 INFO L290 TraceCheckUtils]: 4: Hoare triple {133#(= |ULTIMATE.start_valid_product_#res#1| ~systemActive~0)} main_#t~ret46#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;main_~tmp~8#1 := main_#t~ret46#1;havoc main_#t~ret46#1; {134#(= |ULTIMATE.start_main_~tmp~8#1| ~systemActive~0)} is VALID [2022-02-21 04:17:58,858 INFO L290 TraceCheckUtils]: 5: Hoare triple {134#(= |ULTIMATE.start_main_~tmp~8#1| ~systemActive~0)} assume 0 != main_~tmp~8#1;assume { :begin_inline_setup } true; {135#(not (= 0 ~systemActive~0))} is VALID [2022-02-21 04:17:58,858 INFO L290 TraceCheckUtils]: 6: Hoare triple {135#(not (= 0 ~systemActive~0))} assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;havoc test_#t~nondet30#1, test_#t~nondet31#1, test_#t~nondet32#1, test_#t~nondet33#1, test_~splverifierCounter~0#1, test_~tmp~4#1, test_~tmp___0~1#1, test_~tmp___1~0#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~4#1;havoc test_~tmp___0~1#1;havoc test_~tmp___1~0#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0; {135#(not (= 0 ~systemActive~0))} is VALID [2022-02-21 04:17:58,859 INFO L290 TraceCheckUtils]: 7: Hoare triple {135#(not (= 0 ~systemActive~0))} assume !false; {135#(not (= 0 ~systemActive~0))} is VALID [2022-02-21 04:17:58,860 INFO L290 TraceCheckUtils]: 8: Hoare triple {135#(not (= 0 ~systemActive~0))} assume test_~splverifierCounter~0#1 < 4; {135#(not (= 0 ~systemActive~0))} is VALID [2022-02-21 04:17:58,860 INFO L290 TraceCheckUtils]: 9: Hoare triple {135#(not (= 0 ~systemActive~0))} test_~tmp~4#1 := test_#t~nondet30#1;havoc test_#t~nondet30#1; {135#(not (= 0 ~systemActive~0))} is VALID [2022-02-21 04:17:58,861 INFO L290 TraceCheckUtils]: 10: Hoare triple {135#(not (= 0 ~systemActive~0))} assume !(0 != test_~tmp~4#1); {135#(not (= 0 ~systemActive~0))} is VALID [2022-02-21 04:17:58,862 INFO L290 TraceCheckUtils]: 11: Hoare triple {135#(not (= 0 ~systemActive~0))} test_~tmp___0~1#1 := test_#t~nondet31#1;havoc test_#t~nondet31#1; {135#(not (= 0 ~systemActive~0))} is VALID [2022-02-21 04:17:58,862 INFO L290 TraceCheckUtils]: 12: Hoare triple {135#(not (= 0 ~systemActive~0))} assume !(0 != test_~tmp___0~1#1); {135#(not (= 0 ~systemActive~0))} is VALID [2022-02-21 04:17:58,863 INFO L290 TraceCheckUtils]: 13: Hoare triple {135#(not (= 0 ~systemActive~0))} test_~tmp___2~0#1 := test_#t~nondet32#1;havoc test_#t~nondet32#1; {135#(not (= 0 ~systemActive~0))} is VALID [2022-02-21 04:17:58,863 INFO L290 TraceCheckUtils]: 14: Hoare triple {135#(not (= 0 ~systemActive~0))} assume !(0 != test_~tmp___2~0#1);test_~tmp___1~0#1 := test_#t~nondet33#1;havoc test_#t~nondet33#1; {135#(not (= 0 ~systemActive~0))} is VALID [2022-02-21 04:17:58,864 INFO L290 TraceCheckUtils]: 15: Hoare triple {135#(not (= 0 ~systemActive~0))} assume !(0 != test_~tmp___1~0#1); {135#(not (= 0 ~systemActive~0))} is VALID [2022-02-21 04:17:58,864 INFO L290 TraceCheckUtils]: 16: Hoare triple {135#(not (= 0 ~systemActive~0))} assume { :begin_inline_timeShift } true; {135#(not (= 0 ~systemActive~0))} is VALID [2022-02-21 04:17:58,865 INFO L290 TraceCheckUtils]: 17: Hoare triple {135#(not (= 0 ~systemActive~0))} assume !(0 != ~pumpRunning~0); {135#(not (= 0 ~systemActive~0))} is VALID [2022-02-21 04:17:58,866 INFO L290 TraceCheckUtils]: 18: Hoare triple {135#(not (= 0 ~systemActive~0))} assume !(0 != ~systemActive~0); {131#false} is VALID [2022-02-21 04:17:58,867 INFO L290 TraceCheckUtils]: 19: Hoare triple {131#false} assume { :begin_inline___utac_acc__Specification4_spec__1 } true;havoc __utac_acc__Specification4_spec__1_#t~ret4#1, __utac_acc__Specification4_spec__1_#t~ret5#1, __utac_acc__Specification4_spec__1_~tmp~0#1, __utac_acc__Specification4_spec__1_~tmp___0~0#1;havoc __utac_acc__Specification4_spec__1_~tmp~0#1;havoc __utac_acc__Specification4_spec__1_~tmp___0~0#1;assume { :begin_inline_getWaterLevel } true;havoc getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~10#1;havoc getWaterLevel_~retValue_acc~10#1;getWaterLevel_~retValue_acc~10#1 := ~waterLevel~0;getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~10#1; {131#false} is VALID [2022-02-21 04:17:58,867 INFO L290 TraceCheckUtils]: 20: Hoare triple {131#false} __utac_acc__Specification4_spec__1_#t~ret4#1 := getWaterLevel_#res#1;assume { :end_inline_getWaterLevel } true;__utac_acc__Specification4_spec__1_~tmp~0#1 := __utac_acc__Specification4_spec__1_#t~ret4#1;havoc __utac_acc__Specification4_spec__1_#t~ret4#1; {131#false} is VALID [2022-02-21 04:17:58,867 INFO L290 TraceCheckUtils]: 21: Hoare triple {131#false} assume !(0 == __utac_acc__Specification4_spec__1_~tmp~0#1); {131#false} is VALID [2022-02-21 04:17:58,868 INFO L290 TraceCheckUtils]: 22: Hoare triple {131#false} assume { :end_inline___utac_acc__Specification4_spec__1 } true; {131#false} is VALID [2022-02-21 04:17:58,868 INFO L290 TraceCheckUtils]: 23: Hoare triple {131#false} assume { :end_inline_timeShift } true; {131#false} is VALID [2022-02-21 04:17:58,870 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-21 04:17:58,870 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:17:58,871 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570637835] [2022-02-21 04:17:58,871 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570637835] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:17:58,872 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:17:58,872 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:17:58,872 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811372334] [2022-02-21 04:17:58,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:17:59,023 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:17:59,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 04:17:59,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-21 04:17:59,054 INFO L87 Difference]: Start difference. First operand has 122 states, 121 states have (on average 1.3636363636363635) internal successors, (165), 121 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:17:59,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:17:59,951 INFO L93 Difference]: Finished difference Result 405 states and 521 transitions. [2022-02-21 04:17:59,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 04:17:59,952 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:17:59,991 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:17:59,996 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 405 states and 521 transitions. [2022-02-21 04:18:00,016 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 262 [2022-02-21 04:18:00,033 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 405 states to 365 states and 481 transitions. [2022-02-21 04:18:00,035 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 365 [2022-02-21 04:18:00,035 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 365 [2022-02-21 04:18:00,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 365 states and 481 transitions. [2022-02-21 04:18:00,037 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:18:00,037 INFO L681 BuchiCegarLoop]: Abstraction has 365 states and 481 transitions. [2022-02-21 04:18:00,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states and 481 transitions. [2022-02-21 04:18:00,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 161. [2022-02-21 04:18:00,067 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:18:00,068 INFO L82 GeneralOperation]: Start isEquivalent. First operand 365 states and 481 transitions. Second operand has 161 states, 161 states have (on average 1.3167701863354038) internal successors, (212), 160 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:18:00,069 INFO L74 IsIncluded]: Start isIncluded. First operand 365 states and 481 transitions. Second operand has 161 states, 161 states have (on average 1.3167701863354038) internal successors, (212), 160 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:18:00,071 INFO L87 Difference]: Start difference. First operand 365 states and 481 transitions. Second operand has 161 states, 161 states have (on average 1.3167701863354038) internal successors, (212), 160 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:18:00,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:18:00,087 INFO L93 Difference]: Finished difference Result 365 states and 481 transitions. [2022-02-21 04:18:00,087 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 481 transitions. [2022-02-21 04:18:00,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:18:00,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:18:00,091 INFO L74 IsIncluded]: Start isIncluded. First operand has 161 states, 161 states have (on average 1.3167701863354038) internal successors, (212), 160 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 365 states and 481 transitions. [2022-02-21 04:18:00,091 INFO L87 Difference]: Start difference. First operand has 161 states, 161 states have (on average 1.3167701863354038) internal successors, (212), 160 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 365 states and 481 transitions. [2022-02-21 04:18:00,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:18:00,102 INFO L93 Difference]: Finished difference Result 365 states and 481 transitions. [2022-02-21 04:18:00,102 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 481 transitions. [2022-02-21 04:18:00,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:18:00,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:18:00,104 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:18:00,104 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:18:00,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 161 states have (on average 1.3167701863354038) internal successors, (212), 160 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:18:00,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 212 transitions. [2022-02-21 04:18:00,110 INFO L704 BuchiCegarLoop]: Abstraction has 161 states and 212 transitions. [2022-02-21 04:18:00,110 INFO L587 BuchiCegarLoop]: Abstraction has 161 states and 212 transitions. [2022-02-21 04:18:00,110 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 04:18:00,110 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 161 states and 212 transitions. [2022-02-21 04:18:00,111 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 115 [2022-02-21 04:18:00,111 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:18:00,111 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:18:00,112 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:18:00,112 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:18:00,112 INFO L791 eck$LassoCheckResult]: Stem: 653#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(31, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(30, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(21, 6);call #Ultimate.allocInit(30, 7);call #Ultimate.allocInit(9, 8);call #Ultimate.allocInit(21, 9);call #Ultimate.allocInit(30, 10);call #Ultimate.allocInit(9, 11);call #Ultimate.allocInit(25, 12);call #Ultimate.allocInit(30, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(25, 15);call #Ultimate.allocInit(13, 16);call #Ultimate.allocInit(3, 17);call write~init~int(79, 17, 0, 1);call write~init~int(110, 17, 1, 1);call write~init~int(0, 17, 2, 1);call #Ultimate.allocInit(4, 18);call write~init~int(79, 18, 0, 1);call write~init~int(102, 18, 1, 1);call write~init~int(102, 18, 2, 1);call write~init~int(0, 18, 3, 1);call #Ultimate.allocInit(7, 19);call write~init~int(44, 19, 0, 1);call write~init~int(80, 19, 1, 1);call write~init~int(117, 19, 2, 1);call write~init~int(109, 19, 3, 1);call write~init~int(112, 19, 4, 1);call write~init~int(58, 19, 5, 1);call write~init~int(0, 19, 6, 1);call #Ultimate.allocInit(3, 20);call write~init~int(79, 20, 0, 1);call write~init~int(110, 20, 1, 1);call write~init~int(0, 20, 2, 1);call #Ultimate.allocInit(4, 21);call write~init~int(79, 21, 0, 1);call write~init~int(102, 21, 1, 1);call write~init~int(102, 21, 2, 1);call write~init~int(0, 21, 3, 1);call #Ultimate.allocInit(3, 22);call write~init~int(41, 22, 0, 1);call write~init~int(32, 22, 1, 1);call write~init~int(0, 22, 2, 1);call #Ultimate.allocInit(2, 23);call write~init~int(10, 23, 0, 1);call write~init~int(0, 23, 1, 1);call #Ultimate.allocInit(13, 24);call #Ultimate.allocInit(7, 25);call write~init~int(44, 25, 0, 1);call write~init~int(77, 25, 1, 1);call write~init~int(101, 25, 2, 1);call write~init~int(116, 25, 3, 1);call write~init~int(104, 25, 4, 1);call write~init~int(58, 25, 5, 1);call write~init~int(0, 25, 6, 1);call #Ultimate.allocInit(5, 26);call write~init~int(67, 26, 0, 1);call write~init~int(82, 26, 1, 1);call write~init~int(73, 26, 2, 1);call write~init~int(84, 26, 3, 1);call write~init~int(0, 26, 4, 1);call #Ultimate.allocInit(3, 27);call write~init~int(79, 27, 0, 1);call write~init~int(75, 27, 1, 1);call write~init~int(0, 27, 2, 1);call #Ultimate.allocInit(2, 28);call write~init~int(41, 28, 0, 1);call write~init~int(0, 28, 1, 1);~head~0.base, ~head~0.offset := 0, 0;~pumpRunning~0 := 0;~systemActive~0 := 1;~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0; 589#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret46#1, main_~retValue_acc~8#1, main_~tmp~8#1;havoc main_~retValue_acc~8#1;havoc main_~tmp~8#1;assume { :begin_inline_select_helpers } true; 590#L470 assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; 591#L463 assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~4#1;havoc valid_product_~retValue_acc~4#1;valid_product_~retValue_acc~4#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~4#1; 592#L478 main_#t~ret46#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;main_~tmp~8#1 := main_#t~ret46#1;havoc main_#t~ret46#1; 654#L849 assume 0 != main_~tmp~8#1;assume { :begin_inline_setup } true; 613#L826 assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;havoc test_#t~nondet30#1, test_#t~nondet31#1, test_#t~nondet32#1, test_#t~nondet33#1, test_~splverifierCounter~0#1, test_~tmp~4#1, test_~tmp___0~1#1, test_~tmp___1~0#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~4#1;havoc test_~tmp___0~1#1;havoc test_~tmp___1~0#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0; 561#L499-2 [2022-02-21 04:18:00,113 INFO L793 eck$LassoCheckResult]: Loop: 561#L499-2 assume !false; 617#L500 assume test_~splverifierCounter~0#1 < 4; 609#L501 test_~tmp~4#1 := test_#t~nondet30#1;havoc test_#t~nondet30#1; 604#L509 assume !(0 != test_~tmp~4#1); 546#L509-2 test_~tmp___0~1#1 := test_#t~nondet31#1;havoc test_#t~nondet31#1; 645#L519 assume !(0 != test_~tmp___0~1#1); 623#L519-2 test_~tmp___2~0#1 := test_#t~nondet32#1;havoc test_#t~nondet32#1; 624#L529 assume 0 != test_~tmp___2~0#1;assume { :begin_inline_startSystem } true;~systemActive~0 := 1; 549#L754 assume { :end_inline_startSystem } true; 550#L537-2 assume { :begin_inline_timeShift } true; 650#L572 assume !(0 != ~pumpRunning~0); 566#L572-2 assume 0 != ~systemActive~0;assume { :begin_inline_processEnvironment } true;havoc processEnvironment_#t~ret34#1, processEnvironment_~tmp~5#1;havoc processEnvironment_~tmp~5#1; 571#L604 assume !(0 == ~pumpRunning~0);assume { :begin_inline_processEnvironment__wrappee__base } true; 602#L596-1 assume { :end_inline_processEnvironment__wrappee__base } true; 564#L604-1 assume { :end_inline_processEnvironment } true; 553#L579-1 assume { :begin_inline___utac_acc__Specification4_spec__1 } true;havoc __utac_acc__Specification4_spec__1_#t~ret4#1, __utac_acc__Specification4_spec__1_#t~ret5#1, __utac_acc__Specification4_spec__1_~tmp~0#1, __utac_acc__Specification4_spec__1_~tmp___0~0#1;havoc __utac_acc__Specification4_spec__1_~tmp~0#1;havoc __utac_acc__Specification4_spec__1_~tmp___0~0#1;assume { :begin_inline_getWaterLevel } true;havoc getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~10#1;havoc getWaterLevel_~retValue_acc~10#1;getWaterLevel_~retValue_acc~10#1 := ~waterLevel~0;getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~10#1; 554#L938 __utac_acc__Specification4_spec__1_#t~ret4#1 := getWaterLevel_#res#1;assume { :end_inline_getWaterLevel } true;__utac_acc__Specification4_spec__1_~tmp~0#1 := __utac_acc__Specification4_spec__1_#t~ret4#1;havoc __utac_acc__Specification4_spec__1_#t~ret4#1; 636#L61 assume !(0 == __utac_acc__Specification4_spec__1_~tmp~0#1); 637#L61-1 assume { :end_inline___utac_acc__Specification4_spec__1 } true; 560#L589 assume { :end_inline_timeShift } true; 561#L499-2 [2022-02-21 04:18:00,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:18:00,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1803949509, now seen corresponding path program 2 times [2022-02-21 04:18:00,114 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:18:00,114 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929003766] [2022-02-21 04:18:00,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:18:00,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:18:00,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:18:00,128 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:18:00,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:18:00,140 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:18:00,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:18:00,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1290334515, now seen corresponding path program 1 times [2022-02-21 04:18:00,143 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:18:00,143 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465327896] [2022-02-21 04:18:00,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:18:00,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:18:00,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:18:00,159 INFO L290 TraceCheckUtils]: 0: Hoare triple {1441#true} assume !false; {1441#true} is VALID [2022-02-21 04:18:00,159 INFO L290 TraceCheckUtils]: 1: Hoare triple {1441#true} assume test_~splverifierCounter~0#1 < 4; {1441#true} is VALID [2022-02-21 04:18:00,159 INFO L290 TraceCheckUtils]: 2: Hoare triple {1441#true} test_~tmp~4#1 := test_#t~nondet30#1;havoc test_#t~nondet30#1; {1441#true} is VALID [2022-02-21 04:18:00,160 INFO L290 TraceCheckUtils]: 3: Hoare triple {1441#true} assume !(0 != test_~tmp~4#1); {1441#true} is VALID [2022-02-21 04:18:00,160 INFO L290 TraceCheckUtils]: 4: Hoare triple {1441#true} test_~tmp___0~1#1 := test_#t~nondet31#1;havoc test_#t~nondet31#1; {1441#true} is VALID [2022-02-21 04:18:00,160 INFO L290 TraceCheckUtils]: 5: Hoare triple {1441#true} assume !(0 != test_~tmp___0~1#1); {1441#true} is VALID [2022-02-21 04:18:00,160 INFO L290 TraceCheckUtils]: 6: Hoare triple {1441#true} test_~tmp___2~0#1 := test_#t~nondet32#1;havoc test_#t~nondet32#1; {1441#true} is VALID [2022-02-21 04:18:00,161 INFO L290 TraceCheckUtils]: 7: Hoare triple {1441#true} assume 0 != test_~tmp___2~0#1;assume { :begin_inline_startSystem } true;~systemActive~0 := 1; {1441#true} is VALID [2022-02-21 04:18:00,161 INFO L290 TraceCheckUtils]: 8: Hoare triple {1441#true} assume { :end_inline_startSystem } true; {1441#true} is VALID [2022-02-21 04:18:00,161 INFO L290 TraceCheckUtils]: 9: Hoare triple {1441#true} assume { :begin_inline_timeShift } true; {1441#true} is VALID [2022-02-21 04:18:00,161 INFO L290 TraceCheckUtils]: 10: Hoare triple {1441#true} assume !(0 != ~pumpRunning~0); {1443#(= ~pumpRunning~0 0)} is VALID [2022-02-21 04:18:00,162 INFO L290 TraceCheckUtils]: 11: Hoare triple {1443#(= ~pumpRunning~0 0)} assume 0 != ~systemActive~0;assume { :begin_inline_processEnvironment } true;havoc processEnvironment_#t~ret34#1, processEnvironment_~tmp~5#1;havoc processEnvironment_~tmp~5#1; {1443#(= ~pumpRunning~0 0)} is VALID [2022-02-21 04:18:00,162 INFO L290 TraceCheckUtils]: 12: Hoare triple {1443#(= ~pumpRunning~0 0)} assume !(0 == ~pumpRunning~0);assume { :begin_inline_processEnvironment__wrappee__base } true; {1442#false} is VALID [2022-02-21 04:18:00,163 INFO L290 TraceCheckUtils]: 13: Hoare triple {1442#false} assume { :end_inline_processEnvironment__wrappee__base } true; {1442#false} is VALID [2022-02-21 04:18:00,163 INFO L290 TraceCheckUtils]: 14: Hoare triple {1442#false} assume { :end_inline_processEnvironment } true; {1442#false} is VALID [2022-02-21 04:18:00,163 INFO L290 TraceCheckUtils]: 15: Hoare triple {1442#false} assume { :begin_inline___utac_acc__Specification4_spec__1 } true;havoc __utac_acc__Specification4_spec__1_#t~ret4#1, __utac_acc__Specification4_spec__1_#t~ret5#1, __utac_acc__Specification4_spec__1_~tmp~0#1, __utac_acc__Specification4_spec__1_~tmp___0~0#1;havoc __utac_acc__Specification4_spec__1_~tmp~0#1;havoc __utac_acc__Specification4_spec__1_~tmp___0~0#1;assume { :begin_inline_getWaterLevel } true;havoc getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~10#1;havoc getWaterLevel_~retValue_acc~10#1;getWaterLevel_~retValue_acc~10#1 := ~waterLevel~0;getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~10#1; {1442#false} is VALID [2022-02-21 04:18:00,163 INFO L290 TraceCheckUtils]: 16: Hoare triple {1442#false} __utac_acc__Specification4_spec__1_#t~ret4#1 := getWaterLevel_#res#1;assume { :end_inline_getWaterLevel } true;__utac_acc__Specification4_spec__1_~tmp~0#1 := __utac_acc__Specification4_spec__1_#t~ret4#1;havoc __utac_acc__Specification4_spec__1_#t~ret4#1; {1442#false} is VALID [2022-02-21 04:18:00,164 INFO L290 TraceCheckUtils]: 17: Hoare triple {1442#false} assume !(0 == __utac_acc__Specification4_spec__1_~tmp~0#1); {1442#false} is VALID [2022-02-21 04:18:00,164 INFO L290 TraceCheckUtils]: 18: Hoare triple {1442#false} assume { :end_inline___utac_acc__Specification4_spec__1 } true; {1442#false} is VALID [2022-02-21 04:18:00,164 INFO L290 TraceCheckUtils]: 19: Hoare triple {1442#false} assume { :end_inline_timeShift } true; {1442#false} is VALID [2022-02-21 04:18:00,164 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-21 04:18:00,165 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:18:00,165 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465327896] [2022-02-21 04:18:00,165 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465327896] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:18:00,165 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:18:00,165 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:18:00,166 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677477236] [2022-02-21 04:18:00,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:18:00,166 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:18:00,166 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:18:00,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 04:18:00,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 04:18:00,167 INFO L87 Difference]: Start difference. First operand 161 states and 212 transitions. cyclomatic complexity: 54 Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:18:00,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:18:00,322 INFO L93 Difference]: Finished difference Result 212 states and 267 transitions. [2022-02-21 04:18:00,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 04:18:00,323 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:18:00,341 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:18:00,342 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 212 states and 267 transitions. [2022-02-21 04:18:00,349 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 155 [2022-02-21 04:18:00,353 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 212 states to 212 states and 267 transitions. [2022-02-21 04:18:00,354 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 212 [2022-02-21 04:18:00,354 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 212 [2022-02-21 04:18:00,354 INFO L73 IsDeterministic]: Start isDeterministic. Operand 212 states and 267 transitions. [2022-02-21 04:18:00,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:18:00,357 INFO L681 BuchiCegarLoop]: Abstraction has 212 states and 267 transitions. [2022-02-21 04:18:00,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states and 267 transitions. [2022-02-21 04:18:00,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2022-02-21 04:18:00,374 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:18:00,375 INFO L82 GeneralOperation]: Start isEquivalent. First operand 212 states and 267 transitions. Second operand has 212 states, 212 states have (on average 1.259433962264151) internal successors, (267), 211 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:18:00,375 INFO L74 IsIncluded]: Start isIncluded. First operand 212 states and 267 transitions. Second operand has 212 states, 212 states have (on average 1.259433962264151) internal successors, (267), 211 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:18:00,376 INFO L87 Difference]: Start difference. First operand 212 states and 267 transitions. Second operand has 212 states, 212 states have (on average 1.259433962264151) internal successors, (267), 211 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:18:00,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:18:00,380 INFO L93 Difference]: Finished difference Result 212 states and 267 transitions. [2022-02-21 04:18:00,380 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 267 transitions. [2022-02-21 04:18:00,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:18:00,381 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:18:00,381 INFO L74 IsIncluded]: Start isIncluded. First operand has 212 states, 212 states have (on average 1.259433962264151) internal successors, (267), 211 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 212 states and 267 transitions. [2022-02-21 04:18:00,381 INFO L87 Difference]: Start difference. First operand has 212 states, 212 states have (on average 1.259433962264151) internal successors, (267), 211 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 212 states and 267 transitions. [2022-02-21 04:18:00,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:18:00,389 INFO L93 Difference]: Finished difference Result 212 states and 267 transitions. [2022-02-21 04:18:00,389 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 267 transitions. [2022-02-21 04:18:00,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:18:00,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:18:00,390 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:18:00,390 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:18:00,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 212 states have (on average 1.259433962264151) internal successors, (267), 211 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:18:00,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 267 transitions. [2022-02-21 04:18:00,394 INFO L704 BuchiCegarLoop]: Abstraction has 212 states and 267 transitions. [2022-02-21 04:18:00,394 INFO L587 BuchiCegarLoop]: Abstraction has 212 states and 267 transitions. [2022-02-21 04:18:00,395 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 04:18:00,395 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 212 states and 267 transitions. [2022-02-21 04:18:00,396 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 155 [2022-02-21 04:18:00,396 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:18:00,399 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:18:00,400 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:18:00,401 INFO L843 BuchiCegarLoop]: Counterexample loop 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-21 04:18:00,401 INFO L791 eck$LassoCheckResult]: Stem: 1788#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(31, 2);call #Ultimate.allocInit(12, 3);call #Ultimate.allocInit(30, 4);call #Ultimate.allocInit(9, 5);call #Ultimate.allocInit(21, 6);call #Ultimate.allocInit(30, 7);call #Ultimate.allocInit(9, 8);call #Ultimate.allocInit(21, 9);call #Ultimate.allocInit(30, 10);call #Ultimate.allocInit(9, 11);call #Ultimate.allocInit(25, 12);call #Ultimate.allocInit(30, 13);call #Ultimate.allocInit(9, 14);call #Ultimate.allocInit(25, 15);call #Ultimate.allocInit(13, 16);call #Ultimate.allocInit(3, 17);call write~init~int(79, 17, 0, 1);call write~init~int(110, 17, 1, 1);call write~init~int(0, 17, 2, 1);call #Ultimate.allocInit(4, 18);call write~init~int(79, 18, 0, 1);call write~init~int(102, 18, 1, 1);call write~init~int(102, 18, 2, 1);call write~init~int(0, 18, 3, 1);call #Ultimate.allocInit(7, 19);call write~init~int(44, 19, 0, 1);call write~init~int(80, 19, 1, 1);call write~init~int(117, 19, 2, 1);call write~init~int(109, 19, 3, 1);call write~init~int(112, 19, 4, 1);call write~init~int(58, 19, 5, 1);call write~init~int(0, 19, 6, 1);call #Ultimate.allocInit(3, 20);call write~init~int(79, 20, 0, 1);call write~init~int(110, 20, 1, 1);call write~init~int(0, 20, 2, 1);call #Ultimate.allocInit(4, 21);call write~init~int(79, 21, 0, 1);call write~init~int(102, 21, 1, 1);call write~init~int(102, 21, 2, 1);call write~init~int(0, 21, 3, 1);call #Ultimate.allocInit(3, 22);call write~init~int(41, 22, 0, 1);call write~init~int(32, 22, 1, 1);call write~init~int(0, 22, 2, 1);call #Ultimate.allocInit(2, 23);call write~init~int(10, 23, 0, 1);call write~init~int(0, 23, 1, 1);call #Ultimate.allocInit(13, 24);call #Ultimate.allocInit(7, 25);call write~init~int(44, 25, 0, 1);call write~init~int(77, 25, 1, 1);call write~init~int(101, 25, 2, 1);call write~init~int(116, 25, 3, 1);call write~init~int(104, 25, 4, 1);call write~init~int(58, 25, 5, 1);call write~init~int(0, 25, 6, 1);call #Ultimate.allocInit(5, 26);call write~init~int(67, 26, 0, 1);call write~init~int(82, 26, 1, 1);call write~init~int(73, 26, 2, 1);call write~init~int(84, 26, 3, 1);call write~init~int(0, 26, 4, 1);call #Ultimate.allocInit(3, 27);call write~init~int(79, 27, 0, 1);call write~init~int(75, 27, 1, 1);call write~init~int(0, 27, 2, 1);call #Ultimate.allocInit(2, 28);call write~init~int(41, 28, 0, 1);call write~init~int(0, 28, 1, 1);~head~0.base, ~head~0.offset := 0, 0;~pumpRunning~0 := 0;~systemActive~0 := 1;~cleanupTimeShifts~0 := 4;~waterLevel~0 := 1;~methaneLevelCritical~0 := 0; 1703#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret46#1, main_~retValue_acc~8#1, main_~tmp~8#1;havoc main_~retValue_acc~8#1;havoc main_~tmp~8#1;assume { :begin_inline_select_helpers } true; 1704#L470 assume { :end_inline_select_helpers } true;assume { :begin_inline_select_features } true; 1705#L463 assume { :end_inline_select_features } true;assume { :begin_inline_valid_product } true;havoc valid_product_#res#1;havoc valid_product_~retValue_acc~4#1;havoc valid_product_~retValue_acc~4#1;valid_product_~retValue_acc~4#1 := 1;valid_product_#res#1 := valid_product_~retValue_acc~4#1; 1706#L478 main_#t~ret46#1 := valid_product_#res#1;assume { :end_inline_valid_product } true;main_~tmp~8#1 := main_#t~ret46#1;havoc main_#t~ret46#1; 1790#L849 assume 0 != main_~tmp~8#1;assume { :begin_inline_setup } true; 1729#L826 assume { :end_inline_setup } true;assume { :begin_inline_runTest } true;assume { :begin_inline_test } true;havoc test_#t~nondet30#1, test_#t~nondet31#1, test_#t~nondet32#1, test_#t~nondet33#1, test_~splverifierCounter~0#1, test_~tmp~4#1, test_~tmp___0~1#1, test_~tmp___1~0#1, test_~tmp___2~0#1;havoc test_~splverifierCounter~0#1;havoc test_~tmp~4#1;havoc test_~tmp___0~1#1;havoc test_~tmp___1~0#1;havoc test_~tmp___2~0#1;test_~splverifierCounter~0#1 := 0; 1730#L499-2 [2022-02-21 04:18:00,402 INFO L793 eck$LassoCheckResult]: Loop: 1730#L499-2 assume !false; 1854#L500 assume test_~splverifierCounter~0#1 < 4; 1855#L501 test_~tmp~4#1 := test_#t~nondet30#1;havoc test_#t~nondet30#1; 1718#L509 assume !(0 != test_~tmp~4#1); 1657#L509-2 test_~tmp___0~1#1 := test_#t~nondet31#1;havoc test_#t~nondet31#1; 1763#L519 assume !(0 != test_~tmp___0~1#1); 1862#L519-2 test_~tmp___2~0#1 := test_#t~nondet32#1;havoc test_#t~nondet32#1; 1771#L529 assume !(0 != test_~tmp___2~0#1);test_~tmp___1~0#1 := test_#t~nondet33#1;havoc test_#t~nondet33#1; 1772#L537 assume !(0 != test_~tmp___1~0#1); 1661#L537-2 assume { :begin_inline_timeShift } true; 1776#L572 assume !(0 != ~pumpRunning~0); 1682#L572-2 assume 0 != ~systemActive~0;assume { :begin_inline_processEnvironment } true;havoc processEnvironment_#t~ret34#1, processEnvironment_~tmp~5#1;havoc processEnvironment_~tmp~5#1; 1683#L604 assume 0 == ~pumpRunning~0;assume { :begin_inline_isHighWaterLevel } true;havoc isHighWaterLevel_#res#1;havoc isHighWaterLevel_#t~ret45#1, isHighWaterLevel_~retValue_acc~7#1, isHighWaterLevel_~tmp~7#1, isHighWaterLevel_~tmp___0~2#1;havoc isHighWaterLevel_~retValue_acc~7#1;havoc isHighWaterLevel_~tmp~7#1;havoc isHighWaterLevel_~tmp___0~2#1;assume { :begin_inline_isHighWaterSensorDry } true;havoc isHighWaterSensorDry_#res#1;havoc isHighWaterSensorDry_~retValue_acc~11#1;havoc isHighWaterSensorDry_~retValue_acc~11#1; 1717#L946 assume ~waterLevel~0 < 2;isHighWaterSensorDry_~retValue_acc~11#1 := 1;isHighWaterSensorDry_#res#1 := isHighWaterSensorDry_~retValue_acc~11#1; 1698#L951 isHighWaterLevel_#t~ret45#1 := isHighWaterSensorDry_#res#1;assume { :end_inline_isHighWaterSensorDry } true;isHighWaterLevel_~tmp~7#1 := isHighWaterLevel_#t~ret45#1;havoc isHighWaterLevel_#t~ret45#1; 1684#L724 assume 0 != isHighWaterLevel_~tmp~7#1;isHighWaterLevel_~tmp___0~2#1 := 0; 1670#L724-2 isHighWaterLevel_~retValue_acc~7#1 := isHighWaterLevel_~tmp___0~2#1;isHighWaterLevel_#res#1 := isHighWaterLevel_~retValue_acc~7#1; 1671#L730 processEnvironment_#t~ret34#1 := isHighWaterLevel_#res#1;assume { :end_inline_isHighWaterLevel } true;processEnvironment_~tmp~5#1 := processEnvironment_#t~ret34#1;havoc processEnvironment_#t~ret34#1; 1739#L608 assume !(0 != processEnvironment_~tmp~5#1);assume { :begin_inline_processEnvironment__wrappee__base } true; 1714#L596 assume { :end_inline_processEnvironment__wrappee__base } true; 1674#L604-1 assume { :end_inline_processEnvironment } true; 1675#L579-1 assume { :begin_inline___utac_acc__Specification4_spec__1 } true;havoc __utac_acc__Specification4_spec__1_#t~ret4#1, __utac_acc__Specification4_spec__1_#t~ret5#1, __utac_acc__Specification4_spec__1_~tmp~0#1, __utac_acc__Specification4_spec__1_~tmp___0~0#1;havoc __utac_acc__Specification4_spec__1_~tmp~0#1;havoc __utac_acc__Specification4_spec__1_~tmp___0~0#1;assume { :begin_inline_getWaterLevel } true;havoc getWaterLevel_#res#1;havoc getWaterLevel_~retValue_acc~10#1;havoc getWaterLevel_~retValue_acc~10#1;getWaterLevel_~retValue_acc~10#1 := ~waterLevel~0;getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~10#1; 1861#L938 __utac_acc__Specification4_spec__1_#t~ret4#1 := getWaterLevel_#res#1;assume { :end_inline_getWaterLevel } true;__utac_acc__Specification4_spec__1_~tmp~0#1 := __utac_acc__Specification4_spec__1_#t~ret4#1;havoc __utac_acc__Specification4_spec__1_#t~ret4#1; 1859#L61 assume !(0 == __utac_acc__Specification4_spec__1_~tmp~0#1); 1857#L61-1 assume { :end_inline___utac_acc__Specification4_spec__1 } true; 1856#L589 assume { :end_inline_timeShift } true; 1730#L499-2 [2022-02-21 04:18:00,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:18:00,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1803949509, now seen corresponding path program 3 times [2022-02-21 04:18:00,403 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:18:00,404 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939830152] [2022-02-21 04:18:00,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:18:00,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:18:00,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:18:00,430 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:18:00,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:18:00,446 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:18:00,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:18:00,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1808938509, now seen corresponding path program 1 times [2022-02-21 04:18:00,446 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:18:00,447 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470580360] [2022-02-21 04:18:00,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:18:00,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:18:00,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:18:00,461 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:18:00,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:18:00,468 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:18:00,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:18:00,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1682497233, now seen corresponding path program 1 times [2022-02-21 04:18:00,469 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:18:00,469 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983342450] [2022-02-21 04:18:00,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:18:00,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:18:00,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:18:00,481 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:18:00,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:18:00,511 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:18:03,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 04:18:03 BoogieIcfgContainer [2022-02-21 04:18:03,311 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 04:18:03,312 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 04:18:03,312 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 04:18:03,312 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 04:18:03,313 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:17:58" (3/4) ... [2022-02-21 04:18:03,315 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2022-02-21 04:18:03,362 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-21 04:18:03,363 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 04:18:03,364 INFO L158 Benchmark]: Toolchain (without parser) took 6247.31ms. Allocated memory was 98.6MB in the beginning and 148.9MB in the end (delta: 50.3MB). Free memory was 65.9MB in the beginning and 52.8MB in the end (delta: 13.1MB). Peak memory consumption was 61.9MB. Max. memory is 16.1GB. [2022-02-21 04:18:03,364 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 98.6MB. Free memory was 53.9MB in the beginning and 53.8MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:18:03,367 INFO L158 Benchmark]: CACSL2BoogieTranslator took 486.57ms. Allocated memory was 98.6MB in the beginning and 123.7MB in the end (delta: 25.2MB). Free memory was 65.9MB in the beginning and 86.6MB in the end (delta: -20.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 04:18:03,368 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.52ms. Allocated memory is still 123.7MB. Free memory was 86.6MB in the beginning and 83.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-21 04:18:03,368 INFO L158 Benchmark]: Boogie Preprocessor took 41.73ms. Allocated memory is still 123.7MB. Free memory was 83.0MB in the beginning and 81.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:18:03,368 INFO L158 Benchmark]: RCFGBuilder took 481.92ms. Allocated memory is still 123.7MB. Free memory was 80.9MB in the beginning and 59.4MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-02-21 04:18:03,369 INFO L158 Benchmark]: BuchiAutomizer took 5100.62ms. Allocated memory was 123.7MB in the beginning and 148.9MB in the end (delta: 25.2MB). Free memory was 59.4MB in the beginning and 54.9MB in the end (delta: 4.4MB). Peak memory consumption was 51.3MB. Max. memory is 16.1GB. [2022-02-21 04:18:03,369 INFO L158 Benchmark]: Witness Printer took 50.60ms. Allocated memory is still 148.9MB. Free memory was 54.9MB in the beginning and 52.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:18:03,371 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 98.6MB. Free memory was 53.9MB in the beginning and 53.8MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 486.57ms. Allocated memory was 98.6MB in the beginning and 123.7MB in the end (delta: 25.2MB). Free memory was 65.9MB in the beginning and 86.6MB in the end (delta: -20.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.52ms. Allocated memory is still 123.7MB. Free memory was 86.6MB in the beginning and 83.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.73ms. Allocated memory is still 123.7MB. Free memory was 83.0MB in the beginning and 81.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 481.92ms. Allocated memory is still 123.7MB. Free memory was 80.9MB in the beginning and 59.4MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * BuchiAutomizer took 5100.62ms. Allocated memory was 123.7MB in the beginning and 148.9MB in the end (delta: 25.2MB). Free memory was 59.4MB in the beginning and 54.9MB in the end (delta: 4.4MB). Peak memory consumption was 51.3MB. Max. memory is 16.1GB. * Witness Printer took 50.60ms. Allocated memory is still 148.9MB. Free memory was 54.9MB in the beginning and 52.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (2 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.2 modules have a trivial ranking function, the largest among these consists of 6 locations. The remainder module has 212 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.0s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 3.5s. Construction of modules took 0.0s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 0. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 204 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 212 states and ocurred in iteration 2. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 817 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 817 mSDsluCounter, 1355 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1063 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 74 IncrementalHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 292 mSDtfsCounter, 74 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 499]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1} State at position 1 is {splverifierCounter=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@42359e39=0, NULL=0, head=0, tmp___0=0, pumpRunning=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4f429763=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3bc60ba1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@35ffa8ea=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@22ca1dca=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@786ea71e=0, NULL=1, tmp___0=0, tmp___0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@12377210=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@8f1588e=0, methaneLevelCritical=0, retValue_acc=1, retValue_acc=1, \result=1, tmp=1, retValue_acc=0, \result=1, retValue_acc=1, tmp=1, tmp=1, tmp___2=0, cleanupTimeShifts=4, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1aa49656=0, \result=0, tmp=0, head=0, \result=1, tmp___1=0, retValue_acc=0, NULL=0, waterLevel=1, systemActive=1, tmp=0, \result=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 499]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L248] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L565] int pumpRunning = 0; [L566] int systemActive = 1; [L767] int cleanupTimeShifts = 4; [L863] int waterLevel = 1; [L864] int methaneLevelCritical = 0; [L840] int retValue_acc ; [L841] int tmp ; [L845] FCALL select_helpers() [L846] FCALL select_features() [L847] CALL, EXPR valid_product() [L474] int retValue_acc ; [L477] retValue_acc = 1 [L478] return (retValue_acc); [L847] RET, EXPR valid_product() [L847] tmp = valid_product() [L849] COND TRUE \read(tmp) [L851] FCALL setup() [L852] CALL runTest() [L834] CALL test() [L490] int splverifierCounter ; [L491] int tmp ; [L492] int tmp___0 ; [L493] int tmp___1 ; [L494] int tmp___2 ; [L497] splverifierCounter = 0 Loop: [L499] COND TRUE 1 [L501] COND TRUE splverifierCounter < 4 [L507] tmp = __VERIFIER_nondet_int() [L509] COND FALSE !(\read(tmp)) [L517] tmp___0 = __VERIFIER_nondet_int() [L519] COND FALSE !(\read(tmp___0)) [L527] tmp___2 = __VERIFIER_nondet_int() [L529] COND FALSE !(\read(tmp___2)) [L535] tmp___1 = __VERIFIER_nondet_int() [L537] COND FALSE !(\read(tmp___1)) [L546] CALL timeShift() [L572] COND FALSE !(\read(pumpRunning)) [L579] COND TRUE \read(systemActive) [L581] CALL processEnvironment() [L601] int tmp ; [L604] COND TRUE ! pumpRunning [L606] CALL, EXPR isHighWaterLevel() [L716] int retValue_acc ; [L717] int tmp ; [L718] int tmp___0 ; [L722] CALL, EXPR isHighWaterSensorDry() [L943] int retValue_acc ; [L946] COND TRUE waterLevel < 2 [L947] retValue_acc = 1 [L948] return (retValue_acc); [L722] RET, EXPR isHighWaterSensorDry() [L722] tmp = isHighWaterSensorDry() [L724] COND TRUE \read(tmp) [L725] tmp___0 = 0 [L729] retValue_acc = tmp___0 [L730] return (retValue_acc); [L606] RET, EXPR isHighWaterLevel() [L606] tmp = isHighWaterLevel() [L608] COND FALSE !(\read(tmp)) [L614] FCALL processEnvironment__wrappee__base() [L581] RET processEnvironment() [L587] CALL __utac_acc__Specification4_spec__1() [L54] int tmp ; [L55] int tmp___0 ; [L59] CALL, EXPR getWaterLevel() [L934] int retValue_acc ; [L937] retValue_acc = waterLevel [L938] return (retValue_acc); [L59] RET, EXPR getWaterLevel() [L59] tmp = getWaterLevel() [L61] COND FALSE !(tmp == 0) [L587] RET __utac_acc__Specification4_spec__1() [L546] RET timeShift() End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2022-02-21 04:18:03,409 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)