./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec1_product57.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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_product57.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 d0f26fc8ab0bdaf05de905c05e583bc491c727ef99c3d3df87bba160b541b55a --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:51:04,466 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:51:04,519 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 15:51:04,522 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:51:04,522 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:51:04,535 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:51:04,535 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:51:04,535 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:51:04,535 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:51:04,535 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:51:04,535 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:51:04,535 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:51:04,536 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:51:04,536 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:51:04,536 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:51:04,536 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:51:04,536 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:51:04,536 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:51:04,536 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:51:04,536 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:51:04,536 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:51:04,536 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:51:04,536 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:51:04,536 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:51:04,536 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:51:04,536 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:51:04,536 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:51:04,536 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:51:04,536 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:51:04,537 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:51:04,537 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:51:04,537 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:51:04,537 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:51:04,537 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:51:04,537 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:51:04,537 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:51:04,537 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:51:04,537 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:51:04,537 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:51:04,537 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:51:04,537 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:51:04,537 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:51:04,537 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:51:04,537 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 -> d0f26fc8ab0bdaf05de905c05e583bc491c727ef99c3d3df87bba160b541b55a [2025-02-05 15:51:04,698 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:51:04,703 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:51:04,705 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:51:04,706 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:51:04,706 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:51:04,707 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec1_product57.cil.c [2025-02-05 15:51:05,855 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eaf24c317/2a94c69a6704434ba99efebc845afe8c/FLAG7009b8636 [2025-02-05 15:51:06,196 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:51:06,200 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product57.cil.c [2025-02-05 15:51:06,210 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eaf24c317/2a94c69a6704434ba99efebc845afe8c/FLAG7009b8636 [2025-02-05 15:51:06,226 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eaf24c317/2a94c69a6704434ba99efebc845afe8c [2025-02-05 15:51:06,229 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:51:06,230 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:51:06,231 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:51:06,231 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:51:06,237 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:51:06,239 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:51:06" (1/1) ... [2025-02-05 15:51:06,239 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22e46acc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:51:06, skipping insertion in model container [2025-02-05 15:51:06,239 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:51:06" (1/1) ... [2025-02-05 15:51:06,271 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:51:06,464 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_product57.cil.c[18661,18674] [2025-02-05 15:51:06,466 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:51:06,475 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:51:06,480 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification1_spec.i","") [49] [2025-02-05 15:51:06,481 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [78] [2025-02-05 15:51:06,482 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [116] [2025-02-05 15:51:06,482 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [482] [2025-02-05 15:51:06,482 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [551] [2025-02-05 15:51:06,482 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [773] [2025-02-05 15:51:06,482 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [869] [2025-02-05 15:51:06,482 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [973] [2025-02-05 15:51:06,515 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_product57.cil.c[18661,18674] [2025-02-05 15:51:06,515 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:51:06,534 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:51:06,535 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:51:06 WrapperNode [2025-02-05 15:51:06,535 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:51:06,536 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:51:06,536 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:51:06,536 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:51:06,541 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:51:06" (1/1) ... [2025-02-05 15:51:06,551 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:51:06" (1/1) ... [2025-02-05 15:51:06,576 INFO L138 Inliner]: procedures = 56, calls = 100, calls flagged for inlining = 24, calls inlined = 21, statements flattened = 212 [2025-02-05 15:51:06,576 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:51:06,579 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:51:06,580 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:51:06,580 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:51:06,586 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:51:06" (1/1) ... [2025-02-05 15:51:06,586 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:51:06" (1/1) ... [2025-02-05 15:51:06,588 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:51:06" (1/1) ... [2025-02-05 15:51:06,609 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]. [2025-02-05 15:51:06,612 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:51:06" (1/1) ... [2025-02-05 15:51:06,613 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:51:06" (1/1) ... [2025-02-05 15:51:06,616 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:51:06" (1/1) ... [2025-02-05 15:51:06,620 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:51:06" (1/1) ... [2025-02-05 15:51:06,621 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:51:06" (1/1) ... [2025-02-05 15:51:06,625 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:51:06" (1/1) ... [2025-02-05 15:51:06,626 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:51:06,627 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:51:06,627 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:51:06,627 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:51:06,628 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:51:06" (1/1) ... [2025-02-05 15:51:06,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:51:06,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:51:06,666 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) [2025-02-05 15:51:06,671 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 [2025-02-05 15:51:06,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:51:06,696 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2025-02-05 15:51:06,696 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2025-02-05 15:51:06,696 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-02-05 15:51:06,696 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-02-05 15:51:06,696 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-02-05 15:51:06,696 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-02-05 15:51:06,697 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2025-02-05 15:51:06,697 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2025-02-05 15:51:06,697 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2025-02-05 15:51:06,697 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2025-02-05 15:51:06,697 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2025-02-05 15:51:06,697 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2025-02-05 15:51:06,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:51:06,697 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2025-02-05 15:51:06,698 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2025-02-05 15:51:06,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:51:06,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:51:06,745 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:51:06,746 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:51:06,791 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint cleanupFINAL: assume true; [2025-02-05 15:51:06,834 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L770-1: isLowWaterLevel_#res#1 := isLowWaterLevel_~retValue_acc~8#1; [2025-02-05 15:51:06,834 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L696-1: isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~6#1; [2025-02-05 15:51:06,834 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L970-1: isLowWaterSensorDry_#res#1 := isLowWaterSensorDry_~retValue_acc~13#1; [2025-02-05 15:51:06,837 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L915: #res := ~retValue_acc~10; [2025-02-05 15:51:06,923 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L866-1: main_#res#1 := main_~retValue_acc~9#1; [2025-02-05 15:51:06,923 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L113-1: valid_product_#res#1 := valid_product_~retValue_acc~1#1; [2025-02-05 15:51:06,963 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L961-1: isHighWaterSensorDry_#res#1 := isHighWaterSensorDry_~retValue_acc~12#1; [2025-02-05 15:51:06,964 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L687-1: isMethaneAlarm_#res#1 := isMethaneAlarm_~retValue_acc~5#1; [2025-02-05 15:51:06,964 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L751-1: isHighWaterLevel_#res#1 := isHighWaterLevel_~retValue_acc~7#1; [2025-02-05 15:51:06,979 INFO L? ?]: Removed 49 outVars from TransFormulas that were not future-live. [2025-02-05 15:51:06,979 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:51:06,989 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:51:06,989 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:51:06,989 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:51:06 BoogieIcfgContainer [2025-02-05 15:51:06,992 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:51:06,994 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:51:06,994 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:51:07,001 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:51:07,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:51:06" (1/3) ... [2025-02-05 15:51:07,002 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@442062a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:51:07, skipping insertion in model container [2025-02-05 15:51:07,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:51:06" (2/3) ... [2025-02-05 15:51:07,002 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@442062a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:51:07, skipping insertion in model container [2025-02-05 15:51:07,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:51:06" (3/3) ... [2025-02-05 15:51:07,003 INFO L128 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product57.cil.c [2025-02-05 15:51:07,018 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:51:07,021 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG minepump_spec1_product57.cil.c that has 8 procedures, 90 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-05 15:51:07,063 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:51:07,071 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;@415aa47d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:51:07,072 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:51:07,074 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 68 states have (on average 1.3676470588235294) internal successors, (93), 76 states have internal predecessors, (93), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-05 15:51:07,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-05 15:51:07,079 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:51:07,079 INFO L218 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] [2025-02-05 15:51:07,080 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:51:07,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:51:07,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1845660002, now seen corresponding path program 1 times [2025-02-05 15:51:07,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:51:07,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229486724] [2025-02-05 15:51:07,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:51:07,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:51:07,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-05 15:51:07,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-05 15:51:07,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:51:07,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:51:07,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:51:07,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:51:07,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229486724] [2025-02-05 15:51:07,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229486724] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:51:07,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:51:07,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 15:51:07,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274102161] [2025-02-05 15:51:07,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:51:07,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 15:51:07,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:51:07,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 15:51:07,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 15:51:07,212 INFO L87 Difference]: Start difference. First operand has 89 states, 68 states have (on average 1.3676470588235294) internal successors, (93), 76 states have internal predecessors, (93), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 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) [2025-02-05 15:51:07,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:51:07,229 INFO L93 Difference]: Finished difference Result 162 states and 219 transitions. [2025-02-05 15:51:07,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 15:51:07,230 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 [2025-02-05 15:51:07,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:51:07,234 INFO L225 Difference]: With dead ends: 162 [2025-02-05 15:51:07,235 INFO L226 Difference]: Without dead ends: 81 [2025-02-05 15:51:07,237 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 15:51:07,238 INFO L435 NwaCegarLoop]: 110 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, 110 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 [2025-02-05 15:51:07,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:51:07,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-02-05 15:51:07,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-02-05 15:51:07,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 62 states have (on average 1.3225806451612903) internal successors, (82), 69 states have internal predecessors, (82), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-05 15:51:07,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 105 transitions. [2025-02-05 15:51:07,265 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 105 transitions. Word has length 23 [2025-02-05 15:51:07,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:51:07,266 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 105 transitions. [2025-02-05 15:51:07,266 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) [2025-02-05 15:51:07,266 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 105 transitions. [2025-02-05 15:51:07,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-05 15:51:07,268 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:51:07,268 INFO L218 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] [2025-02-05 15:51:07,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 15:51:07,268 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:51:07,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:51:07,269 INFO L85 PathProgramCache]: Analyzing trace with hash -312616617, now seen corresponding path program 1 times [2025-02-05 15:51:07,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:51:07,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283516085] [2025-02-05 15:51:07,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:51:07,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:51:07,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-05 15:51:07,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-05 15:51:07,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:51:07,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:51:07,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:51:07,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:51:07,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283516085] [2025-02-05 15:51:07,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283516085] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:51:07,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:51:07,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:51:07,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294613733] [2025-02-05 15:51:07,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:51:07,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:51:07,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:51:07,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:51:07,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:51:07,338 INFO L87 Difference]: Start difference. First operand 81 states and 105 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) [2025-02-05 15:51:07,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:51:07,356 INFO L93 Difference]: Finished difference Result 129 states and 167 transitions. [2025-02-05 15:51:07,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:51:07,357 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 [2025-02-05 15:51:07,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:51:07,358 INFO L225 Difference]: With dead ends: 129 [2025-02-05 15:51:07,358 INFO L226 Difference]: Without dead ends: 72 [2025-02-05 15:51:07,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:51:07,359 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 11 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 169 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 [2025-02-05 15:51:07,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 169 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:51:07,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-02-05 15:51:07,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-02-05 15:51:07,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 56 states have (on average 1.3392857142857142) internal successors, (75), 63 states have internal predecessors, (75), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-05 15:51:07,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 93 transitions. [2025-02-05 15:51:07,372 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 93 transitions. Word has length 24 [2025-02-05 15:51:07,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:51:07,373 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 93 transitions. [2025-02-05 15:51:07,373 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) [2025-02-05 15:51:07,373 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 93 transitions. [2025-02-05 15:51:07,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-05 15:51:07,376 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:51:07,376 INFO L218 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] [2025-02-05 15:51:07,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 15:51:07,377 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:51:07,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:51:07,377 INFO L85 PathProgramCache]: Analyzing trace with hash 2059345280, now seen corresponding path program 1 times [2025-02-05 15:51:07,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:51:07,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634047910] [2025-02-05 15:51:07,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:51:07,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:51:07,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-05 15:51:07,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-05 15:51:07,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:51:07,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:51:07,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:51:07,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:51:07,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634047910] [2025-02-05 15:51:07,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634047910] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:51:07,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:51:07,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:51:07,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260424317] [2025-02-05 15:51:07,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:51:07,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:51:07,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:51:07,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:51:07,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:51:07,499 INFO L87 Difference]: Start difference. First operand 72 states and 93 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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) [2025-02-05 15:51:07,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:51:07,510 INFO L93 Difference]: Finished difference Result 137 states and 180 transitions. [2025-02-05 15:51:07,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:51:07,511 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 27 [2025-02-05 15:51:07,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:51:07,512 INFO L225 Difference]: With dead ends: 137 [2025-02-05 15:51:07,512 INFO L226 Difference]: Without dead ends: 72 [2025-02-05 15:51:07,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:51:07,513 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 76 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 91 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 [2025-02-05 15:51:07,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 91 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:51:07,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-02-05 15:51:07,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-02-05 15:51:07,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 63 states have internal predecessors, (74), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-05 15:51:07,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 92 transitions. [2025-02-05 15:51:07,519 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 92 transitions. Word has length 27 [2025-02-05 15:51:07,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:51:07,519 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 92 transitions. [2025-02-05 15:51:07,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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) [2025-02-05 15:51:07,519 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 92 transitions. [2025-02-05 15:51:07,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-05 15:51:07,520 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:51:07,520 INFO L218 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] [2025-02-05 15:51:07,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 15:51:07,520 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:51:07,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:51:07,521 INFO L85 PathProgramCache]: Analyzing trace with hash -516583723, now seen corresponding path program 1 times [2025-02-05 15:51:07,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:51:07,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96483539] [2025-02-05 15:51:07,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:51:07,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:51:07,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-05 15:51:07,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-05 15:51:07,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:51:07,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:51:07,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:51:07,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:51:07,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96483539] [2025-02-05 15:51:07,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96483539] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:51:07,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:51:07,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:51:07,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703367211] [2025-02-05 15:51:07,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:51:07,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:51:07,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:51:07,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:51:07,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:51:07,561 INFO L87 Difference]: Start difference. First operand 72 states and 92 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 15:51:07,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:51:07,616 INFO L93 Difference]: Finished difference Result 179 states and 234 transitions. [2025-02-05 15:51:07,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:51:07,617 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2025-02-05 15:51:07,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:51:07,618 INFO L225 Difference]: With dead ends: 179 [2025-02-05 15:51:07,618 INFO L226 Difference]: Without dead ends: 114 [2025-02-05 15:51:07,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:51:07,619 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 72 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:51:07,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 158 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:51:07,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-02-05 15:51:07,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2025-02-05 15:51:07,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 86 states have (on average 1.302325581395349) internal successors, (112), 94 states have internal predecessors, (112), 13 states have call successors, (13), 12 states have call predecessors, (13), 12 states have return successors, (17), 13 states have call predecessors, (17), 13 states have call successors, (17) [2025-02-05 15:51:07,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 142 transitions. [2025-02-05 15:51:07,630 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 142 transitions. Word has length 35 [2025-02-05 15:51:07,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:51:07,630 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 142 transitions. [2025-02-05 15:51:07,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 15:51:07,631 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 142 transitions. [2025-02-05 15:51:07,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-05 15:51:07,631 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:51:07,631 INFO L218 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] [2025-02-05 15:51:07,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 15:51:07,632 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:51:07,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:51:07,632 INFO L85 PathProgramCache]: Analyzing trace with hash 148399456, now seen corresponding path program 1 times [2025-02-05 15:51:07,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:51:07,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349131095] [2025-02-05 15:51:07,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:51:07,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:51:07,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-05 15:51:07,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-05 15:51:07,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:51:07,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:51:07,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:51:07,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:51:07,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349131095] [2025-02-05 15:51:07,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349131095] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:51:07,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:51:07,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:51:07,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682142653] [2025-02-05 15:51:07,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:51:07,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:51:07,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:51:07,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:51:07,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:51:07,733 INFO L87 Difference]: Start difference. First operand 112 states and 142 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 15:51:07,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:51:07,897 INFO L93 Difference]: Finished difference Result 138 states and 172 transitions. [2025-02-05 15:51:07,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 15:51:07,898 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 43 [2025-02-05 15:51:07,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:51:07,899 INFO L225 Difference]: With dead ends: 138 [2025-02-05 15:51:07,899 INFO L226 Difference]: Without dead ends: 136 [2025-02-05 15:51:07,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:51:07,900 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 124 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:51:07,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 309 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:51:07,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-02-05 15:51:07,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2025-02-05 15:51:07,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 103 states have (on average 1.2718446601941749) internal successors, (131), 111 states have internal predecessors, (131), 15 states have call successors, (15), 12 states have call predecessors, (15), 15 states have return successors, (22), 16 states have call predecessors, (22), 15 states have call successors, (22) [2025-02-05 15:51:07,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 168 transitions. [2025-02-05 15:51:07,911 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 168 transitions. Word has length 43 [2025-02-05 15:51:07,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:51:07,912 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 168 transitions. [2025-02-05 15:51:07,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 15:51:07,912 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 168 transitions. [2025-02-05 15:51:07,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-05 15:51:07,912 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:51:07,913 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:51:07,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 15:51:07,913 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:51:07,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:51:07,913 INFO L85 PathProgramCache]: Analyzing trace with hash -381032742, now seen corresponding path program 1 times [2025-02-05 15:51:07,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:51:07,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142418076] [2025-02-05 15:51:07,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:51:07,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:51:07,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-05 15:51:07,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-05 15:51:07,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:51:07,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:51:07,978 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 15:51:07,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:51:07,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142418076] [2025-02-05 15:51:07,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142418076] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:51:07,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:51:07,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:51:07,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645810801] [2025-02-05 15:51:07,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:51:07,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:51:07,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:51:07,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:51:07,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:51:07,980 INFO L87 Difference]: Start difference. First operand 134 states and 168 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 15:51:08,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:51:08,002 INFO L93 Difference]: Finished difference Result 264 states and 341 transitions. [2025-02-05 15:51:08,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:51:08,003 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (4), 1 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 49 [2025-02-05 15:51:08,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:51:08,004 INFO L225 Difference]: With dead ends: 264 [2025-02-05 15:51:08,004 INFO L226 Difference]: Without dead ends: 137 [2025-02-05 15:51:08,004 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:51:08,005 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 0 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:51:08,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 350 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:51:08,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-02-05 15:51:08,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2025-02-05 15:51:08,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 106 states have (on average 1.2641509433962264) internal successors, (134), 114 states have internal predecessors, (134), 15 states have call successors, (15), 12 states have call predecessors, (15), 15 states have return successors, (22), 16 states have call predecessors, (22), 15 states have call successors, (22) [2025-02-05 15:51:08,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 171 transitions. [2025-02-05 15:51:08,017 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 171 transitions. Word has length 49 [2025-02-05 15:51:08,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:51:08,017 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 171 transitions. [2025-02-05 15:51:08,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 15:51:08,017 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 171 transitions. [2025-02-05 15:51:08,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-05 15:51:08,018 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:51:08,018 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:51:08,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 15:51:08,018 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:51:08,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:51:08,018 INFO L85 PathProgramCache]: Analyzing trace with hash -350012935, now seen corresponding path program 1 times [2025-02-05 15:51:08,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:51:08,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221818718] [2025-02-05 15:51:08,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:51:08,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:51:08,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-05 15:51:08,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-05 15:51:08,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:51:08,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:51:08,082 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 15:51:08,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:51:08,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221818718] [2025-02-05 15:51:08,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221818718] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:51:08,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:51:08,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:51:08,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221274515] [2025-02-05 15:51:08,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:51:08,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:51:08,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:51:08,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:51:08,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:51:08,084 INFO L87 Difference]: Start difference. First operand 137 states and 171 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 15:51:08,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:51:08,130 INFO L93 Difference]: Finished difference Result 269 states and 346 transitions. [2025-02-05 15:51:08,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:51:08,133 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (4), 1 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 49 [2025-02-05 15:51:08,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:51:08,134 INFO L225 Difference]: With dead ends: 269 [2025-02-05 15:51:08,134 INFO L226 Difference]: Without dead ends: 139 [2025-02-05 15:51:08,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:51:08,135 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 0 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:51:08,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 264 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:51:08,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-02-05 15:51:08,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2025-02-05 15:51:08,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 108 states have (on average 1.2592592592592593) internal successors, (136), 116 states have internal predecessors, (136), 15 states have call successors, (15), 12 states have call predecessors, (15), 15 states have return successors, (22), 16 states have call predecessors, (22), 15 states have call successors, (22) [2025-02-05 15:51:08,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 173 transitions. [2025-02-05 15:51:08,149 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 173 transitions. Word has length 49 [2025-02-05 15:51:08,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:51:08,149 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 173 transitions. [2025-02-05 15:51:08,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 15:51:08,149 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 173 transitions. [2025-02-05 15:51:08,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-05 15:51:08,150 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:51:08,150 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:51:08,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 15:51:08,150 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:51:08,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:51:08,151 INFO L85 PathProgramCache]: Analyzing trace with hash -859486025, now seen corresponding path program 1 times [2025-02-05 15:51:08,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:51:08,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566709269] [2025-02-05 15:51:08,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:51:08,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:51:08,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-05 15:51:08,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-05 15:51:08,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:51:08,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:51:08,236 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 15:51:08,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:51:08,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566709269] [2025-02-05 15:51:08,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566709269] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:51:08,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:51:08,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:51:08,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837308474] [2025-02-05 15:51:08,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:51:08,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:51:08,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:51:08,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:51:08,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:51:08,237 INFO L87 Difference]: Start difference. First operand 139 states and 173 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 15:51:08,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:51:08,331 INFO L93 Difference]: Finished difference Result 424 states and 548 transitions. [2025-02-05 15:51:08,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:51:08,332 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 3 states have call successors, (4), 2 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 49 [2025-02-05 15:51:08,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:51:08,334 INFO L225 Difference]: With dead ends: 424 [2025-02-05 15:51:08,336 INFO L226 Difference]: Without dead ends: 292 [2025-02-05 15:51:08,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:51:08,338 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 114 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:51:08,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 290 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:51:08,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2025-02-05 15:51:08,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 285. [2025-02-05 15:51:08,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 219 states have (on average 1.2465753424657535) internal successors, (273), 233 states have internal predecessors, (273), 32 states have call successors, (32), 28 states have call predecessors, (32), 33 states have return successors, (57), 34 states have call predecessors, (57), 32 states have call successors, (57) [2025-02-05 15:51:08,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 362 transitions. [2025-02-05 15:51:08,367 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 362 transitions. Word has length 49 [2025-02-05 15:51:08,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:51:08,367 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 362 transitions. [2025-02-05 15:51:08,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 15:51:08,367 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 362 transitions. [2025-02-05 15:51:08,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-05 15:51:08,368 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:51:08,368 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:51:08,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 15:51:08,369 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:51:08,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:51:08,369 INFO L85 PathProgramCache]: Analyzing trace with hash 565284185, now seen corresponding path program 1 times [2025-02-05 15:51:08,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:51:08,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098907037] [2025-02-05 15:51:08,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:51:08,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:51:08,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-05 15:51:08,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-05 15:51:08,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:51:08,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:51:08,482 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 15:51:08,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:51:08,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098907037] [2025-02-05 15:51:08,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098907037] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:51:08,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:51:08,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:51:08,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985041802] [2025-02-05 15:51:08,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:51:08,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:51:08,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:51:08,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:51:08,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:51:08,483 INFO L87 Difference]: Start difference. First operand 285 states and 362 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-05 15:51:08,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:51:08,639 INFO L93 Difference]: Finished difference Result 823 states and 1082 transitions. [2025-02-05 15:51:08,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 15:51:08,642 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (5), 2 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 53 [2025-02-05 15:51:08,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:51:08,646 INFO L225 Difference]: With dead ends: 823 [2025-02-05 15:51:08,646 INFO L226 Difference]: Without dead ends: 545 [2025-02-05 15:51:08,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:51:08,649 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 62 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:51:08,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 410 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:51:08,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2025-02-05 15:51:08,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 545. [2025-02-05 15:51:08,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 414 states have (on average 1.2222222222222223) internal successors, (506), 441 states have internal predecessors, (506), 64 states have call successors, (64), 56 states have call predecessors, (64), 66 states have return successors, (119), 68 states have call predecessors, (119), 64 states have call successors, (119) [2025-02-05 15:51:08,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 689 transitions. [2025-02-05 15:51:08,731 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 689 transitions. Word has length 53 [2025-02-05 15:51:08,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:51:08,731 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 689 transitions. [2025-02-05 15:51:08,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-05 15:51:08,731 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 689 transitions. [2025-02-05 15:51:08,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-05 15:51:08,735 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:51:08,737 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:51:08,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 15:51:08,737 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:51:08,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:51:08,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1937745766, now seen corresponding path program 1 times [2025-02-05 15:51:08,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:51:08,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589182298] [2025-02-05 15:51:08,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:51:08,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:51:08,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-05 15:51:08,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 15:51:08,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:51:08,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:51:08,982 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 15:51:08,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:51:08,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589182298] [2025-02-05 15:51:08,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589182298] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:51:08,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477465657] [2025-02-05 15:51:08,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:51:08,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:51:08,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:51:08,988 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:51:08,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 15:51:09,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-05 15:51:09,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 15:51:09,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:51:09,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:51:09,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 15:51:09,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:51:09,328 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:51:09,329 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:51:09,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [477465657] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:51:09,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:51:09,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2025-02-05 15:51:09,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665260951] [2025-02-05 15:51:09,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:51:09,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:51:09,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:51:09,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:51:09,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2025-02-05 15:51:09,333 INFO L87 Difference]: Start difference. First operand 545 states and 689 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 6 states have internal predecessors, (46), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-02-05 15:51:09,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:51:09,448 INFO L93 Difference]: Finished difference Result 1069 states and 1356 transitions. [2025-02-05 15:51:09,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 15:51:09,449 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 6 states have internal predecessors, (46), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 57 [2025-02-05 15:51:09,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:51:09,451 INFO L225 Difference]: With dead ends: 1069 [2025-02-05 15:51:09,451 INFO L226 Difference]: Without dead ends: 531 [2025-02-05 15:51:09,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2025-02-05 15:51:09,453 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 57 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:51:09,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 476 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:51:09,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2025-02-05 15:51:09,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 531. [2025-02-05 15:51:09,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 403 states have (on average 1.2084367245657568) internal successors, (487), 429 states have internal predecessors, (487), 63 states have call successors, (63), 56 states have call predecessors, (63), 64 states have return successors, (105), 66 states have call predecessors, (105), 63 states have call successors, (105) [2025-02-05 15:51:09,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 655 transitions. [2025-02-05 15:51:09,482 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 655 transitions. Word has length 57 [2025-02-05 15:51:09,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:51:09,482 INFO L471 AbstractCegarLoop]: Abstraction has 531 states and 655 transitions. [2025-02-05 15:51:09,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 6 states have internal predecessors, (46), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-02-05 15:51:09,483 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 655 transitions. [2025-02-05 15:51:09,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-05 15:51:09,485 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:51:09,485 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:51:09,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 15:51:09,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-05 15:51:09,686 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:51:09,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:51:09,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1107868445, now seen corresponding path program 1 times [2025-02-05 15:51:09,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:51:09,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293990973] [2025-02-05 15:51:09,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:51:09,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:51:09,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-05 15:51:09,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-05 15:51:09,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:51:09,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:51:09,822 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-05 15:51:09,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:51:09,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293990973] [2025-02-05 15:51:09,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293990973] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:51:09,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1050629647] [2025-02-05 15:51:09,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:51:09,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:51:09,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:51:09,824 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:51:09,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 15:51:09,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-05 15:51:09,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-05 15:51:09,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:51:09,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:51:09,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 15:51:09,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:51:09,956 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 15:51:09,958 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:51:09,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1050629647] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:51:09,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:51:09,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2025-02-05 15:51:09,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282669649] [2025-02-05 15:51:09,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:51:09,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:51:09,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:51:09,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:51:09,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:51:09,960 INFO L87 Difference]: Start difference. First operand 531 states and 655 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 3 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-02-05 15:51:10,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:51:10,412 INFO L93 Difference]: Finished difference Result 1163 states and 1489 transitions. [2025-02-05 15:51:10,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 15:51:10,416 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 3 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 98 [2025-02-05 15:51:10,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:51:10,420 INFO L225 Difference]: With dead ends: 1163 [2025-02-05 15:51:10,420 INFO L226 Difference]: Without dead ends: 727 [2025-02-05 15:51:10,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:51:10,421 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 138 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 15:51:10,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 309 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 15:51:10,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2025-02-05 15:51:10,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 707. [2025-02-05 15:51:10,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 531 states have (on average 1.1958568738229756) internal successors, (635), 565 states have internal predecessors, (635), 90 states have call successors, (90), 74 states have call predecessors, (90), 85 states have return successors, (168), 95 states have call predecessors, (168), 90 states have call successors, (168) [2025-02-05 15:51:10,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 893 transitions. [2025-02-05 15:51:10,548 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 893 transitions. Word has length 98 [2025-02-05 15:51:10,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:51:10,552 INFO L471 AbstractCegarLoop]: Abstraction has 707 states and 893 transitions. [2025-02-05 15:51:10,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 4 states have internal predecessors, (75), 3 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-02-05 15:51:10,552 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 893 transitions. [2025-02-05 15:51:10,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 15:51:10,554 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:51:10,557 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:51:10,564 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 15:51:10,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:51:10,758 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:51:10,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:51:10,763 INFO L85 PathProgramCache]: Analyzing trace with hash -552782849, now seen corresponding path program 1 times [2025-02-05 15:51:10,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:51:10,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903072036] [2025-02-05 15:51:10,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:51:10,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:51:10,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 15:51:10,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 15:51:10,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:51:10,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:51:10,940 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-05 15:51:10,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:51:10,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903072036] [2025-02-05 15:51:10,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903072036] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:51:10,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [118888772] [2025-02-05 15:51:10,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:51:10,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:51:10,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:51:10,942 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:51:10,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 15:51:10,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 15:51:11,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 15:51:11,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:51:11,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:51:11,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-05 15:51:11,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:51:11,068 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 15:51:11,068 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:51:11,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [118888772] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:51:11,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:51:11,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2025-02-05 15:51:11,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137726674] [2025-02-05 15:51:11,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:51:11,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:51:11,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:51:11,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:51:11,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:51:11,069 INFO L87 Difference]: Start difference. First operand 707 states and 893 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-02-05 15:51:11,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:51:11,210 INFO L93 Difference]: Finished difference Result 1617 states and 2137 transitions. [2025-02-05 15:51:11,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:51:11,210 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 94 [2025-02-05 15:51:11,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:51:11,215 INFO L225 Difference]: With dead ends: 1617 [2025-02-05 15:51:11,215 INFO L226 Difference]: Without dead ends: 1009 [2025-02-05 15:51:11,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:51:11,218 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 98 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:51:11,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 525 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:51:11,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2025-02-05 15:51:11,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 915. [2025-02-05 15:51:11,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 915 states, 685 states have (on average 1.2014598540145986) internal successors, (823), 731 states have internal predecessors, (823), 118 states have call successors, (118), 98 states have call predecessors, (118), 111 states have return successors, (224), 117 states have call predecessors, (224), 118 states have call successors, (224) [2025-02-05 15:51:11,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1165 transitions. [2025-02-05 15:51:11,288 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1165 transitions. Word has length 94 [2025-02-05 15:51:11,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:51:11,288 INFO L471 AbstractCegarLoop]: Abstraction has 915 states and 1165 transitions. [2025-02-05 15:51:11,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-02-05 15:51:11,289 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1165 transitions. [2025-02-05 15:51:11,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 15:51:11,290 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:51:11,291 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:51:11,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 15:51:11,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:51:11,492 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:51:11,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:51:11,492 INFO L85 PathProgramCache]: Analyzing trace with hash 691981632, now seen corresponding path program 1 times [2025-02-05 15:51:11,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:51:11,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823459194] [2025-02-05 15:51:11,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:51:11,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:51:11,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 15:51:11,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 15:51:11,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:51:11,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:51:11,570 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 15:51:11,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:51:11,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823459194] [2025-02-05 15:51:11,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823459194] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:51:11,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:51:11,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:51:11,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961014233] [2025-02-05 15:51:11,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:51:11,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:51:11,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:51:11,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:51:11,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:51:11,571 INFO L87 Difference]: Start difference. First operand 915 states and 1165 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-05 15:51:11,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:51:11,623 INFO L93 Difference]: Finished difference Result 1219 states and 1540 transitions. [2025-02-05 15:51:11,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:51:11,624 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 94 [2025-02-05 15:51:11,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:51:11,625 INFO L225 Difference]: With dead ends: 1219 [2025-02-05 15:51:11,625 INFO L226 Difference]: Without dead ends: 0 [2025-02-05 15:51:11,627 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:51:11,628 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 0 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:51:11,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 311 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:51:11,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-05 15:51:11,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-05 15:51:11,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 15:51:11,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-05 15:51:11,629 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 94 [2025-02-05 15:51:11,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:51:11,629 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-05 15:51:11,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-05 15:51:11,629 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-05 15:51:11,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-05 15:51:11,631 INFO L782 garLoopResultBuilder]: Registering result SAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 15:51:11,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 15:51:11,633 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:51:11,634 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-05 15:51:14,272 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 15:51:14,281 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 03:51:14 BoogieIcfgContainer [2025-02-05 15:51:14,282 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 15:51:14,282 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 15:51:14,282 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 15:51:14,282 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 15:51:14,283 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:51:06" (3/4) ... [2025-02-05 15:51:14,284 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-05 15:51:14,288 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__base [2025-02-05 15:51:14,289 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure changeMethaneLevel [2025-02-05 15:51:14,289 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure cleanup [2025-02-05 15:51:14,289 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure timeShift [2025-02-05 15:51:14,289 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure isMethaneLevelCritical [2025-02-05 15:51:14,289 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__highWaterSensor [2025-02-05 15:51:14,289 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure waterRise [2025-02-05 15:51:14,293 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2025-02-05 15:51:14,293 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-02-05 15:51:14,293 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-05 15:51:14,293 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-05 15:51:14,294 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-05 15:51:14,353 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-05 15:51:14,354 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-05 15:51:14,354 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 15:51:14,354 INFO L158 Benchmark]: Toolchain (without parser) took 8124.90ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 136.0MB in the beginning and 132.7MB in the end (delta: 3.3MB). Peak memory consumption was 33.7MB. Max. memory is 16.1GB. [2025-02-05 15:51:14,355 INFO L158 Benchmark]: CDTParser took 1.90ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 15:51:14,355 INFO L158 Benchmark]: CACSL2BoogieTranslator took 304.63ms. Allocated memory is still 167.8MB. Free memory was 135.6MB in the beginning and 117.1MB in the end (delta: 18.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 15:51:14,355 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.25ms. Allocated memory is still 167.8MB. Free memory was 117.1MB in the beginning and 115.3MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 15:51:14,355 INFO L158 Benchmark]: Boogie Preprocessor took 47.02ms. Allocated memory is still 167.8MB. Free memory was 115.3MB in the beginning and 113.4MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 15:51:14,355 INFO L158 Benchmark]: IcfgBuilder took 365.61ms. Allocated memory is still 167.8MB. Free memory was 113.4MB in the beginning and 95.0MB in the end (delta: 18.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 15:51:14,356 INFO L158 Benchmark]: TraceAbstraction took 7287.63ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 94.1MB in the beginning and 140.7MB in the end (delta: -46.6MB). Peak memory consumption was 69.6MB. Max. memory is 16.1GB. [2025-02-05 15:51:14,356 INFO L158 Benchmark]: Witness Printer took 71.78ms. Allocated memory is still 201.3MB. Free memory was 140.7MB in the beginning and 132.7MB in the end (delta: 8.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 15:51:14,357 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.90ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 304.63ms. Allocated memory is still 167.8MB. Free memory was 135.6MB in the beginning and 117.1MB in the end (delta: 18.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.25ms. Allocated memory is still 167.8MB. Free memory was 117.1MB in the beginning and 115.3MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 47.02ms. Allocated memory is still 167.8MB. Free memory was 115.3MB in the beginning and 113.4MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 365.61ms. Allocated memory is still 167.8MB. Free memory was 113.4MB in the beginning and 95.0MB in the end (delta: 18.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 7287.63ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 94.1MB in the beginning and 140.7MB in the end (delta: -46.6MB). Peak memory consumption was 69.6MB. Max. memory is 16.1GB. * Witness Printer took 71.78ms. Allocated memory is still 201.3MB. Free memory was 140.7MB in the beginning and 132.7MB in the end (delta: 8.0MB). 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,"Specification1_spec.i","") [49] - GenericResultAtLocation [Line: 78]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [78] - GenericResultAtLocation [Line: 116]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [116] - GenericResultAtLocation [Line: 482]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [482] - GenericResultAtLocation [Line: 551]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [551] - GenericResultAtLocation [Line: 773]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [773] - GenericResultAtLocation [Line: 869]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [869] - GenericResultAtLocation [Line: 973]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [973] * 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 - PositiveResult [Line: 978]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 90 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.6s, OverallIterations: 13, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 766 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 752 mSDsluCounter, 3772 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2392 mSDsCounter, 87 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 631 IncrementalHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 87 mSolverCounterUnsat, 1380 mSDtfsCounter, 631 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 328 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=915occurred in iteration=12, InterpolantAutomatonStates: 65, 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, 13 MinimizatonAttempts, 125 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 944 NumberOfCodeBlocks, 944 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 928 ConstructedInterpolants, 0 QuantifiedInterpolants, 1585 SizeOfPredicates, 2 NumberOfNonLiveVariables, 860 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 16 InterpolantComputations, 13 PerfectInterpolantSequences, 165/171 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, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 785]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 497]: Location Invariant Derived location invariant: (((((((pumpRunning == 0) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (splverifierCounter == 0)) && (1 <= waterLevel)) || (((((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (1 == systemActive)) && (splverifierCounter == 0)) && (1 <= waterLevel))) || ((((methaneLevelCritical == 0) && (2 <= waterLevel)) && (1 == systemActive)) && (splverifierCounter == 0))) RESULT: Ultimate proved your program to be correct! [2025-02-05 15:51:14,371 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 Result: TRUE