./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec1_product55.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/product-lines/minepump_spec1_product55.cil.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! call(reach_error())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '087203bb0b91dea113f8c68390dfc2d05a2771becdd7fa7a30895c447c478d7f'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/minepump_spec1_product55.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 087203bb0b91dea113f8c68390dfc2d05a2771becdd7fa7a30895c447c478d7f --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 23:42:31,649 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 23:42:31,747 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-06 23:42:31,754 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 23:42:31,754 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 23:42:31,777 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 23:42:31,778 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 23:42:31,778 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 23:42:31,778 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 23:42:31,778 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 23:42:31,778 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 23:42:31,778 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 23:42:31,778 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 23:42:31,778 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 23:42:31,779 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 23:42:31,779 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 23:42:31,779 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 23:42:31,779 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 23:42:31,779 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 23:42:31,779 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 23:42:31,781 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 23:42:31,782 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 23:42:31,783 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 23:42:31,783 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 23:42:31,783 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 23:42:31,783 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 23:42:31,783 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 23:42:31,783 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 23:42:31,783 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 23:42:31,783 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 23:42:31,784 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 23:42:31,784 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 23:42:31,784 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 23:42:31,784 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 23:42:31,785 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 23:42:31,785 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 23:42:31,785 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 23:42:31,785 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 23:42:31,785 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 23:42:31,786 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 23:42:31,786 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 23:42:31,786 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 23:42:31,786 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 087203bb0b91dea113f8c68390dfc2d05a2771becdd7fa7a30895c447c478d7f [2024-11-06 23:42:32,106 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 23:42:32,113 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 23:42:32,115 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 23:42:32,117 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 23:42:32,117 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 23:42:32,119 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec1_product55.cil.c [2024-11-06 23:42:33,375 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 23:42:33,684 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 23:42:33,687 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product55.cil.c [2024-11-06 23:42:33,705 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/be7e389f0/4151d40a7dd14380835796909b0ed76b/FLAGd7d4b7b36 [2024-11-06 23:42:33,723 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/be7e389f0/4151d40a7dd14380835796909b0ed76b [2024-11-06 23:42:33,725 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 23:42:33,727 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 23:42:33,729 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 23:42:33,729 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 23:42:33,733 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 23:42:33,733 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:42:33" (1/1) ... [2024-11-06 23:42:33,734 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f541f8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:42:33, skipping insertion in model container [2024-11-06 23:42:33,734 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:42:33" (1/1) ... [2024-11-06 23:42:33,773 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 23:42:33,951 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product55.cil.c[7923,7936] [2024-11-06 23:42:34,001 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 23:42:34,009 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 23:42:34,017 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [49] [2024-11-06 23:42:34,018 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [87] [2024-11-06 23:42:34,018 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [159] [2024-11-06 23:42:34,018 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [407] [2024-11-06 23:42:34,018 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [511] [2024-11-06 23:42:34,018 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [520] [2024-11-06 23:42:34,018 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification1_spec.i","") [616] [2024-11-06 23:42:34,019 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [642] [2024-11-06 23:42:34,045 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product55.cil.c[7923,7936] [2024-11-06 23:42:34,087 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 23:42:34,104 INFO L204 MainTranslator]: Completed translation [2024-11-06 23:42:34,105 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:42:34 WrapperNode [2024-11-06 23:42:34,106 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 23:42:34,107 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 23:42:34,107 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 23:42:34,107 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 23:42:34,112 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:42:34" (1/1) ... [2024-11-06 23:42:34,123 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:42:34" (1/1) ... [2024-11-06 23:42:34,147 INFO L138 Inliner]: procedures = 57, calls = 104, calls flagged for inlining = 23, calls inlined = 20, statements flattened = 221 [2024-11-06 23:42:34,148 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 23:42:34,148 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 23:42:34,148 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 23:42:34,149 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 23:42:34,156 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:42:34" (1/1) ... [2024-11-06 23:42:34,156 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:42:34" (1/1) ... [2024-11-06 23:42:34,158 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:42:34" (1/1) ... [2024-11-06 23:42:34,170 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-06 23:42:34,170 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:42:34" (1/1) ... [2024-11-06 23:42:34,170 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:42:34" (1/1) ... [2024-11-06 23:42:34,175 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:42:34" (1/1) ... [2024-11-06 23:42:34,178 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:42:34" (1/1) ... [2024-11-06 23:42:34,179 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:42:34" (1/1) ... [2024-11-06 23:42:34,180 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:42:34" (1/1) ... [2024-11-06 23:42:34,182 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 23:42:34,186 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 23:42:34,187 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 23:42:34,187 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 23:42:34,187 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:42:34" (1/1) ... [2024-11-06 23:42:34,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 23:42:34,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 23:42:34,217 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-06 23:42:34,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-06 23:42:34,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 23:42:34,240 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-11-06 23:42:34,240 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-11-06 23:42:34,240 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2024-11-06 23:42:34,240 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2024-11-06 23:42:34,240 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-11-06 23:42:34,240 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-11-06 23:42:34,240 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-11-06 23:42:34,240 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-11-06 23:42:34,240 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2024-11-06 23:42:34,240 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2024-11-06 23:42:34,241 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-11-06 23:42:34,241 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-11-06 23:42:34,241 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__lowWaterSensor [2024-11-06 23:42:34,241 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__lowWaterSensor [2024-11-06 23:42:34,241 INFO L130 BoogieDeclarations]: Found specification of procedure deactivatePump [2024-11-06 23:42:34,241 INFO L138 BoogieDeclarations]: Found implementation of procedure deactivatePump [2024-11-06 23:42:34,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 23:42:34,241 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-11-06 23:42:34,241 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-11-06 23:42:34,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 23:42:34,241 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 23:42:34,315 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 23:42:34,319 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 23:42:34,528 INFO L? ?]: Removed 49 outVars from TransFormulas that were not future-live. [2024-11-06 23:42:34,528 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 23:42:34,536 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 23:42:34,536 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-06 23:42:34,536 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:42:34 BoogieIcfgContainer [2024-11-06 23:42:34,536 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 23:42:34,538 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 23:42:34,538 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 23:42:34,542 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 23:42:34,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 11:42:33" (1/3) ... [2024-11-06 23:42:34,543 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@153709fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:42:34, skipping insertion in model container [2024-11-06 23:42:34,543 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:42:34" (2/3) ... [2024-11-06 23:42:34,543 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@153709fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:42:34, skipping insertion in model container [2024-11-06 23:42:34,543 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:42:34" (3/3) ... [2024-11-06 23:42:34,544 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product55.cil.c [2024-11-06 23:42:34,553 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 23:42:34,553 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 23:42:34,591 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 23:42:34,610 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@28b83d24, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 23:42:34,610 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 23:42:34,615 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 76 states have (on average 1.381578947368421) internal successors, (105), 87 states have internal predecessors, (105), 17 states have call successors, (17), 9 states have call predecessors, (17), 9 states have return successors, (17), 12 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-06 23:42:34,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-06 23:42:34,622 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:42:34,623 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:42:34,623 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:42:34,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:42:34,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1474419874, now seen corresponding path program 1 times [2024-11-06 23:42:34,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:42:34,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133489993] [2024-11-06 23:42:34,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:42:34,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:42:34,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:42:34,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-06 23:42:34,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:42:34,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 23:42:34,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:42:34,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133489993] [2024-11-06 23:42:34,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133489993] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:42:34,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:42:34,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 23:42:34,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539470278] [2024-11-06 23:42:34,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:42:34,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-06 23:42:34,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:42:34,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-06 23:42:34,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-06 23:42:34,835 INFO L87 Difference]: Start difference. First operand has 104 states, 76 states have (on average 1.381578947368421) internal successors, (105), 87 states have internal predecessors, (105), 17 states have call successors, (17), 9 states have call predecessors, (17), 9 states have return successors, (17), 12 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 23:42:34,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:42:34,866 INFO L93 Difference]: Finished difference Result 200 states and 273 transitions. [2024-11-06 23:42:34,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-06 23:42:34,868 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-11-06 23:42:34,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:42:34,876 INFO L225 Difference]: With dead ends: 200 [2024-11-06 23:42:34,876 INFO L226 Difference]: Without dead ends: 95 [2024-11-06 23:42:34,881 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-06 23:42:34,885 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 23:42:34,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 23:42:34,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-06 23:42:34,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-06 23:42:34,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 69 states have (on average 1.318840579710145) internal successors, (91), 79 states have internal predecessors, (91), 17 states have call successors, (17), 9 states have call predecessors, (17), 8 states have return successors, (16), 11 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-06 23:42:34,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 124 transitions. [2024-11-06 23:42:34,938 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 124 transitions. Word has length 23 [2024-11-06 23:42:34,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:42:34,940 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 124 transitions. [2024-11-06 23:42:34,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 23:42:34,941 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 124 transitions. [2024-11-06 23:42:34,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-06 23:42:34,945 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:42:34,945 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:42:34,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 23:42:34,945 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:42:34,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:42:34,948 INFO L85 PathProgramCache]: Analyzing trace with hash -276966886, now seen corresponding path program 1 times [2024-11-06 23:42:34,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:42:34,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206594410] [2024-11-06 23:42:34,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:42:34,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:42:34,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:42:35,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-06 23:42:35,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:42:35,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 23:42:35,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:42:35,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206594410] [2024-11-06 23:42:35,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206594410] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:42:35,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:42:35,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 23:42:35,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583841595] [2024-11-06 23:42:35,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:42:35,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 23:42:35,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:42:35,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 23:42:35,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 23:42:35,100 INFO L87 Difference]: Start difference. First operand 95 states and 124 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 23:42:35,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:42:35,130 INFO L93 Difference]: Finished difference Result 152 states and 198 transitions. [2024-11-06 23:42:35,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 23:42:35,131 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2024-11-06 23:42:35,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:42:35,132 INFO L225 Difference]: With dead ends: 152 [2024-11-06 23:42:35,132 INFO L226 Difference]: Without dead ends: 86 [2024-11-06 23:42:35,132 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 23:42:35,133 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 16 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 23:42:35,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 201 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 23:42:35,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-06 23:42:35,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-06 23:42:35,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 63 states have (on average 1.3333333333333333) internal successors, (84), 73 states have internal predecessors, (84), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (14), 9 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-06 23:42:35,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 112 transitions. [2024-11-06 23:42:35,144 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 112 transitions. Word has length 24 [2024-11-06 23:42:35,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:42:35,146 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 112 transitions. [2024-11-06 23:42:35,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 23:42:35,147 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 112 transitions. [2024-11-06 23:42:35,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-06 23:42:35,148 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:42:35,148 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:42:35,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 23:42:35,148 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:42:35,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:42:35,149 INFO L85 PathProgramCache]: Analyzing trace with hash -716658634, now seen corresponding path program 1 times [2024-11-06 23:42:35,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:42:35,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078980777] [2024-11-06 23:42:35,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:42:35,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:42:35,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:42:35,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-06 23:42:35,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:42:35,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 23:42:35,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:42:35,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078980777] [2024-11-06 23:42:35,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078980777] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:42:35,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:42:35,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 23:42:35,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863577234] [2024-11-06 23:42:35,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:42:35,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 23:42:35,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:42:35,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 23:42:35,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 23:42:35,272 INFO L87 Difference]: Start difference. First operand 86 states and 112 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 23:42:35,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:42:35,323 INFO L93 Difference]: Finished difference Result 243 states and 322 transitions. [2024-11-06 23:42:35,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 23:42:35,324 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2024-11-06 23:42:35,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:42:35,326 INFO L225 Difference]: With dead ends: 243 [2024-11-06 23:42:35,326 INFO L226 Difference]: Without dead ends: 164 [2024-11-06 23:42:35,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 23:42:35,332 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 92 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 23:42:35,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 228 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 23:42:35,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-06 23:42:35,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 161. [2024-11-06 23:42:35,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 116 states have (on average 1.353448275862069) internal successors, (157), 135 states have internal predecessors, (157), 28 states have call successors, (28), 16 states have call predecessors, (28), 16 states have return successors, (28), 17 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-06 23:42:35,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 213 transitions. [2024-11-06 23:42:35,353 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 213 transitions. Word has length 28 [2024-11-06 23:42:35,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:42:35,354 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 213 transitions. [2024-11-06 23:42:35,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 23:42:35,354 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 213 transitions. [2024-11-06 23:42:35,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-06 23:42:35,355 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:42:35,356 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:42:35,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-06 23:42:35,356 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:42:35,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:42:35,356 INFO L85 PathProgramCache]: Analyzing trace with hash -865686932, now seen corresponding path program 1 times [2024-11-06 23:42:35,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:42:35,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425409752] [2024-11-06 23:42:35,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:42:35,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:42:35,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:42:35,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-06 23:42:35,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:42:35,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 23:42:35,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:42:35,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425409752] [2024-11-06 23:42:35,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425409752] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:42:35,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:42:35,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-06 23:42:35,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053108847] [2024-11-06 23:42:35,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:42:35,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 23:42:35,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:42:35,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 23:42:35,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 23:42:35,531 INFO L87 Difference]: Start difference. First operand 161 states and 213 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 23:42:35,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:42:35,651 INFO L93 Difference]: Finished difference Result 405 states and 552 transitions. [2024-11-06 23:42:35,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 23:42:35,651 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2024-11-06 23:42:35,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:42:35,655 INFO L225 Difference]: With dead ends: 405 [2024-11-06 23:42:35,658 INFO L226 Difference]: Without dead ends: 251 [2024-11-06 23:42:35,660 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-06 23:42:35,661 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 55 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 23:42:35,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 401 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 23:42:35,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-11-06 23:42:35,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 250. [2024-11-06 23:42:35,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 183 states have (on average 1.3060109289617485) internal successors, (239), 200 states have internal predecessors, (239), 36 states have call successors, (36), 30 states have call predecessors, (36), 30 states have return successors, (48), 31 states have call predecessors, (48), 36 states have call successors, (48) [2024-11-06 23:42:35,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 323 transitions. [2024-11-06 23:42:35,698 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 323 transitions. Word has length 32 [2024-11-06 23:42:35,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:42:35,698 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 323 transitions. [2024-11-06 23:42:35,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 23:42:35,699 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 323 transitions. [2024-11-06 23:42:35,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-06 23:42:35,700 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:42:35,700 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:42:35,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-06 23:42:35,701 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:42:35,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:42:35,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1317735366, now seen corresponding path program 1 times [2024-11-06 23:42:35,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:42:35,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376646170] [2024-11-06 23:42:35,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:42:35,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:42:35,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:42:35,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-06 23:42:35,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:42:35,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 23:42:35,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:42:35,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-06 23:42:35,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:42:35,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 23:42:35,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:42:35,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376646170] [2024-11-06 23:42:35,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376646170] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:42:35,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:42:35,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 23:42:35,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125496116] [2024-11-06 23:42:35,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:42:35,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 23:42:35,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:42:35,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 23:42:35,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 23:42:35,902 INFO L87 Difference]: Start difference. First operand 250 states and 323 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-06 23:42:36,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:42:36,126 INFO L93 Difference]: Finished difference Result 553 states and 722 transitions. [2024-11-06 23:42:36,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 23:42:36,127 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 47 [2024-11-06 23:42:36,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:42:36,129 INFO L225 Difference]: With dead ends: 553 [2024-11-06 23:42:36,129 INFO L226 Difference]: Without dead ends: 310 [2024-11-06 23:42:36,129 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-06 23:42:36,130 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 59 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-06 23:42:36,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 386 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-06 23:42:36,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2024-11-06 23:42:36,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 308. [2024-11-06 23:42:36,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 227 states have (on average 1.2731277533039647) internal successors, (289), 244 states have internal predecessors, (289), 40 states have call successors, (40), 30 states have call predecessors, (40), 40 states have return successors, (62), 43 states have call predecessors, (62), 40 states have call successors, (62) [2024-11-06 23:42:36,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 391 transitions. [2024-11-06 23:42:36,170 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 391 transitions. Word has length 47 [2024-11-06 23:42:36,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:42:36,171 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 391 transitions. [2024-11-06 23:42:36,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-06 23:42:36,171 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 391 transitions. [2024-11-06 23:42:36,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-06 23:42:36,177 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:42:36,177 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:42:36,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-06 23:42:36,177 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:42:36,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:42:36,178 INFO L85 PathProgramCache]: Analyzing trace with hash 500086916, now seen corresponding path program 1 times [2024-11-06 23:42:36,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:42:36,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114416970] [2024-11-06 23:42:36,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:42:36,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:42:36,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:42:36,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-06 23:42:36,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:42:36,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 23:42:36,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:42:36,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-06 23:42:36,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:42:36,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 23:42:36,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:42:36,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114416970] [2024-11-06 23:42:36,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114416970] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:42:36,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:42:36,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-06 23:42:36,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524543509] [2024-11-06 23:42:36,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:42:36,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 23:42:36,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:42:36,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 23:42:36,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 23:42:36,322 INFO L87 Difference]: Start difference. First operand 308 states and 391 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-06 23:42:36,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:42:36,506 INFO L93 Difference]: Finished difference Result 615 states and 806 transitions. [2024-11-06 23:42:36,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 23:42:36,507 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 47 [2024-11-06 23:42:36,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:42:36,513 INFO L225 Difference]: With dead ends: 615 [2024-11-06 23:42:36,514 INFO L226 Difference]: Without dead ends: 314 [2024-11-06 23:42:36,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-06 23:42:36,516 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 58 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 23:42:36,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 301 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 23:42:36,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2024-11-06 23:42:36,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 312. [2024-11-06 23:42:36,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 231 states have (on average 1.2683982683982684) internal successors, (293), 248 states have internal predecessors, (293), 40 states have call successors, (40), 30 states have call predecessors, (40), 40 states have return successors, (62), 43 states have call predecessors, (62), 40 states have call successors, (62) [2024-11-06 23:42:36,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 395 transitions. [2024-11-06 23:42:36,569 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 395 transitions. Word has length 47 [2024-11-06 23:42:36,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:42:36,569 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 395 transitions. [2024-11-06 23:42:36,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-06 23:42:36,570 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 395 transitions. [2024-11-06 23:42:36,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-06 23:42:36,571 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:42:36,571 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:42:36,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-06 23:42:36,572 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:42:36,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:42:36,573 INFO L85 PathProgramCache]: Analyzing trace with hash 718941634, now seen corresponding path program 1 times [2024-11-06 23:42:36,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:42:36,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801769916] [2024-11-06 23:42:36,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:42:36,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:42:36,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:42:36,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-06 23:42:36,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:42:36,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 23:42:36,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:42:36,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-06 23:42:36,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:42:36,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 23:42:36,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:42:36,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801769916] [2024-11-06 23:42:36,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801769916] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:42:36,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:42:36,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-06 23:42:36,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122101872] [2024-11-06 23:42:36,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:42:36,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 23:42:36,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:42:36,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 23:42:36,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 23:42:36,710 INFO L87 Difference]: Start difference. First operand 312 states and 395 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-06 23:42:37,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:42:37,005 INFO L93 Difference]: Finished difference Result 885 states and 1166 transitions. [2024-11-06 23:42:37,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 23:42:37,006 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 47 [2024-11-06 23:42:37,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:42:37,012 INFO L225 Difference]: With dead ends: 885 [2024-11-06 23:42:37,012 INFO L226 Difference]: Without dead ends: 580 [2024-11-06 23:42:37,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-06 23:42:37,016 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 230 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-06 23:42:37,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 321 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-06 23:42:37,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2024-11-06 23:42:37,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 573. [2024-11-06 23:42:37,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 424 states have (on average 1.2382075471698113) internal successors, (525), 450 states have internal predecessors, (525), 75 states have call successors, (75), 67 states have call predecessors, (75), 73 states have return successors, (127), 76 states have call predecessors, (127), 75 states have call successors, (127) [2024-11-06 23:42:37,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 727 transitions. [2024-11-06 23:42:37,083 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 727 transitions. Word has length 47 [2024-11-06 23:42:37,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:42:37,083 INFO L471 AbstractCegarLoop]: Abstraction has 573 states and 727 transitions. [2024-11-06 23:42:37,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-06 23:42:37,083 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 727 transitions. [2024-11-06 23:42:37,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-06 23:42:37,085 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:42:37,085 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:42:37,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-06 23:42:37,086 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:42:37,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:42:37,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1089796900, now seen corresponding path program 1 times [2024-11-06 23:42:37,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:42:37,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362198420] [2024-11-06 23:42:37,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:42:37,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:42:37,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:42:37,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-06 23:42:37,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:42:37,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-06 23:42:37,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:42:37,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-06 23:42:37,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:42:37,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-06 23:42:37,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:42:37,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 23:42:37,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:42:37,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362198420] [2024-11-06 23:42:37,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362198420] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:42:37,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:42:37,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-06 23:42:37,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504294543] [2024-11-06 23:42:37,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:42:37,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-06 23:42:37,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:42:37,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-06 23:42:37,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-06 23:42:37,270 INFO L87 Difference]: Start difference. First operand 573 states and 727 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-06 23:42:37,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:42:37,936 INFO L93 Difference]: Finished difference Result 1913 states and 2519 transitions. [2024-11-06 23:42:37,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-06 23:42:37,936 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 51 [2024-11-06 23:42:37,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:42:37,946 INFO L225 Difference]: With dead ends: 1913 [2024-11-06 23:42:37,946 INFO L226 Difference]: Without dead ends: 1347 [2024-11-06 23:42:37,948 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2024-11-06 23:42:37,949 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 331 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-06 23:42:37,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 355 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-06 23:42:37,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2024-11-06 23:42:38,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 1305. [2024-11-06 23:42:38,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1305 states, 956 states have (on average 1.207112970711297) internal successors, (1154), 1023 states have internal predecessors, (1154), 182 states have call successors, (182), 134 states have call predecessors, (182), 166 states have return successors, (340), 188 states have call predecessors, (340), 182 states have call successors, (340) [2024-11-06 23:42:38,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1305 states to 1305 states and 1676 transitions. [2024-11-06 23:42:38,064 INFO L78 Accepts]: Start accepts. Automaton has 1305 states and 1676 transitions. Word has length 51 [2024-11-06 23:42:38,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:42:38,065 INFO L471 AbstractCegarLoop]: Abstraction has 1305 states and 1676 transitions. [2024-11-06 23:42:38,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-06 23:42:38,066 INFO L276 IsEmpty]: Start isEmpty. Operand 1305 states and 1676 transitions. [2024-11-06 23:42:38,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-06 23:42:38,067 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:42:38,067 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:42:38,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-06 23:42:38,068 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:42:38,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:42:38,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1199980952, now seen corresponding path program 1 times [2024-11-06 23:42:38,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:42:38,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521977341] [2024-11-06 23:42:38,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:42:38,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:42:38,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-06 23:42:38,083 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-06 23:42:38,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-06 23:42:38,120 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-06 23:42:38,120 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-06 23:42:38,121 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-06 23:42:38,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-06 23:42:38,127 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:42:38,177 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-06 23:42:38,183 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 11:42:38 BoogieIcfgContainer [2024-11-06 23:42:38,183 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-06 23:42:38,183 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-06 23:42:38,183 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-06 23:42:38,184 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-06 23:42:38,185 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:42:34" (3/4) ... [2024-11-06 23:42:38,186 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-06 23:42:38,243 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-06 23:42:38,243 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-06 23:42:38,244 INFO L158 Benchmark]: Toolchain (without parser) took 4517.37ms. Allocated memory was 117.4MB in the beginning and 167.8MB in the end (delta: 50.3MB). Free memory was 91.4MB in the beginning and 73.0MB in the end (delta: 18.5MB). Peak memory consumption was 67.8MB. Max. memory is 16.1GB. [2024-11-06 23:42:38,244 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 117.4MB. Free memory is still 81.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 23:42:38,244 INFO L158 Benchmark]: CACSL2BoogieTranslator took 377.53ms. Allocated memory is still 117.4MB. Free memory was 91.2MB in the beginning and 72.4MB in the end (delta: 18.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-06 23:42:38,245 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.37ms. Allocated memory is still 117.4MB. Free memory was 72.4MB in the beginning and 70.5MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 23:42:38,245 INFO L158 Benchmark]: Boogie Preprocessor took 33.29ms. Allocated memory is still 117.4MB. Free memory was 70.5MB in the beginning and 68.6MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 23:42:38,246 INFO L158 Benchmark]: RCFGBuilder took 349.75ms. Allocated memory is still 117.4MB. Free memory was 68.6MB in the beginning and 51.4MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-06 23:42:38,246 INFO L158 Benchmark]: TraceAbstraction took 3645.19ms. Allocated memory was 117.4MB in the beginning and 167.8MB in the end (delta: 50.3MB). Free memory was 50.8MB in the beginning and 78.3MB in the end (delta: -27.5MB). Peak memory consumption was 17.5MB. Max. memory is 16.1GB. [2024-11-06 23:42:38,247 INFO L158 Benchmark]: Witness Printer took 59.50ms. Allocated memory is still 167.8MB. Free memory was 78.3MB in the beginning and 73.0MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 23:42:38,249 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.40ms. Allocated memory is still 117.4MB. Free memory is still 81.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 377.53ms. Allocated memory is still 117.4MB. Free memory was 91.2MB in the beginning and 72.4MB in the end (delta: 18.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.37ms. Allocated memory is still 117.4MB. Free memory was 72.4MB in the beginning and 70.5MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.29ms. Allocated memory is still 117.4MB. Free memory was 70.5MB in the beginning and 68.6MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 349.75ms. Allocated memory is still 117.4MB. Free memory was 68.6MB in the beginning and 51.4MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3645.19ms. Allocated memory was 117.4MB in the beginning and 167.8MB in the end (delta: 50.3MB). Free memory was 50.8MB in the beginning and 78.3MB in the end (delta: -27.5MB). Peak memory consumption was 17.5MB. Max. memory is 16.1GB. * Witness Printer took 59.50ms. Allocated memory is still 167.8MB. Free memory was 78.3MB in the beginning and 73.0MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 49]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [49] - GenericResultAtLocation [Line: 87]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [87] - GenericResultAtLocation [Line: 159]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [159] - GenericResultAtLocation [Line: 407]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [407] - GenericResultAtLocation [Line: 511]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [511] - GenericResultAtLocation [Line: 520]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [520] - GenericResultAtLocation [Line: 616]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification1_spec.i","") [616] - GenericResultAtLocation [Line: 642]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [642] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 516]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L169] int pumpRunning = 0; [L170] int systemActive = 1; [L409] int waterLevel = 1; [L410] int methaneLevelCritical = 0; [L521] int cleanupTimeShifts = 4; [L812] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L594] int retValue_acc ; [L595] int tmp ; [L599] FCALL select_helpers() [L600] FCALL select_features() [L601] CALL, EXPR valid_product() [L79] int retValue_acc ; [L82] retValue_acc = 1 [L83] return (retValue_acc); VAL [\result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L601] RET, EXPR valid_product() [L601] tmp = valid_product() [L603] COND TRUE \read(tmp) [L605] FCALL setup() [L606] CALL runTest() [L588] CALL test() [L94] int splverifierCounter ; [L95] int tmp ; [L96] int tmp___0 ; [L97] int tmp___1 ; [L98] int tmp___2 ; [L101] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L103] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L105] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L111] tmp = __VERIFIER_nondet_int() [L113] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L115] CALL waterRise() VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L427] COND TRUE waterLevel < 2 [L428] waterLevel = waterLevel + 1 VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L115] RET waterRise() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L121] tmp___0 = __VERIFIER_nondet_int() [L123] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L125] CALL changeMethaneLevel() VAL [\old(methaneLevelCritical)=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L439] COND FALSE !(\read(methaneLevelCritical)) [L442] methaneLevelCritical = 1 VAL [\old(methaneLevelCritical)=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L125] RET changeMethaneLevel() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L131] tmp___2 = __VERIFIER_nondet_int() [L133] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L148] CALL timeShift() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L177] COND FALSE !(\read(pumpRunning)) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L184] COND TRUE \read(systemActive) [L186] CALL processEnvironment() [L258] int tmp ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L261] COND FALSE !(\read(pumpRunning)) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L276] CALL processEnvironment__wrappee__lowWaterSensor() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L232] int tmp ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L235] COND FALSE !(\read(pumpRunning)) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L250] CALL processEnvironment__wrappee__highWaterSensor() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L206] int tmp ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L209] COND TRUE ! pumpRunning [L211] CALL, EXPR isHighWaterLevel() [L355] int retValue_acc ; [L356] int tmp ; [L357] int tmp___0 ; [L361] CALL, EXPR isHighWaterSensorDry() [L489] int retValue_acc ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L492] COND FALSE !(waterLevel < 2) [L496] retValue_acc = 0 [L497] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L361] RET, EXPR isHighWaterSensorDry() [L361] tmp = isHighWaterSensorDry() [L363] COND FALSE !(\read(tmp)) [L366] tmp___0 = 1 VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, tmp___0=1, waterLevel=2] [L368] retValue_acc = tmp___0 [L369] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L211] RET, EXPR isHighWaterLevel() [L211] tmp = isHighWaterLevel() [L213] COND TRUE \read(tmp) [L215] CALL activatePump() [L286] pumpRunning = 1 VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L215] RET activatePump() [L250] RET processEnvironment__wrappee__highWaterSensor() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L276] RET processEnvironment__wrappee__lowWaterSensor() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L186] RET processEnvironment() [L192] CALL __utac_acc__Specification1_spec__1() [L618] int tmp ; [L619] int tmp___0 ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L623] CALL, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L448] int retValue_acc ; [L451] retValue_acc = methaneLevelCritical [L452] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L623] RET, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L623] tmp = isMethaneLevelCritical() [L625] COND TRUE \read(tmp) [L627] CALL, EXPR isPumpRunning() [L310] int retValue_acc ; [L313] retValue_acc = pumpRunning [L314] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L627] RET, EXPR isPumpRunning() [L627] tmp___0 = isPumpRunning() [L629] COND TRUE \read(tmp___0) [L631] CALL __automaton_fail() [L516] reach_error() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 104 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.6s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 868 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 841 mSDsluCounter, 2326 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1466 mSDsCounter, 258 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 850 IncrementalHoareTripleChecker+Invalid, 1108 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 258 mSolverCounterUnsat, 860 mSDtfsCounter, 850 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 97 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1305occurred in iteration=8, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 8 MinimizatonAttempts, 57 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 354 NumberOfCodeBlocks, 354 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 291 ConstructedInterpolants, 0 QuantifiedInterpolants, 523 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-06 23:42:38,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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