./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec3_product61.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_spec3_product61.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 53b1b58c0a8af862b137647fd316df606e2053e614741221b62b3a107765e608 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:52:52,565 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:52:52,607 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:52:52,614 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:52:52,614 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:52:52,627 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:52:52,628 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:52:52,628 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:52:52,628 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:52:52,628 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:52:52,628 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:52:52,628 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:52:52,629 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:52:52,629 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:52:52,629 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:52:52,629 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:52:52,629 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:52:52,629 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:52:52,629 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:52:52,629 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:52:52,629 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:52:52,629 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:52:52,630 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:52:52,630 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:52:52,630 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:52:52,630 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:52:52,630 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:52:52,630 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:52:52,630 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:52:52,630 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:52:52,630 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:52:52,630 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:52:52,630 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:52:52,631 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:52:52,631 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:52:52,631 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:52:52,631 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:52:52,631 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:52:52,631 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:52:52,631 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:52:52,631 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:52:52,631 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:52:52,631 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:52:52,631 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 -> 53b1b58c0a8af862b137647fd316df606e2053e614741221b62b3a107765e608 [2025-02-05 15:52:52,816 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:52:52,822 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:52:52,824 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:52:52,824 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:52:52,825 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:52:52,825 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec3_product61.cil.c [2025-02-05 15:52:54,063 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e3926e714/1bf15501c1334c3cab590f63324e6430/FLAGc8a97426b [2025-02-05 15:52:54,376 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:52:54,381 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec3_product61.cil.c [2025-02-05 15:52:54,399 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e3926e714/1bf15501c1334c3cab590f63324e6430/FLAGc8a97426b [2025-02-05 15:52:54,639 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e3926e714/1bf15501c1334c3cab590f63324e6430 [2025-02-05 15:52:54,641 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:52:54,642 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:52:54,642 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:52:54,643 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:52:54,645 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:52:54,646 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:52:54" (1/1) ... [2025-02-05 15:52:54,646 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@162ae382 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:52:54, skipping insertion in model container [2025-02-05 15:52:54,647 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:52:54" (1/1) ... [2025-02-05 15:52:54,665 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:52:54,841 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_spec3_product61.cil.c[7381,7394] [2025-02-05 15:52:54,902 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:52:54,913 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:52:54,918 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [49] [2025-02-05 15:52:54,919 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [118] [2025-02-05 15:52:54,920 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [368] [2025-02-05 15:52:54,920 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [472] [2025-02-05 15:52:54,920 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [481] [2025-02-05 15:52:54,920 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification3_spec.i","") [580] [2025-02-05 15:52:54,920 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [614] [2025-02-05 15:52:54,920 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [649] [2025-02-05 15:52:54,942 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_spec3_product61.cil.c[7381,7394] [2025-02-05 15:52:54,978 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:52:55,001 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:52:55,002 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:52:55 WrapperNode [2025-02-05 15:52:55,003 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:52:55,005 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:52:55,005 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:52:55,005 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:52:55,009 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:52:55" (1/1) ... [2025-02-05 15:52:55,019 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:52:55" (1/1) ... [2025-02-05 15:52:55,037 INFO L138 Inliner]: procedures = 57, calls = 105, calls flagged for inlining = 23, calls inlined = 20, statements flattened = 224 [2025-02-05 15:52:55,037 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:52:55,042 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:52:55,042 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:52:55,042 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:52:55,051 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:52:55" (1/1) ... [2025-02-05 15:52:55,051 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:52:55" (1/1) ... [2025-02-05 15:52:55,053 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:52:55" (1/1) ... [2025-02-05 15:52:55,067 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:52:55,067 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:52:55" (1/1) ... [2025-02-05 15:52:55,067 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:52:55" (1/1) ... [2025-02-05 15:52:55,071 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:52:55" (1/1) ... [2025-02-05 15:52:55,072 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:52:55" (1/1) ... [2025-02-05 15:52:55,073 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:52:55" (1/1) ... [2025-02-05 15:52:55,073 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:52:55" (1/1) ... [2025-02-05 15:52:55,074 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:52:55,075 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:52:55,075 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:52:55,075 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:52:55,076 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:52:55" (1/1) ... [2025-02-05 15:52:55,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:52:55,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:52:55,105 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:52:55,108 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:52:55,125 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:52:55,125 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2025-02-05 15:52:55,125 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2025-02-05 15:52:55,125 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2025-02-05 15:52:55,125 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2025-02-05 15:52:55,125 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-02-05 15:52:55,126 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-02-05 15:52:55,126 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-02-05 15:52:55,126 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-02-05 15:52:55,126 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2025-02-05 15:52:55,126 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2025-02-05 15:52:55,126 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2025-02-05 15:52:55,126 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2025-02-05 15:52:55,126 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__methaneQuery [2025-02-05 15:52:55,126 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__methaneQuery [2025-02-05 15:52:55,126 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneAlarm [2025-02-05 15:52:55,126 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneAlarm [2025-02-05 15:52:55,126 INFO L130 BoogieDeclarations]: Found specification of procedure deactivatePump [2025-02-05 15:52:55,126 INFO L138 BoogieDeclarations]: Found implementation of procedure deactivatePump [2025-02-05 15:52:55,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:52:55,127 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2025-02-05 15:52:55,127 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2025-02-05 15:52:55,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:52:55,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:52:55,183 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:52:55,184 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:52:55,256 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L469-1: isLowWaterSensorDry_#res#1 := isLowWaterSensorDry_~retValue_acc~7#1; [2025-02-05 15:52:55,257 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L365-1: isLowWaterLevel_#res#1 := isLowWaterLevel_~retValue_acc~3#1; [2025-02-05 15:52:55,269 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L414: #res := ~retValue_acc~4; [2025-02-05 15:52:55,295 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint cleanupFINAL: assume true; [2025-02-05 15:52:55,326 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L446-1: getWaterLevel_#res#1 := getWaterLevel_~retValue_acc~5#1; [2025-02-05 15:52:55,326 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L291-1: isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~1#1; [2025-02-05 15:52:55,392 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L577-1: main_#res#1 := main_~retValue_acc~8#1; [2025-02-05 15:52:55,392 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L646-1: valid_product_#res#1 := valid_product_~retValue_acc~10#1; [2025-02-05 15:52:55,428 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L346-1: isHighWaterLevel_#res#1 := isHighWaterLevel_~retValue_acc~2#1; [2025-02-05 15:52:55,428 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L460-1: isHighWaterSensorDry_#res#1 := isHighWaterSensorDry_~retValue_acc~6#1; [2025-02-05 15:52:55,439 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L282: #res := ~retValue_acc~0; [2025-02-05 15:52:55,461 INFO L? ?]: Removed 54 outVars from TransFormulas that were not future-live. [2025-02-05 15:52:55,461 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:52:55,475 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:52:55,475 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:52:55,475 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:52:55 BoogieIcfgContainer [2025-02-05 15:52:55,476 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:52:55,478 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:52:55,478 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:52:55,481 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:52:55,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:52:54" (1/3) ... [2025-02-05 15:52:55,482 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@618f3d85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:52:55, skipping insertion in model container [2025-02-05 15:52:55,482 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:52:55" (2/3) ... [2025-02-05 15:52:55,482 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@618f3d85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:52:55, skipping insertion in model container [2025-02-05 15:52:55,482 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:52:55" (3/3) ... [2025-02-05 15:52:55,483 INFO L128 eAbstractionObserver]: Analyzing ICFG minepump_spec3_product61.cil.c [2025-02-05 15:52:55,492 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:52:55,493 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG minepump_spec3_product61.cil.c that has 11 procedures, 109 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-05 15:52:55,538 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:52:55,547 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;@5afa1f1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:52:55,547 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:52:55,550 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 78 states have (on average 1.358974358974359) internal successors, (106), 88 states have internal predecessors, (106), 18 states have call successors, (18), 10 states have call predecessors, (18), 9 states have return successors, (17), 12 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-05 15:52:55,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-05 15:52:55,557 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:52:55,558 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] [2025-02-05 15:52:55,558 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:52:55,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:52:55,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1241955913, now seen corresponding path program 1 times [2025-02-05 15:52:55,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:52:55,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261042110] [2025-02-05 15:52:55,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:52:55,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:52:55,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-05 15:52:55,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-05 15:52:55,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:52:55,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:52:55,684 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:52:55,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:52:55,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261042110] [2025-02-05 15:52:55,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261042110] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:52:55,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:52:55,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 15:52:55,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227479019] [2025-02-05 15:52:55,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:52:55,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 15:52:55,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:52:55,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 15:52:55,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 15:52:55,711 INFO L87 Difference]: Start difference. First operand has 108 states, 78 states have (on average 1.358974358974359) internal successors, (106), 88 states have internal predecessors, (106), 18 states have call successors, (18), 10 states have call predecessors, (18), 9 states have return successors, (17), 12 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 15:52:55,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:52:55,740 INFO L93 Difference]: Finished difference Result 200 states and 269 transitions. [2025-02-05 15:52:55,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 15:52:55,741 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2025-02-05 15:52:55,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:52:55,747 INFO L225 Difference]: With dead ends: 200 [2025-02-05 15:52:55,747 INFO L226 Difference]: Without dead ends: 100 [2025-02-05 15:52:55,750 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:52:55,752 INFO L435 NwaCegarLoop]: 135 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, 135 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:52:55,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:52:55,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-02-05 15:52:55,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-02-05 15:52:55,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 72 states have (on average 1.3194444444444444) internal successors, (95), 81 states have internal predecessors, (95), 18 states have call successors, (18), 10 states have call predecessors, (18), 9 states have return successors, (17), 12 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-05 15:52:55,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 130 transitions. [2025-02-05 15:52:55,797 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 130 transitions. Word has length 25 [2025-02-05 15:52:55,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:52:55,797 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 130 transitions. [2025-02-05 15:52:55,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 15:52:55,797 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 130 transitions. [2025-02-05 15:52:55,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-05 15:52:55,799 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:52:55,799 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] [2025-02-05 15:52:55,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 15:52:55,799 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:52:55,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:52:55,800 INFO L85 PathProgramCache]: Analyzing trace with hash -602688930, now seen corresponding path program 1 times [2025-02-05 15:52:55,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:52:55,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864318936] [2025-02-05 15:52:55,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:52:55,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:52:55,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-05 15:52:55,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-05 15:52:55,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:52:55,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:52:55,868 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:52:55,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:52:55,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864318936] [2025-02-05 15:52:55,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864318936] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:52:55,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:52:55,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:52:55,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199129600] [2025-02-05 15:52:55,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:52:55,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:52:55,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:52:55,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:52:55,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:52:55,870 INFO L87 Difference]: Start difference. First operand 100 states and 130 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 15:52:55,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:52:55,882 INFO L93 Difference]: Finished difference Result 167 states and 217 transitions. [2025-02-05 15:52:55,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:52:55,883 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2025-02-05 15:52:55,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:52:55,884 INFO L225 Difference]: With dead ends: 167 [2025-02-05 15:52:55,884 INFO L226 Difference]: Without dead ends: 91 [2025-02-05 15:52:55,885 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:52:55,885 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 11 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 219 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:52:55,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 219 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:52:55,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-02-05 15:52:55,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-02-05 15:52:55,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 66 states have (on average 1.3333333333333333) internal successors, (88), 75 states have internal predecessors, (88), 15 states have call successors, (15), 9 states have call predecessors, (15), 9 states have return successors, (15), 10 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-05 15:52:55,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 118 transitions. [2025-02-05 15:52:55,892 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 118 transitions. Word has length 26 [2025-02-05 15:52:55,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:52:55,892 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 118 transitions. [2025-02-05 15:52:55,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-05 15:52:55,893 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 118 transitions. [2025-02-05 15:52:55,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-05 15:52:55,893 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:52:55,894 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] [2025-02-05 15:52:55,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 15:52:55,894 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:52:55,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:52:55,894 INFO L85 PathProgramCache]: Analyzing trace with hash 962355577, now seen corresponding path program 1 times [2025-02-05 15:52:55,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:52:55,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084135155] [2025-02-05 15:52:55,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:52:55,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:52:55,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-05 15:52:55,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-05 15:52:55,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:52:55,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:52:55,973 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:52:55,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:52:55,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084135155] [2025-02-05 15:52:55,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084135155] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:52:55,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:52:55,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:52:55,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048689271] [2025-02-05 15:52:55,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:52:55,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:52:55,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:52:55,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:52:55,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:52:55,974 INFO L87 Difference]: Start difference. First operand 91 states and 118 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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:52:55,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:52:55,991 INFO L93 Difference]: Finished difference Result 175 states and 230 transitions. [2025-02-05 15:52:55,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:52:55,991 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 29 [2025-02-05 15:52:55,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:52:55,992 INFO L225 Difference]: With dead ends: 175 [2025-02-05 15:52:55,992 INFO L226 Difference]: Without dead ends: 91 [2025-02-05 15:52:55,993 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:52:55,994 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 101 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 116 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:52:55,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 116 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:52:55,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-02-05 15:52:56,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-02-05 15:52:56,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 66 states have (on average 1.3181818181818181) internal successors, (87), 75 states have internal predecessors, (87), 15 states have call successors, (15), 9 states have call predecessors, (15), 9 states have return successors, (15), 10 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-05 15:52:56,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 117 transitions. [2025-02-05 15:52:56,001 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 117 transitions. Word has length 29 [2025-02-05 15:52:56,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:52:56,001 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 117 transitions. [2025-02-05 15:52:56,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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:52:56,002 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 117 transitions. [2025-02-05 15:52:56,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-05 15:52:56,003 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:52:56,003 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, 1] [2025-02-05 15:52:56,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 15:52:56,003 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:52:56,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:52:56,004 INFO L85 PathProgramCache]: Analyzing trace with hash -640491153, now seen corresponding path program 1 times [2025-02-05 15:52:56,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:52:56,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522737215] [2025-02-05 15:52:56,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:52:56,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:52:56,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-05 15:52:56,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-05 15:52:56,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:52:56,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:52:56,108 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:52:56,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:52:56,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522737215] [2025-02-05 15:52:56,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522737215] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:52:56,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:52:56,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:52:56,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698867123] [2025-02-05 15:52:56,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:52:56,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:52:56,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:52:56,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:52:56,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:52:56,110 INFO L87 Difference]: Start difference. First operand 91 states and 117 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-05 15:52:56,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:52:56,343 INFO L93 Difference]: Finished difference Result 265 states and 339 transitions. [2025-02-05 15:52:56,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 15:52:56,344 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) Word has length 44 [2025-02-05 15:52:56,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:52:56,346 INFO L225 Difference]: With dead ends: 265 [2025-02-05 15:52:56,346 INFO L226 Difference]: Without dead ends: 181 [2025-02-05 15:52:56,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:52:56,347 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 226 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 15:52:56,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 314 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 15:52:56,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-02-05 15:52:56,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 175. [2025-02-05 15:52:56,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 129 states have (on average 1.255813953488372) internal successors, (162), 138 states have internal predecessors, (162), 22 states have call successors, (22), 18 states have call predecessors, (22), 23 states have return successors, (29), 24 states have call predecessors, (29), 22 states have call successors, (29) [2025-02-05 15:52:56,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 213 transitions. [2025-02-05 15:52:56,376 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 213 transitions. Word has length 44 [2025-02-05 15:52:56,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:52:56,377 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 213 transitions. [2025-02-05 15:52:56,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-05 15:52:56,377 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 213 transitions. [2025-02-05 15:52:56,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-05 15:52:56,380 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:52:56,380 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, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:52:56,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 15:52:56,381 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:52:56,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:52:56,381 INFO L85 PathProgramCache]: Analyzing trace with hash -394015765, now seen corresponding path program 1 times [2025-02-05 15:52:56,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:52:56,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607665209] [2025-02-05 15:52:56,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:52:56,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:52:56,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-05 15:52:56,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-05 15:52:56,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:52:56,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:52:56,534 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:52:56,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:52:56,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607665209] [2025-02-05 15:52:56,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607665209] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:52:56,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:52:56,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:52:56,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55893154] [2025-02-05 15:52:56,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:52:56,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:52:56,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:52:56,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:52:56,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:52:56,536 INFO L87 Difference]: Start difference. First operand 175 states and 213 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-05 15:52:56,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:52:56,598 INFO L93 Difference]: Finished difference Result 438 states and 555 transitions. [2025-02-05 15:52:56,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:52:56,599 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 50 [2025-02-05 15:52:56,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:52:56,608 INFO L225 Difference]: With dead ends: 438 [2025-02-05 15:52:56,608 INFO L226 Difference]: Without dead ends: 270 [2025-02-05 15:52:56,609 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:52:56,609 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 54 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:52:56,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 433 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:52:56,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-02-05 15:52:56,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2025-02-05 15:52:56,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 199 states have (on average 1.2462311557788945) internal successors, (248), 211 states have internal predecessors, (248), 35 states have call successors, (35), 30 states have call predecessors, (35), 35 states have return successors, (48), 37 states have call predecessors, (48), 35 states have call successors, (48) [2025-02-05 15:52:56,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 331 transitions. [2025-02-05 15:52:56,644 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 331 transitions. Word has length 50 [2025-02-05 15:52:56,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:52:56,645 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 331 transitions. [2025-02-05 15:52:56,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-05 15:52:56,646 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 331 transitions. [2025-02-05 15:52:56,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-05 15:52:56,648 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:52:56,648 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:52:56,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 15:52:56,649 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:52:56,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:52:56,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1499316055, now seen corresponding path program 1 times [2025-02-05 15:52:56,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:52:56,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676621369] [2025-02-05 15:52:56,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:52:56,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:52:56,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-05 15:52:56,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-05 15:52:56,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:52:56,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:52:56,782 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:52:56,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:52:56,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676621369] [2025-02-05 15:52:56,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676621369] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:52:56,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:52:56,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:52:56,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597265857] [2025-02-05 15:52:56,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:52:56,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:52:56,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:52:56,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:52:56,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:52:56,784 INFO L87 Difference]: Start difference. First operand 270 states and 331 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 15:52:56,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:52:56,846 INFO L93 Difference]: Finished difference Result 592 states and 758 transitions. [2025-02-05 15:52:56,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:52:56,846 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 54 [2025-02-05 15:52:56,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:52:56,848 INFO L225 Difference]: With dead ends: 592 [2025-02-05 15:52:56,848 INFO L226 Difference]: Without dead ends: 424 [2025-02-05 15:52:56,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:52:56,850 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 91 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:52:56,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 426 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:52:56,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2025-02-05 15:52:56,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 420. [2025-02-05 15:52:56,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 308 states have (on average 1.2305194805194806) internal successors, (379), 326 states have internal predecessors, (379), 55 states have call successors, (55), 46 states have call predecessors, (55), 56 states have return successors, (85), 59 states have call predecessors, (85), 55 states have call successors, (85) [2025-02-05 15:52:56,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 519 transitions. [2025-02-05 15:52:56,913 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 519 transitions. Word has length 54 [2025-02-05 15:52:56,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:52:56,913 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 519 transitions. [2025-02-05 15:52:56,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 15:52:56,914 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 519 transitions. [2025-02-05 15:52:56,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-05 15:52:56,915 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:52:56,915 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:52:56,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 15:52:56,915 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:52:56,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:52:56,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1437276441, now seen corresponding path program 1 times [2025-02-05 15:52:56,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:52:56,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097143030] [2025-02-05 15:52:56,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:52:56,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:52:56,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-05 15:52:56,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-05 15:52:56,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:52:56,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:52:56,956 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:52:56,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:52:56,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097143030] [2025-02-05 15:52:56,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097143030] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:52:56,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:52:56,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:52:56,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340928405] [2025-02-05 15:52:56,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:52:56,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:52:56,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:52:56,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:52:56,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:52:56,958 INFO L87 Difference]: Start difference. First operand 420 states and 519 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 15:52:56,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:52:56,990 INFO L93 Difference]: Finished difference Result 742 states and 927 transitions. [2025-02-05 15:52:56,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:52:56,990 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 54 [2025-02-05 15:52:56,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:52:56,992 INFO L225 Difference]: With dead ends: 742 [2025-02-05 15:52:56,992 INFO L226 Difference]: Without dead ends: 420 [2025-02-05 15:52:56,993 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:52:56,994 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:52:56,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 342 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:52:56,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2025-02-05 15:52:57,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 420. [2025-02-05 15:52:57,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 308 states have (on average 1.2272727272727273) internal successors, (378), 326 states have internal predecessors, (378), 55 states have call successors, (55), 46 states have call predecessors, (55), 56 states have return successors, (85), 59 states have call predecessors, (85), 55 states have call successors, (85) [2025-02-05 15:52:57,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 518 transitions. [2025-02-05 15:52:57,018 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 518 transitions. Word has length 54 [2025-02-05 15:52:57,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:52:57,018 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 518 transitions. [2025-02-05 15:52:57,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 15:52:57,018 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 518 transitions. [2025-02-05 15:52:57,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-05 15:52:57,019 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:52:57,019 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:52:57,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 15:52:57,021 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:52:57,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:52:57,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1504283194, now seen corresponding path program 1 times [2025-02-05 15:52:57,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:52:57,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633467006] [2025-02-05 15:52:57,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:52:57,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:52:57,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-05 15:52:57,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-05 15:52:57,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:52:57,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:52:57,108 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:52:57,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:52:57,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633467006] [2025-02-05 15:52:57,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633467006] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:52:57,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:52:57,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:52:57,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729899532] [2025-02-05 15:52:57,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:52:57,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:52:57,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:52:57,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:52:57,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:52:57,109 INFO L87 Difference]: Start difference. First operand 420 states and 518 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 15:52:57,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:52:57,177 INFO L93 Difference]: Finished difference Result 836 states and 1050 transitions. [2025-02-05 15:52:57,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:52:57,178 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 54 [2025-02-05 15:52:57,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:52:57,180 INFO L225 Difference]: With dead ends: 836 [2025-02-05 15:52:57,180 INFO L226 Difference]: Without dead ends: 423 [2025-02-05 15:52:57,181 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:52:57,181 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:52:57,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 456 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:52:57,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2025-02-05 15:52:57,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 423. [2025-02-05 15:52:57,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 313 states have (on average 1.220447284345048) internal successors, (382), 330 states have internal predecessors, (382), 54 states have call successors, (54), 45 states have call predecessors, (54), 55 states have return successors, (84), 58 states have call predecessors, (84), 54 states have call successors, (84) [2025-02-05 15:52:57,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 520 transitions. [2025-02-05 15:52:57,216 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 520 transitions. Word has length 54 [2025-02-05 15:52:57,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:52:57,216 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 520 transitions. [2025-02-05 15:52:57,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 15:52:57,216 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 520 transitions. [2025-02-05 15:52:57,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-05 15:52:57,217 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:52:57,217 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, 1, 1, 1, 1, 1, 1] [2025-02-05 15:52:57,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 15:52:57,218 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:52:57,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:52:57,219 INFO L85 PathProgramCache]: Analyzing trace with hash -575163082, now seen corresponding path program 1 times [2025-02-05 15:52:57,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:52:57,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348643507] [2025-02-05 15:52:57,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:52:57,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:52:57,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-05 15:52:57,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-05 15:52:57,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:52:57,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:52:57,389 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:52:57,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:52:57,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348643507] [2025-02-05 15:52:57,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348643507] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:52:57,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984492942] [2025-02-05 15:52:57,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:52:57,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:52:57,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:52:57,395 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:52:57,396 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:52:57,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-05 15:52:57,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-05 15:52:57,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:52:57,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:52:57,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-05 15:52:57,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:52:57,606 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:52:57,606 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:52:57,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [984492942] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:52:57,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:52:57,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2025-02-05 15:52:57,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688643769] [2025-02-05 15:52:57,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:52:57,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 15:52:57,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:52:57,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 15:52:57,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-02-05 15:52:57,608 INFO L87 Difference]: Start difference. First operand 423 states and 520 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-05 15:52:57,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:52:57,802 INFO L93 Difference]: Finished difference Result 1236 states and 1550 transitions. [2025-02-05 15:52:57,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:52:57,802 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) Word has length 63 [2025-02-05 15:52:57,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:52:57,806 INFO L225 Difference]: With dead ends: 1236 [2025-02-05 15:52:57,806 INFO L226 Difference]: Without dead ends: 820 [2025-02-05 15:52:57,807 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-02-05 15:52:57,807 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 68 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:52:57,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 624 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:52:57,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2025-02-05 15:52:57,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 818. [2025-02-05 15:52:57,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 603 states have (on average 1.208955223880597) internal successors, (729), 633 states have internal predecessors, (729), 107 states have call successors, (107), 90 states have call predecessors, (107), 107 states have return successors, (169), 113 states have call predecessors, (169), 107 states have call successors, (169) [2025-02-05 15:52:57,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1005 transitions. [2025-02-05 15:52:57,851 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1005 transitions. Word has length 63 [2025-02-05 15:52:57,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:52:57,852 INFO L471 AbstractCegarLoop]: Abstraction has 818 states and 1005 transitions. [2025-02-05 15:52:57,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-05 15:52:57,852 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1005 transitions. [2025-02-05 15:52:57,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-05 15:52:57,853 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:52:57,853 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, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:52:57,860 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:52:58,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:52:58,058 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:52:58,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:52:58,059 INFO L85 PathProgramCache]: Analyzing trace with hash -211277646, now seen corresponding path program 1 times [2025-02-05 15:52:58,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:52:58,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993565983] [2025-02-05 15:52:58,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:52:58,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:52:58,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-05 15:52:58,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-05 15:52:58,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:52:58,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:52:58,117 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:52:58,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:52:58,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993565983] [2025-02-05 15:52:58,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993565983] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:52:58,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:52:58,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:52:58,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380173565] [2025-02-05 15:52:58,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:52:58,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:52:58,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:52:58,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:52:58,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:52:58,119 INFO L87 Difference]: Start difference. First operand 818 states and 1005 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-05 15:52:58,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:52:58,208 INFO L93 Difference]: Finished difference Result 1629 states and 2003 transitions. [2025-02-05 15:52:58,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:52:58,209 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 64 [2025-02-05 15:52:58,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:52:58,213 INFO L225 Difference]: With dead ends: 1629 [2025-02-05 15:52:58,213 INFO L226 Difference]: Without dead ends: 818 [2025-02-05 15:52:58,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:52:58,215 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 70 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:52:58,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 532 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:52:58,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2025-02-05 15:52:58,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 818. [2025-02-05 15:52:58,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 603 states have (on average 1.1923714759535655) internal successors, (719), 633 states have internal predecessors, (719), 107 states have call successors, (107), 90 states have call predecessors, (107), 107 states have return successors, (154), 113 states have call predecessors, (154), 107 states have call successors, (154) [2025-02-05 15:52:58,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 980 transitions. [2025-02-05 15:52:58,276 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 980 transitions. Word has length 64 [2025-02-05 15:52:58,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:52:58,276 INFO L471 AbstractCegarLoop]: Abstraction has 818 states and 980 transitions. [2025-02-05 15:52:58,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-05 15:52:58,276 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 980 transitions. [2025-02-05 15:52:58,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 15:52:58,278 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:52:58,278 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:52:58,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 15:52:58,278 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:52:58,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:52:58,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1750291689, now seen corresponding path program 1 times [2025-02-05 15:52:58,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:52:58,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103071936] [2025-02-05 15:52:58,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:52:58,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:52:58,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 15:52:58,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 15:52:58,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:52:58,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:52:58,363 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:52:58,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:52:58,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103071936] [2025-02-05 15:52:58,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103071936] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:52:58,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:52:58,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 15:52:58,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227814973] [2025-02-05 15:52:58,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:52:58,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 15:52:58,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:52:58,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 15:52:58,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:52:58,365 INFO L87 Difference]: Start difference. First operand 818 states and 980 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 15:52:58,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:52:58,586 INFO L93 Difference]: Finished difference Result 1601 states and 1935 transitions. [2025-02-05 15:52:58,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:52:58,586 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 67 [2025-02-05 15:52:58,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:52:58,590 INFO L225 Difference]: With dead ends: 1601 [2025-02-05 15:52:58,590 INFO L226 Difference]: Without dead ends: 790 [2025-02-05 15:52:58,591 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2025-02-05 15:52:58,592 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 239 mSDsluCounter, 870 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 1078 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:52:58,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 1078 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:52:58,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2025-02-05 15:52:58,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2025-02-05 15:52:58,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 790 states, 575 states have (on average 1.1634782608695653) internal successors, (669), 605 states have internal predecessors, (669), 107 states have call successors, (107), 90 states have call predecessors, (107), 107 states have return successors, (148), 113 states have call predecessors, (148), 107 states have call successors, (148) [2025-02-05 15:52:58,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 924 transitions. [2025-02-05 15:52:58,630 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 924 transitions. Word has length 67 [2025-02-05 15:52:58,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:52:58,630 INFO L471 AbstractCegarLoop]: Abstraction has 790 states and 924 transitions. [2025-02-05 15:52:58,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 15:52:58,631 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 924 transitions. [2025-02-05 15:52:58,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-05 15:52:58,633 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:52:58,633 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1] [2025-02-05 15:52:58,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 15:52:58,633 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:52:58,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:52:58,634 INFO L85 PathProgramCache]: Analyzing trace with hash -559049226, now seen corresponding path program 1 times [2025-02-05 15:52:58,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:52:58,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042907494] [2025-02-05 15:52:58,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:52:58,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:52:58,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-05 15:52:58,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-05 15:52:58,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:52:58,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:52:58,806 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-05 15:52:58,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:52:58,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042907494] [2025-02-05 15:52:58,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042907494] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:52:58,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570584152] [2025-02-05 15:52:58,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:52:58,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:52:58,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:52:58,810 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:52:58,811 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:52:58,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-05 15:52:58,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-05 15:52:58,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:52:58,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:52:58,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-05 15:52:58,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:52:58,990 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 17 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-05 15:52:58,990 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:52:59,317 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-05 15:52:59,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [570584152] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:52:59,318 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:52:59,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 9] total 15 [2025-02-05 15:52:59,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150630043] [2025-02-05 15:52:59,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:52:59,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-05 15:52:59,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:52:59,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-05 15:52:59,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2025-02-05 15:52:59,319 INFO L87 Difference]: Start difference. First operand 790 states and 924 transitions. Second operand has 15 states, 15 states have (on average 7.066666666666666) internal successors, (106), 13 states have internal predecessors, (106), 7 states have call successors, (23), 8 states have call predecessors, (23), 8 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) [2025-02-05 15:53:00,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:53:00,134 INFO L93 Difference]: Finished difference Result 1535 states and 1854 transitions. [2025-02-05 15:53:00,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-05 15:53:00,137 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 7.066666666666666) internal successors, (106), 13 states have internal predecessors, (106), 7 states have call successors, (23), 8 states have call predecessors, (23), 8 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) Word has length 103 [2025-02-05 15:53:00,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:53:00,138 INFO L225 Difference]: With dead ends: 1535 [2025-02-05 15:53:00,138 INFO L226 Difference]: Without dead ends: 0 [2025-02-05 15:53:00,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 199 SyntacticMatches, 7 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=419, Unknown=0, NotChecked=0, Total=650 [2025-02-05 15:53:00,142 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 442 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 15:53:00,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 323 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 15:53:00,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-05 15:53:00,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-05 15:53:00,142 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:53:00,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-05 15:53:00,143 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 103 [2025-02-05 15:53:00,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:53:00,143 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-05 15:53:00,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.066666666666666) internal successors, (106), 13 states have internal predecessors, (106), 7 states have call successors, (23), 8 states have call predecessors, (23), 8 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) [2025-02-05 15:53:00,144 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-05 15:53:00,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-05 15:53:00,146 INFO L782 garLoopResultBuilder]: Registering result SAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 15:53:00,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 15:53:00,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:53:00,351 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:53:00,352 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-05 15:53:04,497 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 15:53:04,506 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 03:53:04 BoogieIcfgContainer [2025-02-05 15:53:04,507 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 15:53:04,507 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 15:53:04,507 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 15:53:04,508 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 15:53:04,508 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:52:55" (3/4) ... [2025-02-05 15:53:04,510 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-05 15:53:04,517 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure deactivatePump [2025-02-05 15:53:04,518 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__base [2025-02-05 15:53:04,518 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure changeMethaneLevel [2025-02-05 15:53:04,518 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure isMethaneLevelCritical [2025-02-05 15:53:04,518 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure cleanup [2025-02-05 15:53:04,518 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure timeShift [2025-02-05 15:53:04,518 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__highWaterSensor [2025-02-05 15:53:04,518 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure waterRise [2025-02-05 15:53:04,518 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__methaneQuery [2025-02-05 15:53:04,518 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure isMethaneAlarm [2025-02-05 15:53:04,522 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2025-02-05 15:53:04,523 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-02-05 15:53:04,523 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-05 15:53:04,523 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-05 15:53:04,523 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-05 15:53:04,586 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-05 15:53:04,586 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-05 15:53:04,586 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 15:53:04,587 INFO L158 Benchmark]: Toolchain (without parser) took 9945.10ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 122.6MB in the beginning and 188.6MB in the end (delta: -66.0MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. [2025-02-05 15:53:04,587 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 209.7MB. Free memory is still 128.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 15:53:04,587 INFO L158 Benchmark]: CACSL2BoogieTranslator took 360.41ms. Allocated memory is still 167.8MB. Free memory was 122.1MB in the beginning and 103.4MB in the end (delta: 18.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 15:53:04,587 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.67ms. Allocated memory is still 167.8MB. Free memory was 103.4MB in the beginning and 101.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 15:53:04,587 INFO L158 Benchmark]: Boogie Preprocessor took 32.69ms. Allocated memory is still 167.8MB. Free memory was 101.2MB in the beginning and 99.5MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 15:53:04,588 INFO L158 Benchmark]: IcfgBuilder took 401.47ms. Allocated memory is still 167.8MB. Free memory was 99.5MB in the beginning and 79.6MB in the end (delta: 19.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 15:53:04,588 INFO L158 Benchmark]: TraceAbstraction took 9028.89ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 79.2MB in the beginning and 197.0MB in the end (delta: -117.8MB). Peak memory consumption was 88.3MB. Max. memory is 16.1GB. [2025-02-05 15:53:04,588 INFO L158 Benchmark]: Witness Printer took 78.85ms. Allocated memory is still 243.3MB. Free memory was 197.0MB in the beginning and 188.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 15:53:04,589 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 209.7MB. Free memory is still 128.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 360.41ms. Allocated memory is still 167.8MB. Free memory was 122.1MB in the beginning and 103.4MB in the end (delta: 18.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.67ms. Allocated memory is still 167.8MB. Free memory was 103.4MB in the beginning and 101.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.69ms. Allocated memory is still 167.8MB. Free memory was 101.2MB in the beginning and 99.5MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 401.47ms. Allocated memory is still 167.8MB. Free memory was 99.5MB in the beginning and 79.6MB in the end (delta: 19.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 9028.89ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 79.2MB in the beginning and 197.0MB in the end (delta: -117.8MB). Peak memory consumption was 88.3MB. Max. memory is 16.1GB. * Witness Printer took 78.85ms. Allocated memory is still 243.3MB. Free memory was 197.0MB in the beginning and 188.6MB in the end (delta: 8.4MB). 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,"scenario.i","") [49] - GenericResultAtLocation [Line: 118]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [118] - GenericResultAtLocation [Line: 368]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [368] - GenericResultAtLocation [Line: 472]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [472] - GenericResultAtLocation [Line: 481]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [481] - GenericResultAtLocation [Line: 580]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification3_spec.i","") [580] - GenericResultAtLocation [Line: 614]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [614] - GenericResultAtLocation [Line: 649]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [649] * 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: 477]: 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 11 procedures, 109 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.8s, OverallIterations: 12, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1315 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1302 mSDsluCounter, 4998 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3518 mSDsCounter, 306 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 988 IncrementalHoareTripleChecker+Invalid, 1294 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 306 mSolverCounterUnsat, 1480 mSDtfsCounter, 988 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 367 GetRequests, 284 SyntacticMatches, 7 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=818occurred in iteration=9, InterpolantAutomatonStates: 71, 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, 12 MinimizatonAttempts, 12 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 799 NumberOfCodeBlocks, 799 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 887 ConstructedInterpolants, 0 QuantifiedInterpolants, 1774 SizeOfPredicates, 2 NumberOfNonLiveVariables, 574 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 15 InterpolantComputations, 11 PerfectInterpolantSequences, 102/129 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: 64]: Location Invariant Derived location invariant: ((((((((methaneLevelCritical == 0) && (1 == systemActive)) && (splverifierCounter == 0)) && (waterLevel <= 2)) && (pumpRunning == 1)) || (((((1 == systemActive) && (methaneLevelCritical == 1)) && (splverifierCounter == 0)) && (waterLevel <= 2)) && (pumpRunning == 1))) || (((((pumpRunning == 0) && (1 == systemActive)) && (methaneLevelCritical == 1)) && (splverifierCounter == 0)) && (waterLevel <= 2))) || (((((pumpRunning == 0) && (methaneLevelCritical == 0)) && (waterLevel <= 1)) && (1 == systemActive)) && (splverifierCounter == 0))) - InvariantResult [Line: 493]: Location Invariant Derived location invariant: 0 RESULT: Ultimate proved your program to be correct! [2025-02-05 15:53:04,608 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